./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/derefAfterFree2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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-ext3/derefAfterFree2.c -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 44834c55142a76240cb3980fc2bb6f5aeaa27c83 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:19:05,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:19:05,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:19:05,644 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:19:05,645 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:19:05,647 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:19:05,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:19:05,658 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:19:05,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:19:05,661 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:19:05,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:19:05,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:19:05,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:19:05,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:19:05,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:19:05,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:19:05,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:19:05,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:19:05,671 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:19:05,672 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:19:05,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:19:05,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:19:05,676 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:19:05,677 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:19:05,680 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:19:05,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:19:05,681 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:19:05,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:19:05,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:19:05,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:19:05,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:19:05,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:19:05,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:19:05,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:19:05,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:19:05,688 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:19:05,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:19:05,689 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:19:05,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:19:05,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:19:05,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:19:05,692 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 20:19:05,718 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:19:05,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:19:05,723 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:19:05,723 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:19:05,723 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:19:05,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:19:05,725 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:19:05,725 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:19:05,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:19:05,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:19:05,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:19:05,726 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:19:05,726 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:19:05,726 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 20:19:05,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:19:05,727 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:19:05,727 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:19:05,728 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:19:05,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:19:05,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:19:05,729 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:19:05,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:19:05,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:19:05,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:19:05,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:19:05,730 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:19:05,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:19:05,731 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:19:05,731 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 44834c55142a76240cb3980fc2bb6f5aeaa27c83 [2019-11-28 20:19:06,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:19:06,054 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:19:06,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:19:06,059 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:19:06,059 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:19:06,062 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/derefAfterFree2.c [2019-11-28 20:19:06,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7673d37b7/7c102f625cd3491f8d554b07b25f309b/FLAGa7437abee [2019-11-28 20:19:06,596 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:19:06,597 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/derefAfterFree2.c [2019-11-28 20:19:06,601 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7673d37b7/7c102f625cd3491f8d554b07b25f309b/FLAGa7437abee [2019-11-28 20:19:06,995 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7673d37b7/7c102f625cd3491f8d554b07b25f309b [2019-11-28 20:19:06,998 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:19:07,000 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:19:07,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:19:07,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:19:07,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:19:07,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:19:06" (1/1) ... [2019-11-28 20:19:07,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51d64605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:07, skipping insertion in model container [2019-11-28 20:19:07,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:19:06" (1/1) ... [2019-11-28 20:19:07,019 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:19:07,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:19:07,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:19:07,264 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:19:07,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:19:07,304 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:19:07,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:07 WrapperNode [2019-11-28 20:19:07,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:19:07,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:19:07,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:19:07,307 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:19:07,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:07" (1/1) ... [2019-11-28 20:19:07,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:07" (1/1) ... [2019-11-28 20:19:07,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:07" (1/1) ... [2019-11-28 20:19:07,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:07" (1/1) ... [2019-11-28 20:19:07,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:07" (1/1) ... [2019-11-28 20:19:07,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:07" (1/1) ... [2019-11-28 20:19:07,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:07" (1/1) ... [2019-11-28 20:19:07,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:19:07,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:19:07,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:19:07,453 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:19:07,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:19:07,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:19:07,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:19:07,521 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:19:07,521 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 20:19:07,521 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 20:19:07,521 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:19:07,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:19:07,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:19:07,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:19:07,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:19:07,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:19:07,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:19:07,762 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:19:07,762 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-28 20:19:07,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:19:07 BoogieIcfgContainer [2019-11-28 20:19:07,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:19:07,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:19:07,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:19:07,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:19:07,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:19:06" (1/3) ... [2019-11-28 20:19:07,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ffa5b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:19:07, skipping insertion in model container [2019-11-28 20:19:07,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:07" (2/3) ... [2019-11-28 20:19:07,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ffa5b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:19:07, skipping insertion in model container [2019-11-28 20:19:07,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:19:07" (3/3) ... [2019-11-28 20:19:07,779 INFO L109 eAbstractionObserver]: Analyzing ICFG derefAfterFree2.c [2019-11-28 20:19:07,797 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:19:07,825 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-28 20:19:07,855 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 20:19:07,890 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:19:07,890 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:19:07,890 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:19:07,891 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:19:07,891 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:19:07,891 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:19:07,891 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:19:07,891 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:19:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-11-28 20:19:07,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 20:19:07,913 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:07,914 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:07,915 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:07,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:07,920 INFO L82 PathProgramCache]: Analyzing trace with hash 868112163, now seen corresponding path program 1 times [2019-11-28 20:19:07,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:07,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148102203] [2019-11-28 20:19:07,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:08,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:08,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148102203] [2019-11-28 20:19:08,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:08,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:19:08,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528377530] [2019-11-28 20:19:08,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:19:08,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:08,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:19:08,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:08,185 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2019-11-28 20:19:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:08,293 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-11-28 20:19:08,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:19:08,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 20:19:08,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:08,304 INFO L225 Difference]: With dead ends: 29 [2019-11-28 20:19:08,305 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 20:19:08,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:08,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 20:19:08,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-11-28 20:19:08,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 20:19:08,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-11-28 20:19:08,342 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 8 [2019-11-28 20:19:08,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:08,343 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-28 20:19:08,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:19:08,343 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-11-28 20:19:08,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 20:19:08,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:08,344 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:08,345 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:08,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:08,346 INFO L82 PathProgramCache]: Analyzing trace with hash 868112162, now seen corresponding path program 1 times [2019-11-28 20:19:08,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:08,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143775865] [2019-11-28 20:19:08,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:08,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:08,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143775865] [2019-11-28 20:19:08,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:08,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:19:08,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872856176] [2019-11-28 20:19:08,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:19:08,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:08,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:19:08,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:08,423 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 4 states. [2019-11-28 20:19:08,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:08,518 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-11-28 20:19:08,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:19:08,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 20:19:08,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:08,520 INFO L225 Difference]: With dead ends: 30 [2019-11-28 20:19:08,520 INFO L226 Difference]: Without dead ends: 30 [2019-11-28 20:19:08,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:08,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-28 20:19:08,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2019-11-28 20:19:08,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 20:19:08,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-11-28 20:19:08,531 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 8 [2019-11-28 20:19:08,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:08,531 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-11-28 20:19:08,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:19:08,533 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-11-28 20:19:08,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:19:08,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:08,534 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:08,534 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:08,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:08,535 INFO L82 PathProgramCache]: Analyzing trace with hash -258436314, now seen corresponding path program 1 times [2019-11-28 20:19:08,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:08,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241094039] [2019-11-28 20:19:08,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:08,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:08,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241094039] [2019-11-28 20:19:08,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:08,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:19:08,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723906709] [2019-11-28 20:19:08,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:19:08,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:08,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:19:08,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:19:08,737 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 7 states. [2019-11-28 20:19:08,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:08,813 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-11-28 20:19:08,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:19:08,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-28 20:19:08,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:08,815 INFO L225 Difference]: With dead ends: 25 [2019-11-28 20:19:08,815 INFO L226 Difference]: Without dead ends: 25 [2019-11-28 20:19:08,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:19:08,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-28 20:19:08,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-28 20:19:08,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 20:19:08,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-11-28 20:19:08,821 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 12 [2019-11-28 20:19:08,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:08,822 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-28 20:19:08,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:19:08,822 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-11-28 20:19:08,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 20:19:08,823 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:08,824 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:08,824 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:08,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:08,825 INFO L82 PathProgramCache]: Analyzing trace with hash 578407498, now seen corresponding path program 1 times [2019-11-28 20:19:08,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:08,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026754794] [2019-11-28 20:19:08,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:08,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:08,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026754794] [2019-11-28 20:19:08,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250308388] [2019-11-28 20:19:08,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:08,923 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:19:08,929 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:08,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:08,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-28 20:19:08,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358916531] [2019-11-28 20:19:08,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:19:08,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:08,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:19:08,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:19:08,969 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 6 states. [2019-11-28 20:19:09,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:09,031 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-11-28 20:19:09,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:19:09,031 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-28 20:19:09,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:09,032 INFO L225 Difference]: With dead ends: 29 [2019-11-28 20:19:09,032 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 20:19:09,033 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:19:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 20:19:09,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-11-28 20:19:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 20:19:09,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-28 20:19:09,037 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 13 [2019-11-28 20:19:09,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:09,038 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-28 20:19:09,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:19:09,038 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-28 20:19:09,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 20:19:09,039 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:09,039 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:09,240 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:09,240 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:09,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:09,242 INFO L82 PathProgramCache]: Analyzing trace with hash -977036761, now seen corresponding path program 2 times [2019-11-28 20:19:09,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:09,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899795876] [2019-11-28 20:19:09,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:09,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899795876] [2019-11-28 20:19:09,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930584586] [2019-11-28 20:19:09,346 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:09,390 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:19:09,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:09,391 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:19:09,394 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:09,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:09,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:09,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-11-28 20:19:09,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125927059] [2019-11-28 20:19:09,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:19:09,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:09,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:19:09,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:19:09,413 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 7 states. [2019-11-28 20:19:09,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:09,466 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-11-28 20:19:09,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:19:09,466 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-28 20:19:09,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:09,467 INFO L225 Difference]: With dead ends: 33 [2019-11-28 20:19:09,467 INFO L226 Difference]: Without dead ends: 33 [2019-11-28 20:19:09,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:19:09,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-28 20:19:09,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-11-28 20:19:09,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 20:19:09,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-11-28 20:19:09,473 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 17 [2019-11-28 20:19:09,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:09,473 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-11-28 20:19:09,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:19:09,474 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-11-28 20:19:09,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:19:09,475 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:09,475 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:09,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:09,680 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:09,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:09,681 INFO L82 PathProgramCache]: Analyzing trace with hash -242667132, now seen corresponding path program 3 times [2019-11-28 20:19:09,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:09,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657290988] [2019-11-28 20:19:09,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:09,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657290988] [2019-11-28 20:19:09,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395458620] [2019-11-28 20:19:09,816 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:09,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 20:19:09,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:09,875 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:19:09,879 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:09,897 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:09,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:09,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-11-28 20:19:09,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302957573] [2019-11-28 20:19:09,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:19:09,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:09,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:19:09,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:19:09,900 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2019-11-28 20:19:09,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:09,977 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-11-28 20:19:09,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:19:09,978 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-28 20:19:09,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:09,979 INFO L225 Difference]: With dead ends: 37 [2019-11-28 20:19:09,979 INFO L226 Difference]: Without dead ends: 37 [2019-11-28 20:19:09,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:19:09,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-28 20:19:09,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-11-28 20:19:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 20:19:09,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-11-28 20:19:09,985 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 21 [2019-11-28 20:19:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:09,985 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-11-28 20:19:09,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:19:09,985 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-11-28 20:19:09,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 20:19:09,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:09,986 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:10,187 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:10,188 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:10,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:10,188 INFO L82 PathProgramCache]: Analyzing trace with hash 130667105, now seen corresponding path program 4 times [2019-11-28 20:19:10,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:10,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538698260] [2019-11-28 20:19:10,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:10,286 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:10,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538698260] [2019-11-28 20:19:10,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271019952] [2019-11-28 20:19:10,287 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:10,323 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 20:19:10,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:10,324 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:19:10,326 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:10,344 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:10,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:10,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-11-28 20:19:10,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292000350] [2019-11-28 20:19:10,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:19:10,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:10,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:19:10,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:19:10,347 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2019-11-28 20:19:10,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:10,431 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-11-28 20:19:10,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:19:10,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-28 20:19:10,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:10,433 INFO L225 Difference]: With dead ends: 41 [2019-11-28 20:19:10,433 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 20:19:10,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:19:10,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 20:19:10,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-11-28 20:19:10,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 20:19:10,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2019-11-28 20:19:10,440 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 25 [2019-11-28 20:19:10,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:10,440 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2019-11-28 20:19:10,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:19:10,441 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2019-11-28 20:19:10,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 20:19:10,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:10,442 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:10,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:10,650 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:10,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:10,651 INFO L82 PathProgramCache]: Analyzing trace with hash -656098114, now seen corresponding path program 5 times [2019-11-28 20:19:10,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:10,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601298167] [2019-11-28 20:19:10,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:10,809 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:10,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601298167] [2019-11-28 20:19:10,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452208256] [2019-11-28 20:19:10,810 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:10,856 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-28 20:19:10,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:10,857 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:19:10,860 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:10,965 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:10,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:10,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-11-28 20:19:10,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423800213] [2019-11-28 20:19:10,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 20:19:10,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:10,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 20:19:10,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:19:10,968 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 16 states. [2019-11-28 20:19:11,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:11,399 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2019-11-28 20:19:11,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 20:19:11,400 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-11-28 20:19:11,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:11,402 INFO L225 Difference]: With dead ends: 55 [2019-11-28 20:19:11,403 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 20:19:11,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=218, Invalid=432, Unknown=0, NotChecked=0, Total=650 [2019-11-28 20:19:11,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 20:19:11,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-28 20:19:11,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-28 20:19:11,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2019-11-28 20:19:11,419 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 29 [2019-11-28 20:19:11,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:11,419 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2019-11-28 20:19:11,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 20:19:11,420 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2019-11-28 20:19:11,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 20:19:11,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:11,421 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:11,633 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:11,634 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:11,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:11,635 INFO L82 PathProgramCache]: Analyzing trace with hash 851171268, now seen corresponding path program 1 times [2019-11-28 20:19:11,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:11,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219278217] [2019-11-28 20:19:11,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-28 20:19:11,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219278217] [2019-11-28 20:19:11,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:11,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:19:11,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451427643] [2019-11-28 20:19:11,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:19:11,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:11,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:19:11,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:11,719 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 4 states. [2019-11-28 20:19:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:11,752 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2019-11-28 20:19:11,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:19:11,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-28 20:19:11,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:11,755 INFO L225 Difference]: With dead ends: 54 [2019-11-28 20:19:11,755 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 20:19:11,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:11,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 20:19:11,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-28 20:19:11,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 20:19:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2019-11-28 20:19:11,760 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 31 [2019-11-28 20:19:11,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:11,760 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2019-11-28 20:19:11,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:19:11,761 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2019-11-28 20:19:11,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 20:19:11,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:11,762 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:11,762 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:11,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:11,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1037842699, now seen corresponding path program 1 times [2019-11-28 20:19:11,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:11,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289149161] [2019-11-28 20:19:11,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:19:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:19:11,850 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:19:11,851 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 20:19:11,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:19:11 BoogieIcfgContainer [2019-11-28 20:19:11,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:19:11,892 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:19:11,892 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:19:11,892 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:19:11,893 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:19:07" (3/4) ... [2019-11-28 20:19:11,898 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 20:19:11,981 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:19:11,981 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:19:11,984 INFO L168 Benchmark]: Toolchain (without parser) took 4982.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 214.4 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -236.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:19:11,985 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:19:11,988 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.14 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:11,988 INFO L168 Benchmark]: Boogie Preprocessor took 146.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -195.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:11,989 INFO L168 Benchmark]: RCFGBuilder took 315.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:11,992 INFO L168 Benchmark]: TraceAbstraction took 4121.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -77.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:19:11,993 INFO L168 Benchmark]: Witness Printer took 89.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:11,999 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 304.14 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 146.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -195.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 315.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4121.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -77.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 89.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 9]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L6] int* p = malloc(10 * sizeof(int)); [L8] int i = 0; VAL [i=0, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L8] COND TRUE i < 10 VAL [i=0, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L9] p[i] = 1 VAL [i=0, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L10] COND FALSE !(i == 5) VAL [i=0, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L8] i++ VAL [i=1, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L8] COND TRUE i < 10 VAL [i=1, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L9] p[i] = 1 VAL [i=1, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L10] COND FALSE !(i == 5) VAL [i=1, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L8] i++ VAL [i=2, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L8] COND TRUE i < 10 VAL [i=2, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L9] p[i] = 1 VAL [i=2, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L10] COND FALSE !(i == 5) VAL [i=2, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L8] i++ VAL [i=3, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L8] COND TRUE i < 10 VAL [i=3, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L9] p[i] = 1 VAL [i=3, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L10] COND FALSE !(i == 5) VAL [i=3, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L8] i++ VAL [i=4, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L8] COND TRUE i < 10 VAL [i=4, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L9] p[i] = 1 VAL [i=4, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L10] COND FALSE !(i == 5) VAL [i=4, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L8] i++ VAL [i=5, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L8] COND TRUE i < 10 VAL [i=5, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L9] p[i] = 1 VAL [i=5, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L10] COND TRUE i == 5 VAL [i=5, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L11] free(p) VAL [i=5, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L11] free(p) VAL [i=5, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L11] free(p) [L8] i++ VAL [i=6, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L8] COND TRUE i < 10 VAL [i=6, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L9] p[i] = 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 locations, 6 error locations. Result: UNSAFE, OverallTime: 3.9s, OverallIterations: 10, TraceHistogramMax: 7, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 112 SDtfs, 176 SDslu, 252 SDs, 0 SdLazy, 421 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 11 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 18153 SizeOfPredicates, 5 NumberOfNonLiveVariables, 365 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 70/247 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...