./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/cmp-freed-ptr.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/cmp-freed-ptr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 63302b5441ba85cd38f4ed3669bf40852137e8be39297cc19159731ba051a536 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:43:52,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:43:52,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:43:52,539 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:43:52,540 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:43:52,542 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:43:52,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:43:52,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:43:52,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:43:52,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:43:52,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:43:52,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:43:52,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:43:52,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:43:52,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:43:52,558 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:43:52,559 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:43:52,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:43:52,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:43:52,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:43:52,566 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:43:52,567 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:43:52,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:43:52,569 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:43:52,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:43:52,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:43:52,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:43:52,576 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:43:52,576 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:43:52,577 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:43:52,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:43:52,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:43:52,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:43:52,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:43:52,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:43:52,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:43:52,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:43:52,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:43:52,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:43:52,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:43:52,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:43:52,584 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:43:52,608 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:43:52,608 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:43:52,609 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:43:52,609 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:43:52,610 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:43:52,610 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:43:52,610 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:43:52,610 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:43:52,611 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:43:52,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:43:52,611 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:43:52,612 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:43:52,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:43:52,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:43:52,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:43:52,612 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:43:52,612 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:43:52,612 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:43:52,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:43:52,613 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:43:52,613 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:43:52,613 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:43:52,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:43:52,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:43:52,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:43:52,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:43:52,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:43:52,615 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:43:52,615 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:43:52,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:43:52,615 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 63302b5441ba85cd38f4ed3669bf40852137e8be39297cc19159731ba051a536 [2022-02-20 23:43:52,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:43:52,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:43:52,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:43:52,838 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:43:52,838 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:43:52,839 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/cmp-freed-ptr.i [2022-02-20 23:43:52,902 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f07df0ab/2f7bbc31b5a94a1ca38a45894919fe4d/FLAG71e5a5110 [2022-02-20 23:43:53,215 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:43:53,217 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/cmp-freed-ptr.i [2022-02-20 23:43:53,225 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f07df0ab/2f7bbc31b5a94a1ca38a45894919fe4d/FLAG71e5a5110 [2022-02-20 23:43:53,604 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f07df0ab/2f7bbc31b5a94a1ca38a45894919fe4d [2022-02-20 23:43:53,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:43:53,607 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:43:53,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:43:53,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:43:53,613 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:43:53,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:43:53" (1/1) ... [2022-02-20 23:43:53,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50a195aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:53, skipping insertion in model container [2022-02-20 23:43:53,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:43:53" (1/1) ... [2022-02-20 23:43:53,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:43:53,650 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:43:53,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:43:53,838 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:43:53,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:43:53,904 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:43:53,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:53 WrapperNode [2022-02-20 23:43:53,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:43:53,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:43:53,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:43:53,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:43:53,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:53" (1/1) ... [2022-02-20 23:43:53,923 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:53" (1/1) ... [2022-02-20 23:43:53,941 INFO L137 Inliner]: procedures = 112, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2022-02-20 23:43:53,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:43:53,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:43:53,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:43:53,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:43:53,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:53" (1/1) ... [2022-02-20 23:43:53,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:53" (1/1) ... [2022-02-20 23:43:53,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:53" (1/1) ... [2022-02-20 23:43:53,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:53" (1/1) ... [2022-02-20 23:43:53,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:53" (1/1) ... [2022-02-20 23:43:53,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:53" (1/1) ... [2022-02-20 23:43:53,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:53" (1/1) ... [2022-02-20 23:43:53,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:43:53,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:43:53,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:43:53,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:43:53,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:53" (1/1) ... [2022-02-20 23:43:53,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:43:53,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:53,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:43:54,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:43:54,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:43:54,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:43:54,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:43:54,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:43:54,067 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:43:54,068 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:43:54,198 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:43:54,206 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:43:54,206 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:43:54,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:43:54 BoogieIcfgContainer [2022-02-20 23:43:54,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:43:54,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:43:54,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:43:54,222 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:43:54,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:43:53" (1/3) ... [2022-02-20 23:43:54,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8f3d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:43:54, skipping insertion in model container [2022-02-20 23:43:54,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:53" (2/3) ... [2022-02-20 23:43:54,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8f3d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:43:54, skipping insertion in model container [2022-02-20 23:43:54,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:43:54" (3/3) ... [2022-02-20 23:43:54,224 INFO L111 eAbstractionObserver]: Analyzing ICFG cmp-freed-ptr.i [2022-02-20 23:43:54,230 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:43:54,230 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-02-20 23:43:54,270 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:43:54,274 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:43:54,274 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-02-20 23:43:54,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 24 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-20 23:43:54,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:43:54,288 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:54,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:43:54,289 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2022-02-20 23:43:54,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:54,295 INFO L85 PathProgramCache]: Analyzing trace with hash 29856, now seen corresponding path program 1 times [2022-02-20 23:43:54,301 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:54,302 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277195818] [2022-02-20 23:43:54,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:54,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:54,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {28#true} is VALID [2022-02-20 23:43:54,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~adressY~0#1, main_~adressX~0#1;main_~x~0#1.base, main_~x~0#1.offset := 0, 0;main_~y~0#1.base, main_~y~0#1.offset := 0, 0;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;main_~adressY~0#1 := main_~y~0#1.base + main_~y~0#1.offset; {30#(= |ULTIMATE.start_main_~y~0#1.offset| 0)} is VALID [2022-02-20 23:43:54,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#(= |ULTIMATE.start_main_~y~0#1.offset| 0)} assume !(0 == main_~y~0#1.offset); {29#false} is VALID [2022-02-20 23:43:54,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:54,445 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:54,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277195818] [2022-02-20 23:43:54,445 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277195818] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:54,446 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:54,446 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:43:54,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986591141] [2022-02-20 23:43:54,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:54,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:43:54,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:54,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:54,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:43:54,468 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:54,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:43:54,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:54,488 INFO L87 Difference]: Start difference. First operand has 25 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 24 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-20 23:43:54,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:54,534 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-02-20 23:43:54,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:43:54,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:43:54,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-02-20 23:43:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-02-20 23:43:54,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 25 transitions. [2022-02-20 23:43:54,581 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-20 23:43:54,589 INFO L225 Difference]: With dead ends: 24 [2022-02-20 23:43:54,590 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 23:43:54,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:54,596 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:54,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 24 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:54,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 23:43:54,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 23:43:54,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:54,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 21 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,622 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 21 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,623 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 21 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:54,628 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-02-20 23:43:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-02-20 23:43:54,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:54,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:54,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 21 states have internal predecessors, (22), 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 22 states. [2022-02-20 23:43:54,629 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 21 states have internal predecessors, (22), 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 22 states. [2022-02-20 23:43:54,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:54,630 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-02-20 23:43:54,630 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-02-20 23:43:54,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:54,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:54,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:54,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:54,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 21 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-02-20 23:43:54,633 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 3 [2022-02-20 23:43:54,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:54,633 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-02-20 23:43:54,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,633 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-02-20 23:43:54,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:43:54,633 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:54,634 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:43:54,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:43:54,634 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2022-02-20 23:43:54,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:54,634 INFO L85 PathProgramCache]: Analyzing trace with hash 925572, now seen corresponding path program 1 times [2022-02-20 23:43:54,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:54,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785000235] [2022-02-20 23:43:54,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:54,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:54,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {123#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {123#true} is VALID [2022-02-20 23:43:54,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~adressY~0#1, main_~adressX~0#1;main_~x~0#1.base, main_~x~0#1.offset := 0, 0;main_~y~0#1.base, main_~y~0#1.offset := 0, 0;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;main_~adressY~0#1 := main_~y~0#1.base + main_~y~0#1.offset; {125#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~y~0#1.base|))} is VALID [2022-02-20 23:43:54,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {125#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~y~0#1.base|))} assume 0 == main_~y~0#1.offset; {125#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~y~0#1.base|))} is VALID [2022-02-20 23:43:54,678 INFO L290 TraceCheckUtils]: 3: Hoare triple {125#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~y~0#1.base|))} assume !(main_~y~0#1.base < #StackHeapBarrier); {124#false} is VALID [2022-02-20 23:43:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:54,678 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:54,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785000235] [2022-02-20 23:43:54,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785000235] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:54,679 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:54,679 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:43:54,679 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890002927] [2022-02-20 23:43:54,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:54,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-02-20 23:43:54,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:54,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:54,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:43:54,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:54,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:43:54,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:54,687 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:54,724 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-02-20 23:43:54,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:43:54,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-02-20 23:43:54,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:54,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-02-20 23:43:54,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-02-20 23:43:54,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 22 transitions. [2022-02-20 23:43:54,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:54,752 INFO L225 Difference]: With dead ends: 21 [2022-02-20 23:43:54,752 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 23:43:54,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:54,754 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:54,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 14 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:54,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 23:43:54,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 23:43:54,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:54,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 20 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,760 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 20 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,761 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 20 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:54,762 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-02-20 23:43:54,762 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-02-20 23:43:54,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:54,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:54,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 20 states have internal predecessors, (21), 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 21 states. [2022-02-20 23:43:54,764 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 20 states have internal predecessors, (21), 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 21 states. [2022-02-20 23:43:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:54,765 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-02-20 23:43:54,765 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-02-20 23:43:54,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:54,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:54,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:54,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:54,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 20 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-02-20 23:43:54,769 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 4 [2022-02-20 23:43:54,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:54,769 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-02-20 23:43:54,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,769 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-02-20 23:43:54,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:43:54,770 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:54,770 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:43:54,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:43:54,770 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2022-02-20 23:43:54,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:54,771 INFO L85 PathProgramCache]: Analyzing trace with hash 28692770, now seen corresponding path program 1 times [2022-02-20 23:43:54,771 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:54,771 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218905124] [2022-02-20 23:43:54,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:54,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:54,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {212#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {212#true} is VALID [2022-02-20 23:43:54,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~adressY~0#1, main_~adressX~0#1;main_~x~0#1.base, main_~x~0#1.offset := 0, 0;main_~y~0#1.base, main_~y~0#1.offset := 0, 0;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;main_~adressY~0#1 := main_~y~0#1.base + main_~y~0#1.offset; {214#(= (select |#valid| |ULTIMATE.start_main_~y~0#1.base|) 1)} is VALID [2022-02-20 23:43:54,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {214#(= (select |#valid| |ULTIMATE.start_main_~y~0#1.base|) 1)} assume 0 == main_~y~0#1.offset; {214#(= (select |#valid| |ULTIMATE.start_main_~y~0#1.base|) 1)} is VALID [2022-02-20 23:43:54,836 INFO L290 TraceCheckUtils]: 3: Hoare triple {214#(= (select |#valid| |ULTIMATE.start_main_~y~0#1.base|) 1)} assume main_~y~0#1.base < #StackHeapBarrier; {214#(= (select |#valid| |ULTIMATE.start_main_~y~0#1.base|) 1)} is VALID [2022-02-20 23:43:54,843 INFO L290 TraceCheckUtils]: 4: Hoare triple {214#(= (select |#valid| |ULTIMATE.start_main_~y~0#1.base|) 1)} assume !(0 == main_~y~0#1.base || 1 == #valid[main_~y~0#1.base]); {213#false} is VALID [2022-02-20 23:43:54,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:54,845 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:54,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218905124] [2022-02-20 23:43:54,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218905124] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:54,846 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:54,846 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:43:54,847 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733551697] [2022-02-20 23:43:54,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:54,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-02-20 23:43:54,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:54,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:54,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:43:54,854 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:54,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:43:54,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:54,855 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:54,884 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-02-20 23:43:54,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:43:54,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-02-20 23:43:54,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:54,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-02-20 23:43:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-02-20 23:43:54,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2022-02-20 23:43:54,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:54,908 INFO L225 Difference]: With dead ends: 20 [2022-02-20 23:43:54,909 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 23:43:54,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:54,914 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:54,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:54,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 23:43:54,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-20 23:43:54,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:54,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,919 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,921 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:54,922 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-02-20 23:43:54,923 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-02-20 23:43:54,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:54,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:54,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 19 states have internal predecessors, (20), 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 20 states. [2022-02-20 23:43:54,923 INFO L87 Difference]: Start difference. First operand has 20 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 19 states have internal predecessors, (20), 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 20 states. [2022-02-20 23:43:54,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:54,924 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-02-20 23:43:54,924 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-02-20 23:43:54,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:54,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:54,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:54,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-02-20 23:43:54,931 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 5 [2022-02-20 23:43:54,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:54,933 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-02-20 23:43:54,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,934 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-02-20 23:43:54,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:43:54,934 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:54,935 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:54,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:43:54,936 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2022-02-20 23:43:54,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:54,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949765, now seen corresponding path program 1 times [2022-02-20 23:43:54,939 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:54,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624108092] [2022-02-20 23:43:54,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:54,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:54,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {297#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {297#true} is VALID [2022-02-20 23:43:54,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {297#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~adressY~0#1, main_~adressX~0#1;main_~x~0#1.base, main_~x~0#1.offset := 0, 0;main_~y~0#1.base, main_~y~0#1.offset := 0, 0;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;main_~adressY~0#1 := main_~y~0#1.base + main_~y~0#1.offset; {297#true} is VALID [2022-02-20 23:43:54,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {297#true} assume 0 == main_~y~0#1.offset; {297#true} is VALID [2022-02-20 23:43:54,977 INFO L290 TraceCheckUtils]: 3: Hoare triple {297#true} assume main_~y~0#1.base < #StackHeapBarrier; {297#true} is VALID [2022-02-20 23:43:54,977 INFO L290 TraceCheckUtils]: 4: Hoare triple {297#true} assume 0 == main_~y~0#1.base || 1 == #valid[main_~y~0#1.base];call ULTIMATE.dealloc(main_~y~0#1.base, main_~y~0#1.offset);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;main_~adressX~0#1 := main_~x~0#1.base + main_~x~0#1.offset; {299#(= |ULTIMATE.start_main_~x~0#1.offset| 0)} is VALID [2022-02-20 23:43:54,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {299#(= |ULTIMATE.start_main_~x~0#1.offset| 0)} assume !(main_~adressX~0#1 == main_~adressY~0#1); {299#(= |ULTIMATE.start_main_~x~0#1.offset| 0)} is VALID [2022-02-20 23:43:54,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {299#(= |ULTIMATE.start_main_~x~0#1.offset| 0)} assume !(0 == main_~x~0#1.offset); {298#false} is VALID [2022-02-20 23:43:54,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:54,979 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:54,980 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624108092] [2022-02-20 23:43:54,980 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624108092] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:54,980 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:54,980 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:43:54,980 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021476848] [2022-02-20 23:43:54,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:54,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2022-02-20 23:43:54,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:54,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:54,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:43:54,996 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:54,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:43:54,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:54,998 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:55,023 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-02-20 23:43:55,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:43:55,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2022-02-20 23:43:55,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:55,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-02-20 23:43:55,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-02-20 23:43:55,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 20 transitions. [2022-02-20 23:43:55,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:55,043 INFO L225 Difference]: With dead ends: 18 [2022-02-20 23:43:55,043 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 23:43:55,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:55,055 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:55,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 17 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:55,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 23:43:55,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 23:43:55,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:55,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3846153846153846) 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-20 23:43:55,061 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3846153846153846) 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-20 23:43:55,061 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3846153846153846) 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-20 23:43:55,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:55,066 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-02-20 23:43:55,066 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-02-20 23:43:55,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:55,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:55,066 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.3846153846153846) 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-20 23:43:55,067 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3846153846153846) 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-20 23:43:55,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:55,068 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-02-20 23:43:55,068 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-02-20 23:43:55,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:55,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:55,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:55,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:55,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3846153846153846) 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-20 23:43:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-02-20 23:43:55,069 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 7 [2022-02-20 23:43:55,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:55,069 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-02-20 23:43:55,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,070 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-02-20 23:43:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:43:55,070 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:55,070 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:55,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:43:55,070 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2022-02-20 23:43:55,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:55,071 INFO L85 PathProgramCache]: Analyzing trace with hash 87867921, now seen corresponding path program 1 times [2022-02-20 23:43:55,071 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:55,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883274829] [2022-02-20 23:43:55,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:55,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:55,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {374#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {374#true} is VALID [2022-02-20 23:43:55,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {374#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~adressY~0#1, main_~adressX~0#1;main_~x~0#1.base, main_~x~0#1.offset := 0, 0;main_~y~0#1.base, main_~y~0#1.offset := 0, 0;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;main_~adressY~0#1 := main_~y~0#1.base + main_~y~0#1.offset; {374#true} is VALID [2022-02-20 23:43:55,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {374#true} assume 0 == main_~y~0#1.offset; {374#true} is VALID [2022-02-20 23:43:55,112 INFO L290 TraceCheckUtils]: 3: Hoare triple {374#true} assume main_~y~0#1.base < #StackHeapBarrier; {374#true} is VALID [2022-02-20 23:43:55,112 INFO L290 TraceCheckUtils]: 4: Hoare triple {374#true} assume 0 == main_~y~0#1.base || 1 == #valid[main_~y~0#1.base];call ULTIMATE.dealloc(main_~y~0#1.base, main_~y~0#1.offset);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;main_~adressX~0#1 := main_~x~0#1.base + main_~x~0#1.offset; {376#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~x~0#1.base|))} is VALID [2022-02-20 23:43:55,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {376#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~x~0#1.base|))} assume !(main_~adressX~0#1 == main_~adressY~0#1); {376#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~x~0#1.base|))} is VALID [2022-02-20 23:43:55,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {376#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~x~0#1.base|))} assume 0 == main_~x~0#1.offset; {376#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~x~0#1.base|))} is VALID [2022-02-20 23:43:55,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {376#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~x~0#1.base|))} assume !(main_~x~0#1.base < #StackHeapBarrier); {375#false} is VALID [2022-02-20 23:43:55,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:55,114 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:55,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883274829] [2022-02-20 23:43:55,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883274829] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:55,114 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:55,114 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:43:55,114 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034887736] [2022-02-20 23:43:55,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:55,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-20 23:43:55,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:55,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,138 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-20 23:43:55,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:43:55,138 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:55,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:43:55,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:55,139 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:55,161 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-02-20 23:43:55,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:43:55,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-20 23:43:55,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-02-20 23:43:55,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-02-20 23:43:55,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 18 transitions. [2022-02-20 23:43:55,178 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-20 23:43:55,181 INFO L225 Difference]: With dead ends: 16 [2022-02-20 23:43:55,181 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 23:43:55,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:55,182 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:55,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 11 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:55,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 23:43:55,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 23:43:55,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:55,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,189 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,189 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:55,193 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-02-20 23:43:55,193 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-02-20 23:43:55,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:55,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:55,193 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 23:43:55,194 INFO L87 Difference]: Start difference. First operand has 16 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 23:43:55,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:55,194 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-02-20 23:43:55,194 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-02-20 23:43:55,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:55,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:55,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:55,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:55,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-02-20 23:43:55,198 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 8 [2022-02-20 23:43:55,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:55,198 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-02-20 23:43:55,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-02-20 23:43:55,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:43:55,200 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:55,200 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:55,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:43:55,200 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2022-02-20 23:43:55,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:55,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1571061689, now seen corresponding path program 1 times [2022-02-20 23:43:55,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:55,201 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124736527] [2022-02-20 23:43:55,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:55,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:55,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {443#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {443#true} is VALID [2022-02-20 23:43:55,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {443#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~adressY~0#1, main_~adressX~0#1;main_~x~0#1.base, main_~x~0#1.offset := 0, 0;main_~y~0#1.base, main_~y~0#1.offset := 0, 0;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;main_~adressY~0#1 := main_~y~0#1.base + main_~y~0#1.offset; {445#(and (not (= |ULTIMATE.start_main_~y~0#1.base| 0)) (= (select |#valid| |ULTIMATE.start_main_~y~0#1.base|) 1))} is VALID [2022-02-20 23:43:55,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {445#(and (not (= |ULTIMATE.start_main_~y~0#1.base| 0)) (= (select |#valid| |ULTIMATE.start_main_~y~0#1.base|) 1))} assume 0 == main_~y~0#1.offset; {445#(and (not (= |ULTIMATE.start_main_~y~0#1.base| 0)) (= (select |#valid| |ULTIMATE.start_main_~y~0#1.base|) 1))} is VALID [2022-02-20 23:43:55,277 INFO L290 TraceCheckUtils]: 3: Hoare triple {445#(and (not (= |ULTIMATE.start_main_~y~0#1.base| 0)) (= (select |#valid| |ULTIMATE.start_main_~y~0#1.base|) 1))} assume main_~y~0#1.base < #StackHeapBarrier; {445#(and (not (= |ULTIMATE.start_main_~y~0#1.base| 0)) (= (select |#valid| |ULTIMATE.start_main_~y~0#1.base|) 1))} is VALID [2022-02-20 23:43:55,278 INFO L290 TraceCheckUtils]: 4: Hoare triple {445#(and (not (= |ULTIMATE.start_main_~y~0#1.base| 0)) (= (select |#valid| |ULTIMATE.start_main_~y~0#1.base|) 1))} assume 0 == main_~y~0#1.base || 1 == #valid[main_~y~0#1.base];call ULTIMATE.dealloc(main_~y~0#1.base, main_~y~0#1.offset);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;main_~adressX~0#1 := main_~x~0#1.base + main_~x~0#1.offset; {446#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:43:55,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {446#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(main_~adressX~0#1 == main_~adressY~0#1); {446#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:43:55,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {446#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume 0 == main_~x~0#1.offset; {446#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:43:55,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {446#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume main_~x~0#1.base < #StackHeapBarrier; {446#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:43:55,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {446#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(0 == main_~x~0#1.base || 1 == #valid[main_~x~0#1.base]); {444#false} is VALID [2022-02-20 23:43:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:55,281 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:55,281 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124736527] [2022-02-20 23:43:55,281 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124736527] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:55,281 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:55,281 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:43:55,281 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592602982] [2022-02-20 23:43:55,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:55,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-02-20 23:43:55,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:55,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:55,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:43:55,292 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:55,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:43:55,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:43:55,293 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:55,329 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-02-20 23:43:55,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:43:55,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-02-20 23:43:55,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:55,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-02-20 23:43:55,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-02-20 23:43:55,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 20 transitions. [2022-02-20 23:43:55,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:55,346 INFO L225 Difference]: With dead ends: 18 [2022-02-20 23:43:55,346 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 23:43:55,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:43:55,347 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:55,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 15 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:55,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 23:43:55,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 23:43:55,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:55,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 16 states have (on average 1.125) 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-20 23:43:55,351 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 16 states have (on average 1.125) 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-20 23:43:55,352 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 16 states have (on average 1.125) 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-20 23:43:55,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:55,352 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-02-20 23:43:55,352 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-02-20 23:43:55,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:55,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:55,354 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 16 states have (on average 1.125) 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-20 23:43:55,355 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.125) 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-20 23:43:55,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:55,355 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-02-20 23:43:55,355 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-02-20 23:43:55,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:55,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:55,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:55,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:55,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.125) 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-20 23:43:55,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-02-20 23:43:55,359 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 9 [2022-02-20 23:43:55,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:55,360 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-02-20 23:43:55,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,360 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-02-20 23:43:55,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:43:55,360 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:55,361 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:55,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:43:55,361 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2022-02-20 23:43:55,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:55,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1458272044, now seen corresponding path program 1 times [2022-02-20 23:43:55,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:55,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859725541] [2022-02-20 23:43:55,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:55,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:55,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {521#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {521#true} is VALID [2022-02-20 23:43:55,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {521#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~adressY~0#1, main_~adressX~0#1;main_~x~0#1.base, main_~x~0#1.offset := 0, 0;main_~y~0#1.base, main_~y~0#1.offset := 0, 0;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;main_~adressY~0#1 := main_~y~0#1.base + main_~y~0#1.offset; {523#(= (store |#valid| |ULTIMATE.start_main_~y~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:43:55,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {523#(= (store |#valid| |ULTIMATE.start_main_~y~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume 0 == main_~y~0#1.offset; {523#(= (store |#valid| |ULTIMATE.start_main_~y~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:43:55,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {523#(= (store |#valid| |ULTIMATE.start_main_~y~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume main_~y~0#1.base < #StackHeapBarrier; {523#(= (store |#valid| |ULTIMATE.start_main_~y~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:43:55,411 INFO L290 TraceCheckUtils]: 4: Hoare triple {523#(= (store |#valid| |ULTIMATE.start_main_~y~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume 0 == main_~y~0#1.base || 1 == #valid[main_~y~0#1.base];call ULTIMATE.dealloc(main_~y~0#1.base, main_~y~0#1.offset);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;main_~adressX~0#1 := main_~x~0#1.base + main_~x~0#1.offset; {524#(= (store |#valid| |ULTIMATE.start_main_~x~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:43:55,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {524#(= (store |#valid| |ULTIMATE.start_main_~x~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume !(main_~adressX~0#1 == main_~adressY~0#1); {524#(= (store |#valid| |ULTIMATE.start_main_~x~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:43:55,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {524#(= (store |#valid| |ULTIMATE.start_main_~x~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume 0 == main_~x~0#1.offset; {524#(= (store |#valid| |ULTIMATE.start_main_~x~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:43:55,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {524#(= (store |#valid| |ULTIMATE.start_main_~x~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume main_~x~0#1.base < #StackHeapBarrier; {524#(= (store |#valid| |ULTIMATE.start_main_~x~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:43:55,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {524#(= (store |#valid| |ULTIMATE.start_main_~x~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume 0 == main_~x~0#1.base || 1 == #valid[main_~x~0#1.base];call ULTIMATE.dealloc(main_~x~0#1.base, main_~x~0#1.offset);main_#res#1 := 0; {525#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:43:55,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {525#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {522#false} is VALID [2022-02-20 23:43:55,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:55,414 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:55,414 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859725541] [2022-02-20 23:43:55,414 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859725541] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:55,415 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:55,415 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:43:55,415 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090392623] [2022-02-20 23:43:55,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:55,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2022-02-20 23:43:55,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:55,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:55,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:43:55,423 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:55,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:43:55,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:43:55,424 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:55,482 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-02-20 23:43:55,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:43:55,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2022-02-20 23:43:55,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:55,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-02-20 23:43:55,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-02-20 23:43:55,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2022-02-20 23:43:55,511 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-20 23:43:55,511 INFO L225 Difference]: With dead ends: 17 [2022-02-20 23:43:55,511 INFO L226 Difference]: Without dead ends: 13 [2022-02-20 23:43:55,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:43:55,513 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:55,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:55,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-02-20 23:43:55,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-20 23:43:55,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:55,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,515 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,515 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:55,515 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2022-02-20 23:43:55,515 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2022-02-20 23:43:55,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:55,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:55,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 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-20 23:43:55,516 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 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-20 23:43:55,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:55,516 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2022-02-20 23:43:55,517 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2022-02-20 23:43:55,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:55,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:55,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:55,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 12 transitions. [2022-02-20 23:43:55,518 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 12 transitions. Word has length 10 [2022-02-20 23:43:55,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:55,518 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 12 transitions. [2022-02-20 23:43:55,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:55,518 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2022-02-20 23:43:55,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:43:55,518 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:55,519 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:55,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:43:55,519 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2022-02-20 23:43:55,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:55,519 INFO L85 PathProgramCache]: Analyzing trace with hash -16437808, now seen corresponding path program 1 times [2022-02-20 23:43:55,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:55,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834106929] [2022-02-20 23:43:55,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:55,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:43:55,536 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:43:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:43:55,563 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 23:43:55,563 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:43:55,564 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (9 of 10 remaining) [2022-02-20 23:43:55,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE (8 of 10 remaining) [2022-02-20 23:43:55,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (7 of 10 remaining) [2022-02-20 23:43:55,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (6 of 10 remaining) [2022-02-20 23:43:55,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (5 of 10 remaining) [2022-02-20 23:43:55,565 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (4 of 10 remaining) [2022-02-20 23:43:55,566 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (3 of 10 remaining) [2022-02-20 23:43:55,566 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (2 of 10 remaining) [2022-02-20 23:43:55,566 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (1 of 10 remaining) [2022-02-20 23:43:55,566 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-02-20 23:43:55,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:43:55,568 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:55,571 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:43:55,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:43:55 BoogieIcfgContainer [2022-02-20 23:43:55,584 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:43:55,584 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:43:55,584 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:43:55,585 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:43:55,585 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:43:54" (3/4) ... [2022-02-20 23:43:55,586 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 23:43:55,608 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:43:55,608 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:43:55,609 INFO L158 Benchmark]: Toolchain (without parser) took 2002.05ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 62.9MB in the beginning and 83.6MB in the end (delta: -20.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:43:55,609 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 51.8MB in the beginning and 51.7MB in the end (delta: 42.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:43:55,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.87ms. Allocated memory is still 96.5MB. Free memory was 62.7MB in the beginning and 65.7MB in the end (delta: -3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:43:55,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.66ms. Allocated memory is still 96.5MB. Free memory was 65.7MB in the beginning and 63.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:43:55,610 INFO L158 Benchmark]: Boogie Preprocessor took 23.22ms. Allocated memory is still 96.5MB. Free memory was 63.7MB in the beginning and 62.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:43:55,610 INFO L158 Benchmark]: RCFGBuilder took 240.90ms. Allocated memory is still 96.5MB. Free memory was 62.6MB in the beginning and 51.5MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 23:43:55,610 INFO L158 Benchmark]: TraceAbstraction took 1375.27ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 51.1MB in the beginning and 85.7MB in the end (delta: -34.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:43:55,610 INFO L158 Benchmark]: Witness Printer took 23.75ms. Allocated memory is still 117.4MB. Free memory was 85.7MB in the beginning and 83.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:43:55,611 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.15ms. Allocated memory is still 96.5MB. Free memory was 51.8MB in the beginning and 51.7MB in the end (delta: 42.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.87ms. Allocated memory is still 96.5MB. Free memory was 62.7MB in the beginning and 65.7MB in the end (delta: -3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.66ms. Allocated memory is still 96.5MB. Free memory was 65.7MB in the beginning and 63.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.22ms. Allocated memory is still 96.5MB. Free memory was 63.7MB in the beginning and 62.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 240.90ms. Allocated memory is still 96.5MB. Free memory was 62.6MB in the beginning and 51.5MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1375.27ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 51.1MB in the beginning and 85.7MB in the end (delta: -34.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 23.75ms. Allocated memory is still 117.4MB. Free memory was 85.7MB in the beginning and 83.6MB 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 - CounterExampleResult [Line: 554]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L543] struct T* x = ((void *)0); [L544] struct T* y = ((void *)0); [L545] y = malloc(sizeof(*y)) [L546] intptr_t adressY = (intptr_t) y; VAL [adressY=2, x={0:0}, y={2:0}] [L547] free(y) VAL [adressY=2, x={0:0}, y={2:0}] [L547] free(y) VAL [adressY=2, x={0:0}, y={2:0}] [L547] free(y) [L548] x = malloc(sizeof(*x)) [L549] intptr_t adressX = (intptr_t) x; VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] [L550] COND TRUE adressX == adressY VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] [L552] free(x) VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] [L552] free(x) VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] [L552] free(x) [L554] free(x) VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] [L554] free(x) VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] [L554] free(x) VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 73 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73 mSDsluCounter, 128 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 78 IncrementalHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 98 mSDtfsCounter, 78 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 152 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-20 23:43:55,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free)