./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/verifythis/elimination_max_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a0523b86-e11e-4dbd-af6f-e7df6ec25345/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a0523b86-e11e-4dbd-af6f-e7df6ec25345/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a0523b86-e11e-4dbd-af6f-e7df6ec25345/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a0523b86-e11e-4dbd-af6f-e7df6ec25345/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/elimination_max_rec.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a0523b86-e11e-4dbd-af6f-e7df6ec25345/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a0523b86-e11e-4dbd-af6f-e7df6ec25345/bin/uautomizer --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 17d20a29a9e9cc6560e9aa0daac36f5de29f992c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:09:30,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:09:30,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:09:30,868 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:09:30,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:09:30,869 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:09:30,870 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:09:30,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:09:30,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:09:30,875 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:09:30,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:09:30,876 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:09:30,877 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:09:30,878 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:09:30,878 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:09:30,879 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:09:30,880 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:09:30,881 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:09:30,883 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:09:30,884 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:09:30,886 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:09:30,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:09:30,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:09:30,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:09:30,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:09:30,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:09:30,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:09:30,892 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:09:30,893 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:09:30,894 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:09:30,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:09:30,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:09:30,895 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:09:30,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:09:30,896 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:09:30,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:09:30,897 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:09:30,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:09:30,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:09:30,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:09:30,899 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:09:30,900 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a0523b86-e11e-4dbd-af6f-e7df6ec25345/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 10:09:30,912 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:09:30,912 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:09:30,913 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:09:30,913 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:09:30,913 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:09:30,913 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:09:30,914 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:09:30,914 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 10:09:30,914 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:09:30,914 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:09:30,914 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:09:30,914 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 10:09:30,914 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 10:09:30,915 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 10:09:30,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:09:30,915 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:09:30,915 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:09:30,915 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:09:30,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:09:30,915 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:09:30,916 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:09:30,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:09:30,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:09:30,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:09:30,916 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:09:30,916 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:09:30,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:09:30,916 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:09:30,916 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_a0523b86-e11e-4dbd-af6f-e7df6ec25345/bin/uautomizer 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 -> 17d20a29a9e9cc6560e9aa0daac36f5de29f992c [2019-12-07 10:09:31,029 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:09:31,037 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:09:31,040 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:09:31,041 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:09:31,042 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:09:31,042 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a0523b86-e11e-4dbd-af6f-e7df6ec25345/bin/uautomizer/../../sv-benchmarks/c/verifythis/elimination_max_rec.c [2019-12-07 10:09:31,085 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a0523b86-e11e-4dbd-af6f-e7df6ec25345/bin/uautomizer/data/6e9b456b0/452225d04dc04d08956e4145fba6f9bb/FLAGcf034de47 [2019-12-07 10:09:31,520 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:09:31,521 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a0523b86-e11e-4dbd-af6f-e7df6ec25345/sv-benchmarks/c/verifythis/elimination_max_rec.c [2019-12-07 10:09:31,525 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a0523b86-e11e-4dbd-af6f-e7df6ec25345/bin/uautomizer/data/6e9b456b0/452225d04dc04d08956e4145fba6f9bb/FLAGcf034de47 [2019-12-07 10:09:31,536 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a0523b86-e11e-4dbd-af6f-e7df6ec25345/bin/uautomizer/data/6e9b456b0/452225d04dc04d08956e4145fba6f9bb [2019-12-07 10:09:31,539 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:09:31,540 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 10:09:31,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:09:31,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:09:31,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:09:31,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:09:31" (1/1) ... [2019-12-07 10:09:31,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a62463e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:09:31, skipping insertion in model container [2019-12-07 10:09:31,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:09:31" (1/1) ... [2019-12-07 10:09:31,550 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:09:31,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:09:31,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:09:31,706 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:09:31,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:09:31,729 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:09:31,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:09:31 WrapperNode [2019-12-07 10:09:31,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:09:31,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:09:31,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:09:31,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:09:31,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:09:31" (1/1) ... [2019-12-07 10:09:31,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:09:31" (1/1) ... [2019-12-07 10:09:31,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:09:31" (1/1) ... [2019-12-07 10:09:31,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:09:31" (1/1) ... [2019-12-07 10:09:31,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:09:31" (1/1) ... [2019-12-07 10:09:31,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:09:31" (1/1) ... [2019-12-07 10:09:31,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:09:31" (1/1) ... [2019-12-07 10:09:31,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:09:31,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:09:31,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:09:31,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:09:31,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:09:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0523b86-e11e-4dbd-af6f-e7df6ec25345/bin/uautomizer/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-12-07 10:09:31,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 10:09:31,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:09:31,793 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-12-07 10:09:31,793 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-12-07 10:09:31,793 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 10:09:31,793 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-12-07 10:09:31,793 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 10:09:31,793 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 10:09:31,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 10:09:31,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-12-07 10:09:31,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-12-07 10:09:31,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 10:09:31,794 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-12-07 10:09:31,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 10:09:31,794 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 10:09:31,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 10:09:31,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-12-07 10:09:31,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:09:31,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 10:09:31,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:09:31,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:09:31,982 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:09:31,982 INFO L287 CfgBuilder]: Removed 0 assume(true) statements. [2019-12-07 10:09:31,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:09:31 BoogieIcfgContainer [2019-12-07 10:09:31,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:09:31,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:09:31,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:09:31,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:09:31,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:09:31" (1/3) ... [2019-12-07 10:09:31,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241c27e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:09:31, skipping insertion in model container [2019-12-07 10:09:31,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:09:31" (2/3) ... [2019-12-07 10:09:31,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241c27e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:09:31, skipping insertion in model container [2019-12-07 10:09:31,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:09:31" (3/3) ... [2019-12-07 10:09:31,988 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2019-12-07 10:09:31,994 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:09:31,999 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-12-07 10:09:32,006 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-12-07 10:09:32,018 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:09:32,018 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 10:09:32,018 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:09:32,018 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:09:32,018 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:09:32,018 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:09:32,018 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:09:32,018 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:09:32,029 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-12-07 10:09:32,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:09:32,035 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:32,036 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:32,036 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-12-07 10:09:32,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:32,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1758189684, now seen corresponding path program 1 times [2019-12-07 10:09:32,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:32,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403547107] [2019-12-07 10:09:32,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:32,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:32,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403547107] [2019-12-07 10:09:32,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:32,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:09:32,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230358944] [2019-12-07 10:09:32,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:09:32,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:32,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:09:32,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:09:32,216 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 6 states. [2019-12-07 10:09:32,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:32,372 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-12-07 10:09:32,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:09:32,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-12-07 10:09:32,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:32,380 INFO L225 Difference]: With dead ends: 52 [2019-12-07 10:09:32,380 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 10:09:32,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:09:32,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 10:09:32,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-12-07 10:09:32,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 10:09:32,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-12-07 10:09:32,408 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 18 [2019-12-07 10:09:32,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:32,409 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-12-07 10:09:32,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:09:32,410 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-12-07 10:09:32,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:09:32,411 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:32,411 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:32,411 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-12-07 10:09:32,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:32,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1330694682, now seen corresponding path program 1 times [2019-12-07 10:09:32,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:32,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465311504] [2019-12-07 10:09:32,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:32,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:32,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465311504] [2019-12-07 10:09:32,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:32,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:09:32,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965974017] [2019-12-07 10:09:32,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:09:32,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:32,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:09:32,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:09:32,479 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2019-12-07 10:09:32,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:32,593 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-12-07 10:09:32,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:09:32,594 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-07 10:09:32,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:32,595 INFO L225 Difference]: With dead ends: 48 [2019-12-07 10:09:32,595 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 10:09:32,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:09:32,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 10:09:32,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-12-07 10:09:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 10:09:32,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-12-07 10:09:32,600 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 19 [2019-12-07 10:09:32,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:32,601 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-12-07 10:09:32,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:09:32,601 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-12-07 10:09:32,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 10:09:32,601 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:32,601 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:32,602 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-12-07 10:09:32,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:32,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1698137778, now seen corresponding path program 1 times [2019-12-07 10:09:32,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:32,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779789327] [2019-12-07 10:09:32,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:32,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:32,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779789327] [2019-12-07 10:09:32,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:32,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:09:32,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425080333] [2019-12-07 10:09:32,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:09:32,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:32,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:09:32,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:09:32,656 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 6 states. [2019-12-07 10:09:32,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:32,769 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-12-07 10:09:32,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:09:32,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-12-07 10:09:32,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:32,770 INFO L225 Difference]: With dead ends: 47 [2019-12-07 10:09:32,770 INFO L226 Difference]: Without dead ends: 47 [2019-12-07 10:09:32,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:09:32,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-07 10:09:32,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-12-07 10:09:32,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 10:09:32,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-12-07 10:09:32,775 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 20 [2019-12-07 10:09:32,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:32,775 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-12-07 10:09:32,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:09:32,776 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-12-07 10:09:32,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 10:09:32,776 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:32,776 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:32,776 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-12-07 10:09:32,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:32,777 INFO L82 PathProgramCache]: Analyzing trace with hash 886846262, now seen corresponding path program 1 times [2019-12-07 10:09:32,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:32,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231285348] [2019-12-07 10:09:32,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:32,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:32,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231285348] [2019-12-07 10:09:32,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:32,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:09:32,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3755706] [2019-12-07 10:09:32,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:09:32,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:32,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:09:32,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:09:32,832 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 8 states. [2019-12-07 10:09:32,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:32,985 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-12-07 10:09:32,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:09:32,986 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-12-07 10:09:32,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:32,986 INFO L225 Difference]: With dead ends: 43 [2019-12-07 10:09:32,986 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 10:09:32,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:09:32,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 10:09:32,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-12-07 10:09:32,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 10:09:32,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-12-07 10:09:32,991 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 21 [2019-12-07 10:09:32,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:32,991 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-12-07 10:09:32,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:09:32,991 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-12-07 10:09:32,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 10:09:32,992 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:32,992 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:32,992 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-12-07 10:09:32,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:32,992 INFO L82 PathProgramCache]: Analyzing trace with hash 886846263, now seen corresponding path program 1 times [2019-12-07 10:09:32,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:32,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383590400] [2019-12-07 10:09:32,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:33,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:33,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383590400] [2019-12-07 10:09:33,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:33,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:09:33,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229545249] [2019-12-07 10:09:33,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:09:33,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:33,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:09:33,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:09:33,083 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 9 states. [2019-12-07 10:09:33,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:33,428 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2019-12-07 10:09:33,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:09:33,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-07 10:09:33,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:33,431 INFO L225 Difference]: With dead ends: 77 [2019-12-07 10:09:33,431 INFO L226 Difference]: Without dead ends: 77 [2019-12-07 10:09:33,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:09:33,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-07 10:09:33,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 61. [2019-12-07 10:09:33,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 10:09:33,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-12-07 10:09:33,438 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 21 [2019-12-07 10:09:33,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:33,438 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-12-07 10:09:33,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:09:33,438 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-12-07 10:09:33,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 10:09:33,439 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:33,439 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:33,439 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-12-07 10:09:33,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:33,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1102663523, now seen corresponding path program 1 times [2019-12-07 10:09:33,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:33,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386054711] [2019-12-07 10:09:33,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:33,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:33,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386054711] [2019-12-07 10:09:33,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:33,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:09:33,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878177249] [2019-12-07 10:09:33,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:09:33,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:33,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:09:33,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:09:33,498 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 7 states. [2019-12-07 10:09:33,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:33,598 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-12-07 10:09:33,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:09:33,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-12-07 10:09:33,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:33,599 INFO L225 Difference]: With dead ends: 60 [2019-12-07 10:09:33,599 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 10:09:33,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:09:33,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 10:09:33,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-12-07 10:09:33,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 10:09:33,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2019-12-07 10:09:33,604 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 21 [2019-12-07 10:09:33,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:33,604 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2019-12-07 10:09:33,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:09:33,604 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2019-12-07 10:09:33,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:09:33,605 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:33,605 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:33,605 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-12-07 10:09:33,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:33,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1722430340, now seen corresponding path program 1 times [2019-12-07 10:09:33,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:33,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588351244] [2019-12-07 10:09:33,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:33,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588351244] [2019-12-07 10:09:33,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:33,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:09:33,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773718801] [2019-12-07 10:09:33,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:09:33,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:33,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:09:33,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:09:33,700 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 10 states. [2019-12-07 10:09:34,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:34,018 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2019-12-07 10:09:34,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:09:34,019 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-12-07 10:09:34,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:34,019 INFO L225 Difference]: With dead ends: 68 [2019-12-07 10:09:34,020 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 10:09:34,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-12-07 10:09:34,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 10:09:34,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2019-12-07 10:09:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 10:09:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2019-12-07 10:09:34,024 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 22 [2019-12-07 10:09:34,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:34,024 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2019-12-07 10:09:34,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:09:34,025 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2019-12-07 10:09:34,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 10:09:34,025 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:34,026 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:34,026 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-12-07 10:09:34,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:34,026 INFO L82 PathProgramCache]: Analyzing trace with hash 547961029, now seen corresponding path program 1 times [2019-12-07 10:09:34,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:34,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959414201] [2019-12-07 10:09:34,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:34,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:34,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959414201] [2019-12-07 10:09:34,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89445087] [2019-12-07 10:09:34,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0523b86-e11e-4dbd-af6f-e7df6ec25345/bin/uautomizer/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-12-07 10:09:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:34,166 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 10:09:34,172 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:09:34,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:34,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:09:34,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2019-12-07 10:09:34,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397162553] [2019-12-07 10:09:34,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 10:09:34,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:34,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 10:09:34,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-12-07 10:09:34,289 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 18 states. [2019-12-07 10:09:34,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:34,960 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2019-12-07 10:09:34,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 10:09:34,961 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-12-07 10:09:34,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:34,962 INFO L225 Difference]: With dead ends: 80 [2019-12-07 10:09:34,962 INFO L226 Difference]: Without dead ends: 80 [2019-12-07 10:09:34,962 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=266, Invalid=994, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 10:09:34,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-12-07 10:09:34,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2019-12-07 10:09:34,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 10:09:34,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-12-07 10:09:34,968 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 30 [2019-12-07 10:09:34,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:34,968 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-12-07 10:09:34,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 10:09:34,968 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2019-12-07 10:09:34,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 10:09:34,969 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:34,969 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:35,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:09:35,170 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-12-07 10:09:35,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:35,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1690429274, now seen corresponding path program 1 times [2019-12-07 10:09:35,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:35,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506302961] [2019-12-07 10:09:35,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:35,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506302961] [2019-12-07 10:09:35,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020963902] [2019-12-07 10:09:35,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0523b86-e11e-4dbd-af6f-e7df6ec25345/bin/uautomizer/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-12-07 10:09:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:35,376 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 10:09:35,377 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:09:35,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:35,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:09:35,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-12-07 10:09:35,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395070400] [2019-12-07 10:09:35,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 10:09:35,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:35,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 10:09:35,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2019-12-07 10:09:35,646 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 27 states. [2019-12-07 10:09:40,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:40,002 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2019-12-07 10:09:40,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 10:09:40,002 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 32 [2019-12-07 10:09:40,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:40,003 INFO L225 Difference]: With dead ends: 110 [2019-12-07 10:09:40,004 INFO L226 Difference]: Without dead ends: 108 [2019-12-07 10:09:40,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=481, Invalid=2489, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 10:09:40,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-12-07 10:09:40,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 72. [2019-12-07 10:09:40,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 10:09:40,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2019-12-07 10:09:40,012 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 32 [2019-12-07 10:09:40,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:40,012 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2019-12-07 10:09:40,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 10:09:40,012 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2019-12-07 10:09:40,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:09:40,013 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:40,013 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:40,214 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:09:40,214 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-12-07 10:09:40,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:40,215 INFO L82 PathProgramCache]: Analyzing trace with hash 983648196, now seen corresponding path program 1 times [2019-12-07 10:09:40,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:40,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625793577] [2019-12-07 10:09:40,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:40,339 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 10:09:40,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625793577] [2019-12-07 10:09:40,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968787335] [2019-12-07 10:09:40,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0523b86-e11e-4dbd-af6f-e7df6ec25345/bin/uautomizer/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-12-07 10:09:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:40,370 INFO L264 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 10:09:40,373 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:09:40,393 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-12-07 10:09:40,394 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:09:40,398 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:09:40,398 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:09:40,398 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-12-07 10:09:40,656 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:40,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:09:40,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-12-07 10:09:40,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761189316] [2019-12-07 10:09:40,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 10:09:40,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:40,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 10:09:40,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-12-07 10:09:40,657 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 21 states. [2019-12-07 10:09:41,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:41,819 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2019-12-07 10:09:41,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 10:09:41,819 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2019-12-07 10:09:41,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:41,820 INFO L225 Difference]: With dead ends: 115 [2019-12-07 10:09:41,820 INFO L226 Difference]: Without dead ends: 115 [2019-12-07 10:09:41,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 10:09:41,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-12-07 10:09:41,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 88. [2019-12-07 10:09:41,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 10:09:41,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2019-12-07 10:09:41,827 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 33 [2019-12-07 10:09:41,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:41,827 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2019-12-07 10:09:41,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 10:09:41,827 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2019-12-07 10:09:41,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 10:09:41,828 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:41,828 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:42,028 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:09:42,029 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-12-07 10:09:42,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:42,029 INFO L82 PathProgramCache]: Analyzing trace with hash -2083456284, now seen corresponding path program 1 times [2019-12-07 10:09:42,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:42,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716373865] [2019-12-07 10:09:42,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:42,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:42,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716373865] [2019-12-07 10:09:42,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994511038] [2019-12-07 10:09:42,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0523b86-e11e-4dbd-af6f-e7df6ec25345/bin/uautomizer/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-12-07 10:09:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:42,187 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 10:09:42,189 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:09:42,194 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2019-12-07 10:09:42,194 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:09:42,195 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:09:42,196 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:09:42,196 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2019-12-07 10:09:44,283 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_6 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_6))) is different from true [2019-12-07 10:09:44,333 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2019-12-07 10:09:44,334 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:09:44,337 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:09:44,337 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 10:09:44,338 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:21 [2019-12-07 10:09:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:44,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:09:44,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2019-12-07 10:09:44,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007778179] [2019-12-07 10:09:44,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:09:44,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:44,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:09:44,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=418, Unknown=1, NotChecked=40, Total=506 [2019-12-07 10:09:44,364 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand 10 states. [2019-12-07 10:09:44,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:44,469 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2019-12-07 10:09:44,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:09:44,470 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-12-07 10:09:44,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:44,470 INFO L225 Difference]: With dead ends: 83 [2019-12-07 10:09:44,470 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 10:09:44,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=60, Invalid=543, Unknown=1, NotChecked=46, Total=650 [2019-12-07 10:09:44,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 10:09:44,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-12-07 10:09:44,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 10:09:44,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-12-07 10:09:44,473 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 32 [2019-12-07 10:09:44,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:44,473 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-12-07 10:09:44,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:09:44,474 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-12-07 10:09:44,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:09:44,474 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:44,474 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:44,675 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:09:44,675 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-12-07 10:09:44,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:44,676 INFO L82 PathProgramCache]: Analyzing trace with hash 428322967, now seen corresponding path program 1 times [2019-12-07 10:09:44,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:44,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750426790] [2019-12-07 10:09:44,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:44,789 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 10:09:44,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750426790] [2019-12-07 10:09:44,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110322168] [2019-12-07 10:09:44,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0523b86-e11e-4dbd-af6f-e7df6ec25345/bin/uautomizer/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-12-07 10:09:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:44,818 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 10:09:44,820 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:09:44,824 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-12-07 10:09:44,825 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:09:44,828 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:09:44,828 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:09:44,828 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-12-07 10:09:45,074 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:09:45,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:09:45,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-12-07 10:09:45,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949990958] [2019-12-07 10:09:45,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 10:09:45,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:45,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 10:09:45,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-12-07 10:09:45,076 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 21 states. [2019-12-07 10:09:45,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:45,754 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-12-07 10:09:45,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 10:09:45,754 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2019-12-07 10:09:45,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:45,755 INFO L225 Difference]: With dead ends: 63 [2019-12-07 10:09:45,755 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 10:09:45,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=229, Invalid=1031, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 10:09:45,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 10:09:45,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-12-07 10:09:45,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 10:09:45,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-12-07 10:09:45,758 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 34 [2019-12-07 10:09:45,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:45,759 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-12-07 10:09:45,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 10:09:45,759 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-12-07 10:09:45,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 10:09:45,760 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:45,761 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:45,961 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:09:45,962 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-12-07 10:09:45,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:45,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1961781379, now seen corresponding path program 1 times [2019-12-07 10:09:45,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:45,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001356872] [2019-12-07 10:09:45,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:46,203 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 10:09:46,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001356872] [2019-12-07 10:09:46,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767633596] [2019-12-07 10:09:46,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0523b86-e11e-4dbd-af6f-e7df6ec25345/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:09:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:46,240 INFO L264 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 10:09:46,243 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:09:46,489 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 10:09:46,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:09:46,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2019-12-07 10:09:46,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710255197] [2019-12-07 10:09:46,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 10:09:46,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:46,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 10:09:46,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2019-12-07 10:09:46,490 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 32 states. [2019-12-07 10:09:47,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:47,781 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-12-07 10:09:47,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 10:09:47,782 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 57 [2019-12-07 10:09:47,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:47,782 INFO L225 Difference]: With dead ends: 66 [2019-12-07 10:09:47,782 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 10:09:47,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=410, Invalid=2452, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 10:09:47,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 10:09:47,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 10:09:47,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 10:09:47,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 10:09:47,783 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2019-12-07 10:09:47,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:47,784 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 10:09:47,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 10:09:47,784 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 10:09:47,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 10:09:47,984 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:09:47,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:09:47 BoogieIcfgContainer [2019-12-07 10:09:47,991 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:09:47,991 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:09:47,991 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:09:47,991 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:09:47,992 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:09:31" (3/4) ... [2019-12-07 10:09:47,996 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 10:09:48,001 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 10:09:48,001 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 10:09:48,001 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-12-07 10:09:48,001 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2019-12-07 10:09:48,001 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-12-07 10:09:48,005 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-12-07 10:09:48,005 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-12-07 10:09:48,005 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 10:09:48,005 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 10:09:48,041 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a0523b86-e11e-4dbd-af6f-e7df6ec25345/bin/uautomizer/witness.graphml [2019-12-07 10:09:48,041 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:09:48,042 INFO L168 Benchmark]: Toolchain (without parser) took 16502.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.5 MB). Free memory was 943.3 MB in the beginning and 834.1 MB in the end (delta: 109.2 MB). Peak memory consumption was 324.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:48,043 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:09:48,043 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -157.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:48,043 INFO L168 Benchmark]: Boogie Preprocessor took 23.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:09:48,043 INFO L168 Benchmark]: RCFGBuilder took 229.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:48,044 INFO L168 Benchmark]: TraceAbstraction took 16006.95 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 109.6 MB). Free memory was 1.1 GB in the beginning and 844.5 MB in the end (delta: 228.4 MB). Peak memory consumption was 338.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:48,044 INFO L168 Benchmark]: Witness Printer took 50.34 ms. Allocated memory is still 1.2 GB. Free memory was 844.5 MB in the beginning and 834.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:48,045 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 189.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -157.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 229.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16006.95 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 109.6 MB). Free memory was 1.1 GB in the beginning and 844.5 MB in the end (delta: 228.4 MB). Peak memory consumption was 338.0 MB. Max. memory is 11.5 GB. * Witness Printer took 50.34 ms. Allocated memory is still 1.2 GB. Free memory was 844.5 MB in the beginning and 834.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 36]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 53 locations, 12 error locations. Result: SAFE, OverallTime: 15.9s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 402 SDtfs, 1965 SDslu, 712 SDs, 0 SdLazy, 4878 SolverSat, 989 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 560 GetRequests, 247 SyntacticMatches, 11 SemanticMatches, 302 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1579 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=10, 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, 13 MinimizatonAttempts, 119 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 578 NumberOfCodeBlocks, 578 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 559 ConstructedInterpolants, 32 QuantifiedInterpolants, 129907 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1012 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 19 InterpolantComputations, 8 PerfectInterpolantSequences, 49/110 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 correct! Received shutdown request...