./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/verifythis/lcp.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_b38fc63c-2003-491d-9cb7-1d3646e362b1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b38fc63c-2003-491d-9cb7-1d3646e362b1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b38fc63c-2003-491d-9cb7-1d3646e362b1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b38fc63c-2003-491d-9cb7-1d3646e362b1/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/lcp.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b38fc63c-2003-491d-9cb7-1d3646e362b1/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b38fc63c-2003-491d-9cb7-1d3646e362b1/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 17e6e52dd20f9be422d05cd630fd9252ae3011a2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 18:33:46,550 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:33:46,551 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:33:46,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:33:46,559 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:33:46,560 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:33:46,561 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:33:46,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:33:46,563 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:33:46,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:33:46,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:33:46,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:33:46,566 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:33:46,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:33:46,567 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:33:46,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:33:46,568 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:33:46,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:33:46,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:33:46,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:33:46,573 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:33:46,574 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:33:46,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:33:46,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:33:46,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:33:46,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:33:46,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:33:46,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:33:46,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:33:46,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:33:46,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:33:46,579 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:33:46,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:33:46,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:33:46,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:33:46,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:33:46,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:33:46,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:33:46,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:33:46,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:33:46,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:33:46,583 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b38fc63c-2003-491d-9cb7-1d3646e362b1/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 18:33:46,592 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:33:46,592 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:33:46,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:33:46,593 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:33:46,593 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:33:46,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:33:46,593 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:33:46,593 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 18:33:46,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:33:46,593 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:33:46,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:33:46,594 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 18:33:46,594 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 18:33:46,594 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 18:33:46,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:33:46,594 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 18:33:46,594 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:33:46,594 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:33:46,594 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:33:46,595 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:33:46,595 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:33:46,595 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:33:46,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:33:46,595 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:33:46,595 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:33:46,595 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:33:46,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:33:46,596 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:33:46,596 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_b38fc63c-2003-491d-9cb7-1d3646e362b1/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 -> 17e6e52dd20f9be422d05cd630fd9252ae3011a2 [2019-12-07 18:33:46,696 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:33:46,704 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:33:46,706 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:33:46,707 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:33:46,707 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:33:46,708 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b38fc63c-2003-491d-9cb7-1d3646e362b1/bin/uautomizer/../../sv-benchmarks/c/verifythis/lcp.c [2019-12-07 18:33:46,746 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b38fc63c-2003-491d-9cb7-1d3646e362b1/bin/uautomizer/data/b80f2d663/37d79d3c91044e53a3abe21731083b3f/FLAGeb3c08504 [2019-12-07 18:33:47,087 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:33:47,087 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b38fc63c-2003-491d-9cb7-1d3646e362b1/sv-benchmarks/c/verifythis/lcp.c [2019-12-07 18:33:47,091 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b38fc63c-2003-491d-9cb7-1d3646e362b1/bin/uautomizer/data/b80f2d663/37d79d3c91044e53a3abe21731083b3f/FLAGeb3c08504 [2019-12-07 18:33:47,100 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b38fc63c-2003-491d-9cb7-1d3646e362b1/bin/uautomizer/data/b80f2d663/37d79d3c91044e53a3abe21731083b3f [2019-12-07 18:33:47,102 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:33:47,103 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 18:33:47,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:33:47,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:33:47,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:33:47,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:33:47" (1/1) ... [2019-12-07 18:33:47,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64225209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:33:47, skipping insertion in model container [2019-12-07 18:33:47,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:33:47" (1/1) ... [2019-12-07 18:33:47,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:33:47,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:33:47,234 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:33:47,275 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:33:47,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:33:47,302 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:33:47,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:33:47 WrapperNode [2019-12-07 18:33:47,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:33:47,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:33:47,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:33:47,303 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:33:47,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:33:47" (1/1) ... [2019-12-07 18:33:47,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:33:47" (1/1) ... [2019-12-07 18:33:47,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:33:47" (1/1) ... [2019-12-07 18:33:47,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:33:47" (1/1) ... [2019-12-07 18:33:47,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:33:47" (1/1) ... [2019-12-07 18:33:47,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:33:47" (1/1) ... [2019-12-07 18:33:47,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:33:47" (1/1) ... [2019-12-07 18:33:47,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:33:47,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:33:47,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:33:47,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:33:47,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:33:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b38fc63c-2003-491d-9cb7-1d3646e362b1/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 18:33:47,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 18:33:47,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:33:47,375 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-12-07 18:33:47,375 INFO L138 BoogieDeclarations]: Found implementation of procedure lcp [2019-12-07 18:33:47,375 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-12-07 18:33:47,375 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 18:33:47,375 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-12-07 18:33:47,375 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 18:33:47,376 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 18:33:47,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 18:33:47,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-12-07 18:33:47,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 18:33:47,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-12-07 18:33:47,376 INFO L130 BoogieDeclarations]: Found specification of procedure lcp [2019-12-07 18:33:47,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 18:33:47,376 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-12-07 18:33:47,376 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 18:33:47,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 18:33:47,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-12-07 18:33:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:33:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 18:33:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:33:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:33:47,584 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:33:47,584 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-12-07 18:33:47,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:33:47 BoogieIcfgContainer [2019-12-07 18:33:47,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:33:47,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:33:47,586 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:33:47,588 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:33:47,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:33:47" (1/3) ... [2019-12-07 18:33:47,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e0bdfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:33:47, skipping insertion in model container [2019-12-07 18:33:47,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:33:47" (2/3) ... [2019-12-07 18:33:47,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e0bdfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:33:47, skipping insertion in model container [2019-12-07 18:33:47,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:33:47" (3/3) ... [2019-12-07 18:33:47,590 INFO L109 eAbstractionObserver]: Analyzing ICFG lcp.c [2019-12-07 18:33:47,596 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:33:47,601 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-12-07 18:33:47,608 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-12-07 18:33:47,620 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:33:47,620 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 18:33:47,620 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:33:47,620 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:33:47,620 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:33:47,620 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:33:47,620 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:33:47,620 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:33:47,631 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2019-12-07 18:33:47,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:33:47,637 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:33:47,638 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:33:47,638 INFO L410 AbstractCegarLoop]: === Iteration 1 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, 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 18:33:47,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:33:47,642 INFO L82 PathProgramCache]: Analyzing trace with hash 992921340, now seen corresponding path program 1 times [2019-12-07 18:33:47,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:33:47,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350628911] [2019-12-07 18:33:47,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:33:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:47,820 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 18:33:47,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350628911] [2019-12-07 18:33:47,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:33:47,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:33:47,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433441250] [2019-12-07 18:33:47,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:33:47,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:33:47,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:33:47,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:33:47,836 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 8 states. [2019-12-07 18:33:48,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:33:48,086 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-12-07 18:33:48,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:33:48,088 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-12-07 18:33:48,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:33:48,094 INFO L225 Difference]: With dead ends: 60 [2019-12-07 18:33:48,095 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 18:33:48,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 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 18:33:48,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 18:33:48,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-12-07 18:33:48,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 18:33:48,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-12-07 18:33:48,126 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 16 [2019-12-07 18:33:48,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:33:48,126 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-12-07 18:33:48,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:33:48,126 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-12-07 18:33:48,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:33:48,127 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:33:48,127 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:33:48,127 INFO L410 AbstractCegarLoop]: === Iteration 2 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, 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 18:33:48,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:33:48,128 INFO L82 PathProgramCache]: Analyzing trace with hash 992921341, now seen corresponding path program 1 times [2019-12-07 18:33:48,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:33:48,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71894757] [2019-12-07 18:33:48,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:33:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:48,281 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 18:33:48,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71894757] [2019-12-07 18:33:48,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:33:48,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:33:48,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452038433] [2019-12-07 18:33:48,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:33:48,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:33:48,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:33:48,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:33:48,283 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 10 states. [2019-12-07 18:33:48,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:33:48,629 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-12-07 18:33:48,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:33:48,629 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-12-07 18:33:48,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:33:48,631 INFO L225 Difference]: With dead ends: 70 [2019-12-07 18:33:48,632 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 18:33:48,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:33:48,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 18:33:48,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2019-12-07 18:33:48,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 18:33:48,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-12-07 18:33:48,638 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2019-12-07 18:33:48,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:33:48,639 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-12-07 18:33:48,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:33:48,639 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-12-07 18:33:48,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 18:33:48,639 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:33:48,640 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:33:48,640 INFO L410 AbstractCegarLoop]: === Iteration 3 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, 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 18:33:48,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:33:48,640 INFO L82 PathProgramCache]: Analyzing trace with hash 715790491, now seen corresponding path program 1 times [2019-12-07 18:33:48,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:33:48,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653547426] [2019-12-07 18:33:48,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:33:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:48,765 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 18:33:48,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653547426] [2019-12-07 18:33:48,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:33:48,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:33:48,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178636310] [2019-12-07 18:33:48,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:33:48,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:33:48,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:33:48,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:33:48,767 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 10 states. [2019-12-07 18:33:49,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:33:49,141 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-12-07 18:33:49,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:33:49,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-12-07 18:33:49,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:33:49,142 INFO L225 Difference]: With dead ends: 69 [2019-12-07 18:33:49,142 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 18:33:49,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:33:49,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 18:33:49,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-12-07 18:33:49,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 18:33:49,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-12-07 18:33:49,147 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 17 [2019-12-07 18:33:49,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:33:49,148 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-12-07 18:33:49,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:33:49,148 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-12-07 18:33:49,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:33:49,148 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:33:49,148 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:33:49,149 INFO L410 AbstractCegarLoop]: === Iteration 4 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, 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 18:33:49,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:33:49,149 INFO L82 PathProgramCache]: Analyzing trace with hash 688616144, now seen corresponding path program 1 times [2019-12-07 18:33:49,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:33:49,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888529023] [2019-12-07 18:33:49,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:33:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:49,183 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 18:33:49,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888529023] [2019-12-07 18:33:49,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:33:49,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:33:49,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052990806] [2019-12-07 18:33:49,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:33:49,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:33:49,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:33:49,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:33:49,186 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 5 states. [2019-12-07 18:33:49,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:33:49,267 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-12-07 18:33:49,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:33:49,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 18:33:49,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:33:49,268 INFO L225 Difference]: With dead ends: 61 [2019-12-07 18:33:49,268 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 18:33:49,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:33:49,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 18:33:49,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-12-07 18:33:49,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 18:33:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-12-07 18:33:49,273 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 19 [2019-12-07 18:33:49,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:33:49,273 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-12-07 18:33:49,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:33:49,273 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-12-07 18:33:49,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:33:49,274 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:33:49,274 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:33:49,274 INFO L410 AbstractCegarLoop]: === Iteration 5 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, 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 18:33:49,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:33:49,274 INFO L82 PathProgramCache]: Analyzing trace with hash -333529585, now seen corresponding path program 1 times [2019-12-07 18:33:49,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:33:49,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824410256] [2019-12-07 18:33:49,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:33:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:33:49,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824410256] [2019-12-07 18:33:49,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130942780] [2019-12-07 18:33:49,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b38fc63c-2003-491d-9cb7-1d3646e362b1/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 18:33:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:49,431 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 18:33:49,436 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:33:49,471 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 18:33:49,471 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:49,476 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:49,476 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:33:49,476 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-12-07 18:33:49,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:49,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:49,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:33:49,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:33:49,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-12-07 18:33:49,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138649711] [2019-12-07 18:33:49,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 18:33:49,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:33:49,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 18:33:49,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:33:49,658 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 19 states. [2019-12-07 18:33:50,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:33:50,144 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2019-12-07 18:33:50,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 18:33:50,144 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2019-12-07 18:33:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:33:50,145 INFO L225 Difference]: With dead ends: 69 [2019-12-07 18:33:50,145 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 18:33:50,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2019-12-07 18:33:50,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 18:33:50,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-12-07 18:33:50,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 18:33:50,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-12-07 18:33:50,151 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 22 [2019-12-07 18:33:50,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:33:50,152 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-12-07 18:33:50,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 18:33:50,152 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-12-07 18:33:50,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 18:33:50,153 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:33:50,153 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, 1] [2019-12-07 18:33:50,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:33:50,354 INFO L410 AbstractCegarLoop]: === Iteration 6 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, 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 18:33:50,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:33:50,355 INFO L82 PathProgramCache]: Analyzing trace with hash -578852278, now seen corresponding path program 1 times [2019-12-07 18:33:50,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:33:50,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680676474] [2019-12-07 18:33:50,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:33:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:50,444 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 18:33:50,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680676474] [2019-12-07 18:33:50,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:33:50,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:33:50,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121174514] [2019-12-07 18:33:50,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:33:50,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:33:50,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:33:50,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:33:50,445 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 9 states. [2019-12-07 18:33:50,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:33:50,615 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-12-07 18:33:50,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:33:50,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-12-07 18:33:50,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:33:50,616 INFO L225 Difference]: With dead ends: 69 [2019-12-07 18:33:50,617 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 18:33:50,617 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:33:50,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 18:33:50,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-07 18:33:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 18:33:50,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2019-12-07 18:33:50,621 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 23 [2019-12-07 18:33:50,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:33:50,621 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2019-12-07 18:33:50,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:33:50,621 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2019-12-07 18:33:50,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 18:33:50,621 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:33:50,622 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:33:50,622 INFO L410 AbstractCegarLoop]: === Iteration 7 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, 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 18:33:50,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:33:50,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1749482551, now seen corresponding path program 1 times [2019-12-07 18:33:50,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:33:50,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117338320] [2019-12-07 18:33:50,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:33:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:33:50,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117338320] [2019-12-07 18:33:50,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772814098] [2019-12-07 18:33:50,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b38fc63c-2003-491d-9cb7-1d3646e362b1/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 18:33:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:50,769 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 18:33:50,771 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:33:50,775 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 18:33:50,775 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:50,778 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:50,778 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:33:50,778 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-12-07 18:33:50,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:50,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:50,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:33:50,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:33:50,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-12-07 18:33:50,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186977555] [2019-12-07 18:33:50,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 18:33:50,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:33:50,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 18:33:50,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:33:50,932 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 19 states. [2019-12-07 18:33:51,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:33:51,384 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-12-07 18:33:51,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:33:51,384 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2019-12-07 18:33:51,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:33:51,385 INFO L225 Difference]: With dead ends: 64 [2019-12-07 18:33:51,385 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 18:33:51,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2019-12-07 18:33:51,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 18:33:51,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-12-07 18:33:51,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 18:33:51,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2019-12-07 18:33:51,389 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 23 [2019-12-07 18:33:51,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:33:51,390 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2019-12-07 18:33:51,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 18:33:51,390 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2019-12-07 18:33:51,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:33:51,390 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:33:51,390 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] [2019-12-07 18:33:51,591 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:33:51,591 INFO L410 AbstractCegarLoop]: === Iteration 8 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, 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 18:33:51,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:33:51,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1580156168, now seen corresponding path program 1 times [2019-12-07 18:33:51,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:33:51,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664408546] [2019-12-07 18:33:51,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:33:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 18:33:51,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664408546] [2019-12-07 18:33:51,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:33:51,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:33:51,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850242789] [2019-12-07 18:33:51,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:33:51,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:33:51,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:33:51,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:33:51,666 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 8 states. [2019-12-07 18:33:51,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:33:51,815 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-12-07 18:33:51,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:33:51,816 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-07 18:33:51,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:33:51,816 INFO L225 Difference]: With dead ends: 57 [2019-12-07 18:33:51,816 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 18:33:51,817 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 18:33:51,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 18:33:51,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-12-07 18:33:51,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 18:33:51,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-12-07 18:33:51,820 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 29 [2019-12-07 18:33:51,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:33:51,820 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-12-07 18:33:51,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:33:51,820 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-12-07 18:33:51,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:33:51,821 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:33:51,821 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] [2019-12-07 18:33:51,821 INFO L410 AbstractCegarLoop]: === Iteration 9 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, 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 18:33:51,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:33:51,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1580156167, now seen corresponding path program 1 times [2019-12-07 18:33:51,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:33:51,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728673452] [2019-12-07 18:33:51,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:33:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:52,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:33:52,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728673452] [2019-12-07 18:33:52,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295005653] [2019-12-07 18:33:52,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b38fc63c-2003-491d-9cb7-1d3646e362b1/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 18:33:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:52,034 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 18:33:52,036 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:33:52,039 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 18:33:52,039 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:52,042 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:52,043 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:33:52,043 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-12-07 18:33:52,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:52,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:54,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:33:54,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:33:54,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2019-12-07 18:33:54,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117241606] [2019-12-07 18:33:54,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 18:33:54,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:33:54,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 18:33:54,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=571, Unknown=1, NotChecked=0, Total=650 [2019-12-07 18:33:54,356 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 26 states. [2019-12-07 18:33:55,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:33:55,272 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2019-12-07 18:33:55,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 18:33:55,273 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2019-12-07 18:33:55,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:33:55,273 INFO L225 Difference]: With dead ends: 59 [2019-12-07 18:33:55,273 INFO L226 Difference]: Without dead ends: 59 [2019-12-07 18:33:55,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=260, Invalid=1461, Unknown=1, NotChecked=0, Total=1722 [2019-12-07 18:33:55,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-07 18:33:55,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-12-07 18:33:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 18:33:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2019-12-07 18:33:55,279 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 29 [2019-12-07 18:33:55,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:33:55,279 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2019-12-07 18:33:55,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 18:33:55,279 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2019-12-07 18:33:55,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 18:33:55,280 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:33:55,280 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 18:33:55,480 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:33:55,481 INFO L410 AbstractCegarLoop]: === Iteration 10 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, 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 18:33:55,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:33:55,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1740200963, now seen corresponding path program 1 times [2019-12-07 18:33:55,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:33:55,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704883910] [2019-12-07 18:33:55,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:33:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:55,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:33:55,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704883910] [2019-12-07 18:33:55,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068387408] [2019-12-07 18:33:55,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b38fc63c-2003-491d-9cb7-1d3646e362b1/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 18:33:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:55,703 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 18:33:55,705 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:33:55,709 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 18:33:55,710 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:55,713 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:55,713 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:33:55,714 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-12-07 18:33:55,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:55,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:33:58,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:33:58,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:33:58,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2019-12-07 18:33:58,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333287558] [2019-12-07 18:33:58,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 18:33:58,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:33:58,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 18:33:58,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=571, Unknown=1, NotChecked=0, Total=650 [2019-12-07 18:33:58,019 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 26 states. [2019-12-07 18:33:59,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:33:59,157 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-12-07 18:33:59,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 18:33:59,157 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 30 [2019-12-07 18:33:59,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:33:59,158 INFO L225 Difference]: With dead ends: 58 [2019-12-07 18:33:59,158 INFO L226 Difference]: Without dead ends: 58 [2019-12-07 18:33:59,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=260, Invalid=1461, Unknown=1, NotChecked=0, Total=1722 [2019-12-07 18:33:59,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-07 18:33:59,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2019-12-07 18:33:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 18:33:59,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-12-07 18:33:59,162 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 30 [2019-12-07 18:33:59,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:33:59,162 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-12-07 18:33:59,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 18:33:59,163 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-12-07 18:33:59,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 18:33:59,164 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:33:59,164 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, 1, 1, 1, 1, 1, 1] [2019-12-07 18:33:59,364 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:33:59,365 INFO L410 AbstractCegarLoop]: === Iteration 11 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, 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 18:33:59,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:33:59,365 INFO L82 PathProgramCache]: Analyzing trace with hash 35373901, now seen corresponding path program 1 times [2019-12-07 18:33:59,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:33:59,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805208224] [2019-12-07 18:33:59,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:33:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:59,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:33:59,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805208224] [2019-12-07 18:33:59,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422931290] [2019-12-07 18:33:59,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b38fc63c-2003-491d-9cb7-1d3646e362b1/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 18:33:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:59,526 INFO L264 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 18:33:59,527 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:33:59,533 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 18:33:59,533 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:33:59,536 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:33:59,536 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:33:59,536 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-12-07 18:33:59,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:33:59,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:33:59,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2019-12-07 18:33:59,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427598841] [2019-12-07 18:33:59,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:33:59,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:33:59,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:33:59,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2019-12-07 18:33:59,859 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 13 states. [2019-12-07 18:34:00,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:00,138 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2019-12-07 18:34:00,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:34:00,139 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2019-12-07 18:34:00,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:00,139 INFO L225 Difference]: With dead ends: 56 [2019-12-07 18:34:00,139 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 18:34:00,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2019-12-07 18:34:00,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 18:34:00,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-12-07 18:34:00,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 18:34:00,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-12-07 18:34:00,142 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 38 [2019-12-07 18:34:00,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:00,143 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-12-07 18:34:00,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:34:00,143 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-12-07 18:34:00,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:34:00,144 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:00,144 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:00,345 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:34:00,345 INFO L410 AbstractCegarLoop]: === Iteration 12 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, 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 18:34:00,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:00,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1096590900, now seen corresponding path program 1 times [2019-12-07 18:34:00,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:00,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467810694] [2019-12-07 18:34:00,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:00,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:34:00,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467810694] [2019-12-07 18:34:00,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733445024] [2019-12-07 18:34:00,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b38fc63c-2003-491d-9cb7-1d3646e362b1/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 18:34:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:00,508 INFO L264 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 18:34:00,510 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:34:00,513 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 18:34:00,514 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:34:00,517 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:34:00,517 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:34:00,517 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-12-07 18:34:00,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:34:00,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:34:00,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2019-12-07 18:34:00,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026942444] [2019-12-07 18:34:00,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:34:00,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:00,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:34:00,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2019-12-07 18:34:00,820 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 13 states. [2019-12-07 18:34:01,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:01,227 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-12-07 18:34:01,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:34:01,228 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-12-07 18:34:01,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:01,229 INFO L225 Difference]: With dead ends: 55 [2019-12-07 18:34:01,229 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 18:34:01,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2019-12-07 18:34:01,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 18:34:01,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-12-07 18:34:01,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 18:34:01,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-12-07 18:34:01,232 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 39 [2019-12-07 18:34:01,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:01,233 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-12-07 18:34:01,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:34:01,233 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-12-07 18:34:01,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 18:34:01,234 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:01,234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:01,435 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:34:01,435 INFO L410 AbstractCegarLoop]: === Iteration 13 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, 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 18:34:01,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:01,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1566484332, now seen corresponding path program 1 times [2019-12-07 18:34:01,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:01,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862546488] [2019-12-07 18:34:01,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 18:34:01,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862546488] [2019-12-07 18:34:01,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:01,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:34:01,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014516613] [2019-12-07 18:34:01,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:34:01,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:01,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:34:01,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:34:01,491 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 6 states. [2019-12-07 18:34:01,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:01,572 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-12-07 18:34:01,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:34:01,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 18:34:01,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:01,573 INFO L225 Difference]: With dead ends: 52 [2019-12-07 18:34:01,574 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 18:34:01,574 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 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 18:34:01,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 18:34:01,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-12-07 18:34:01,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 18:34:01,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-12-07 18:34:01,577 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 41 [2019-12-07 18:34:01,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:01,577 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-12-07 18:34:01,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:34:01,577 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-12-07 18:34:01,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 18:34:01,578 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:01,578 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:01,578 INFO L410 AbstractCegarLoop]: === Iteration 14 === [lcpErr3REQUIRES_VIOLATION, lcpErr2REQUIRES_VIOLATION, lcpErr1REQUIRES_VIOLATION, lcpErr0REQUIRES_VIOLATION, 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 18:34:01,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:01,579 INFO L82 PathProgramCache]: Analyzing trace with hash -2142076529, now seen corresponding path program 1 times [2019-12-07 18:34:01,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:01,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132174641] [2019-12-07 18:34:01,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:01,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 18:34:01,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132174641] [2019-12-07 18:34:01,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:01,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:34:01,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206420551] [2019-12-07 18:34:01,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:34:01,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:01,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:34:01,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:34:01,649 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 7 states. [2019-12-07 18:34:01,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:01,769 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2019-12-07 18:34:01,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:34:01,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-07 18:34:01,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:01,769 INFO L225 Difference]: With dead ends: 51 [2019-12-07 18:34:01,769 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 18:34:01,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 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 18:34:01,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 18:34:01,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 18:34:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 18:34:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 18:34:01,770 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2019-12-07 18:34:01,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:01,770 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:34:01,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:34:01,770 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 18:34:01,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 18:34:01,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:34:01 BoogieIcfgContainer [2019-12-07 18:34:01,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:34:01,774 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:34:01,774 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:34:01,774 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:34:01,774 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:33:47" (3/4) ... [2019-12-07 18:34:01,776 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 18:34:01,780 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 18:34:01,780 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lcp [2019-12-07 18:34:01,781 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 18:34:01,781 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-12-07 18:34:01,781 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2019-12-07 18:34:01,781 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-12-07 18:34:01,784 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-12-07 18:34:01,784 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-12-07 18:34:01,784 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 18:34:01,785 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 18:34:01,815 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b38fc63c-2003-491d-9cb7-1d3646e362b1/bin/uautomizer/witness.graphml [2019-12-07 18:34:01,815 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:34:01,816 INFO L168 Benchmark]: Toolchain (without parser) took 14713.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.1 MB). Free memory was 943.4 MB in the beginning and 1.2 GB in the end (delta: -262.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:34:01,816 INFO L168 Benchmark]: CDTParser took 0.13 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 18:34:01,817 INFO L168 Benchmark]: CACSL2BoogieTranslator took 199.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -183.2 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:34:01,817 INFO L168 Benchmark]: Boogie Preprocessor took 31.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:34:01,817 INFO L168 Benchmark]: RCFGBuilder took 250.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:34:01,817 INFO L168 Benchmark]: TraceAbstraction took 14187.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 84.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -116.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:34:01,818 INFO L168 Benchmark]: Witness Printer took 41.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:34:01,819 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.13 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 199.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -183.2 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 250.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14187.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 84.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -116.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 41.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 30]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 63 locations, 16 error locations. Result: SAFE, OverallTime: 14.1s, OverallIterations: 14, TraceHistogramMax: 2, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 434 SDtfs, 1592 SDslu, 736 SDs, 0 SdLazy, 4289 SolverSat, 446 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 472 GetRequests, 185 SyntacticMatches, 14 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1142 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, 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, 14 MinimizatonAttempts, 42 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 566 NumberOfCodeBlocks, 566 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 546 ConstructedInterpolants, 78 QuantifiedInterpolants, 132425 SizeOfPredicates, 68 NumberOfNonLiveVariables, 914 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 25/49 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...