./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/freeAlloca.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4c0d5f85-130f-4257-97be-c9197e6c9160/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4c0d5f85-130f-4257-97be-c9197e6c9160/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4c0d5f85-130f-4257-97be-c9197e6c9160/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4c0d5f85-130f-4257-97be-c9197e6c9160/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/freeAlloca.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4c0d5f85-130f-4257-97be-c9197e6c9160/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4c0d5f85-130f-4257-97be-c9197e6c9160/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 2749915c63b6e758ac6033a38fbdad80769d2869 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:04:28,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:04:28,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:04:28,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:04:28,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:04:28,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:04:28,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:04:28,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:04:28,755 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:04:28,759 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:04:28,760 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:04:28,761 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:04:28,762 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:04:28,764 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:04:28,765 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:04:28,766 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:04:28,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:04:28,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:04:28,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:04:28,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:04:28,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:04:28,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:04:28,782 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:04:28,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:04:28,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:04:28,785 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:04:28,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:04:28,787 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:04:28,787 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:04:28,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:04:28,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:04:28,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:04:28,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:04:28,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:04:28,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:04:28,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:04:28,793 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:04:28,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:04:28,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:04:28,794 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:04:28,795 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:04:28,796 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4c0d5f85-130f-4257-97be-c9197e6c9160/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-16 00:04:28,820 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:04:28,830 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:04:28,831 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:04:28,832 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:04:28,832 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:04:28,832 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:04:28,833 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:04:28,833 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:04:28,833 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:04:28,833 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:04:28,834 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:04:28,834 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:04:28,834 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:04:28,835 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:04:28,835 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:04:28,836 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:04:28,836 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:04:28,836 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:04:28,836 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:04:28,837 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:04:28,837 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:04:28,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:04:28,837 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:04:28,838 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:04:28,838 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:04:28,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:04:28,839 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_4c0d5f85-130f-4257-97be-c9197e6c9160/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 -> 2749915c63b6e758ac6033a38fbdad80769d2869 [2019-11-16 00:04:28,871 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:04:28,885 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:04:28,888 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:04:28,890 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:04:28,890 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:04:28,891 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4c0d5f85-130f-4257-97be-c9197e6c9160/bin/uautomizer/../../sv-benchmarks/c/memsafety-ext3/freeAlloca.c [2019-11-16 00:04:28,952 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4c0d5f85-130f-4257-97be-c9197e6c9160/bin/uautomizer/data/e63abf186/cc5181c8924c4d9fa30a63e9ab2acf38/FLAG451fdf583 [2019-11-16 00:04:29,318 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:04:29,320 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4c0d5f85-130f-4257-97be-c9197e6c9160/sv-benchmarks/c/memsafety-ext3/freeAlloca.c [2019-11-16 00:04:29,325 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4c0d5f85-130f-4257-97be-c9197e6c9160/bin/uautomizer/data/e63abf186/cc5181c8924c4d9fa30a63e9ab2acf38/FLAG451fdf583 [2019-11-16 00:04:29,739 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4c0d5f85-130f-4257-97be-c9197e6c9160/bin/uautomizer/data/e63abf186/cc5181c8924c4d9fa30a63e9ab2acf38 [2019-11-16 00:04:29,741 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:04:29,742 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:04:29,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:04:29,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:04:29,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:04:29,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:04:29" (1/1) ... [2019-11-16 00:04:29,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c99f82e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:29, skipping insertion in model container [2019-11-16 00:04:29,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:04:29" (1/1) ... [2019-11-16 00:04:29,758 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:04:29,778 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:04:30,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:04:30,054 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:04:30,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:04:30,082 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:04:30,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:30 WrapperNode [2019-11-16 00:04:30,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:04:30,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:04:30,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:04:30,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:04:30,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:30" (1/1) ... [2019-11-16 00:04:30,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:30" (1/1) ... [2019-11-16 00:04:30,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:30" (1/1) ... [2019-11-16 00:04:30,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:30" (1/1) ... [2019-11-16 00:04:30,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:30" (1/1) ... [2019-11-16 00:04:30,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:30" (1/1) ... [2019-11-16 00:04:30,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:30" (1/1) ... [2019-11-16 00:04:30,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:04:30,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:04:30,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:04:30,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:04:30,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c0d5f85-130f-4257-97be-c9197e6c9160/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-11-16 00:04:30,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:04:30,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:04:30,174 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:04:30,174 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:04:30,174 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:04:30,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-16 00:04:30,175 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:04:30,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:04:30,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:04:30,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:04:30,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:04:30,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:04:30,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:04:30,417 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:04:30,417 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-16 00:04:30,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:04:30 BoogieIcfgContainer [2019-11-16 00:04:30,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:04:30,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:04:30,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:04:30,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:04:30,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:04:29" (1/3) ... [2019-11-16 00:04:30,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f079b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:04:30, skipping insertion in model container [2019-11-16 00:04:30,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:30" (2/3) ... [2019-11-16 00:04:30,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f079b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:04:30, skipping insertion in model container [2019-11-16 00:04:30,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:04:30" (3/3) ... [2019-11-16 00:04:30,425 INFO L109 eAbstractionObserver]: Analyzing ICFG freeAlloca.c [2019-11-16 00:04:30,438 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:04:30,453 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-16 00:04:30,465 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-16 00:04:30,492 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:04:30,492 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:04:30,494 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:04:30,494 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:04:30,494 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:04:30,494 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:04:30,494 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:04:30,494 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:04:30,511 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-16 00:04:30,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-16 00:04:30,521 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:30,521 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:30,523 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-16 00:04:30,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:30,528 INFO L82 PathProgramCache]: Analyzing trace with hash 996996062, now seen corresponding path program 1 times [2019-11-16 00:04:30,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:30,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611829884] [2019-11-16 00:04:30,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:30,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:30,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:30,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611829884] [2019-11-16 00:04:30,668 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:04:30,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:04:30,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152344863] [2019-11-16 00:04:30,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:04:30,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:30,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:04:30,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:04:30,685 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2019-11-16 00:04:30,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:30,786 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-11-16 00:04:30,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:04:30,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-16 00:04:30,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:30,797 INFO L225 Difference]: With dead ends: 28 [2019-11-16 00:04:30,797 INFO L226 Difference]: Without dead ends: 25 [2019-11-16 00:04:30,799 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:04:30,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-16 00:04:30,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-16 00:04:30,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-16 00:04:30,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-11-16 00:04:30,829 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 8 [2019-11-16 00:04:30,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:30,829 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-16 00:04:30,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:04:30,829 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-11-16 00:04:30,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-16 00:04:30,830 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:30,830 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:30,830 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-16 00:04:30,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:30,831 INFO L82 PathProgramCache]: Analyzing trace with hash 996995752, now seen corresponding path program 1 times [2019-11-16 00:04:30,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:30,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738290506] [2019-11-16 00:04:30,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:30,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:30,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:30,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:30,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738290506] [2019-11-16 00:04:30,892 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:04:30,892 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:04:30,892 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845735555] [2019-11-16 00:04:30,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:04:30,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:30,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:04:30,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:04:30,894 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 4 states. [2019-11-16 00:04:30,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:30,964 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-11-16 00:04:30,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:04:30,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-16 00:04:30,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:30,965 INFO L225 Difference]: With dead ends: 31 [2019-11-16 00:04:30,965 INFO L226 Difference]: Without dead ends: 31 [2019-11-16 00:04:30,966 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:04:30,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-16 00:04:30,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-11-16 00:04:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-16 00:04:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-11-16 00:04:30,971 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 8 [2019-11-16 00:04:30,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:30,971 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-16 00:04:30,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:04:30,972 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-11-16 00:04:30,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-16 00:04:30,972 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:30,972 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:30,972 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-16 00:04:30,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:30,973 INFO L82 PathProgramCache]: Analyzing trace with hash 996995806, now seen corresponding path program 1 times [2019-11-16 00:04:30,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:30,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112117710] [2019-11-16 00:04:30,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:30,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:30,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:31,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112117710] [2019-11-16 00:04:31,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:04:31,090 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:04:31,090 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206211538] [2019-11-16 00:04:31,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:04:31,091 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:31,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:04:31,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:04:31,092 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 4 states. [2019-11-16 00:04:31,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:31,158 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-11-16 00:04:31,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:04:31,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-16 00:04:31,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:31,159 INFO L225 Difference]: With dead ends: 30 [2019-11-16 00:04:31,159 INFO L226 Difference]: Without dead ends: 30 [2019-11-16 00:04:31,160 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:04:31,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-16 00:04:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-11-16 00:04:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-16 00:04:31,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-11-16 00:04:31,163 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 8 [2019-11-16 00:04:31,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:31,164 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-11-16 00:04:31,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:04:31,164 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-11-16 00:04:31,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-16 00:04:31,164 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:31,164 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:31,165 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-16 00:04:31,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:31,165 INFO L82 PathProgramCache]: Analyzing trace with hash 996995805, now seen corresponding path program 1 times [2019-11-16 00:04:31,165 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:31,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139218196] [2019-11-16 00:04:31,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:31,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:31,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:31,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:31,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139218196] [2019-11-16 00:04:31,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:04:31,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:04:31,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623015917] [2019-11-16 00:04:31,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:04:31,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:31,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:04:31,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:04:31,218 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 4 states. [2019-11-16 00:04:31,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:31,276 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-11-16 00:04:31,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:04:31,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-16 00:04:31,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:31,278 INFO L225 Difference]: With dead ends: 25 [2019-11-16 00:04:31,278 INFO L226 Difference]: Without dead ends: 25 [2019-11-16 00:04:31,278 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:04:31,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-16 00:04:31,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-16 00:04:31,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-16 00:04:31,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-11-16 00:04:31,283 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 8 [2019-11-16 00:04:31,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:31,283 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-11-16 00:04:31,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:04:31,283 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-11-16 00:04:31,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:04:31,284 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:31,284 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:31,284 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-16 00:04:31,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:31,285 INFO L82 PathProgramCache]: Analyzing trace with hash 63449068, now seen corresponding path program 1 times [2019-11-16 00:04:31,285 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:31,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462218394] [2019-11-16 00:04:31,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:31,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:31,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:31,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:04:31,333 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462218394] [2019-11-16 00:04:31,333 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:04:31,334 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:04:31,334 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688602521] [2019-11-16 00:04:31,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:04:31,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:31,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:04:31,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:04:31,335 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 4 states. [2019-11-16 00:04:31,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:31,373 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-11-16 00:04:31,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:04:31,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-16 00:04:31,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:31,375 INFO L225 Difference]: With dead ends: 22 [2019-11-16 00:04:31,375 INFO L226 Difference]: Without dead ends: 22 [2019-11-16 00:04:31,375 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:04:31,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-16 00:04:31,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-16 00:04:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-16 00:04:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-11-16 00:04:31,378 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 12 [2019-11-16 00:04:31,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:31,379 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-11-16 00:04:31,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:04:31,379 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-11-16 00:04:31,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:04:31,379 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:31,380 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:31,380 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-16 00:04:31,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:31,380 INFO L82 PathProgramCache]: Analyzing trace with hash 63449121, now seen corresponding path program 1 times [2019-11-16 00:04:31,380 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:31,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218968249] [2019-11-16 00:04:31,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:31,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:31,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:31,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218968249] [2019-11-16 00:04:31,465 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:04:31,465 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:04:31,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233824501] [2019-11-16 00:04:31,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:04:31,466 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:31,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:04:31,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:04:31,466 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 7 states. [2019-11-16 00:04:31,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:31,551 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-11-16 00:04:31,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:04:31,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-16 00:04:31,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:31,553 INFO L225 Difference]: With dead ends: 23 [2019-11-16 00:04:31,553 INFO L226 Difference]: Without dead ends: 23 [2019-11-16 00:04:31,553 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:04:31,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-16 00:04:31,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-11-16 00:04:31,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-16 00:04:31,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-11-16 00:04:31,556 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2019-11-16 00:04:31,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:31,557 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-16 00:04:31,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:04:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-11-16 00:04:31,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-16 00:04:31,558 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:31,558 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:31,558 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-16 00:04:31,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:31,558 INFO L82 PathProgramCache]: Analyzing trace with hash 425550780, now seen corresponding path program 1 times [2019-11-16 00:04:31,559 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:31,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039958027] [2019-11-16 00:04:31,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:31,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:31,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:31,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:31,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039958027] [2019-11-16 00:04:31,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660420351] [2019-11-16 00:04:31,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c0d5f85-130f-4257-97be-c9197e6c9160/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-11-16 00:04:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:31,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:04:31,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:31,713 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:31,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-16 00:04:31,714 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60272089] [2019-11-16 00:04:31,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:04:31,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:31,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:04:31,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:04:31,715 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 6 states. [2019-11-16 00:04:31,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:31,771 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-16 00:04:31,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:04:31,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-16 00:04:31,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:31,772 INFO L225 Difference]: With dead ends: 27 [2019-11-16 00:04:31,772 INFO L226 Difference]: Without dead ends: 27 [2019-11-16 00:04:31,773 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:04:31,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-16 00:04:31,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2019-11-16 00:04:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-16 00:04:31,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-11-16 00:04:31,776 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 15 [2019-11-16 00:04:31,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:31,776 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-11-16 00:04:31,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:04:31,777 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-11-16 00:04:31,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-16 00:04:31,777 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:31,777 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:31,981 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:31,982 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-16 00:04:31,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:31,982 INFO L82 PathProgramCache]: Analyzing trace with hash 316362009, now seen corresponding path program 2 times [2019-11-16 00:04:31,982 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:31,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179367383] [2019-11-16 00:04:31,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:31,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:31,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:32,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179367383] [2019-11-16 00:04:32,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811906445] [2019-11-16 00:04:32,065 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c0d5f85-130f-4257-97be-c9197e6c9160/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-11-16 00:04:32,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-16 00:04:32,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:04:32,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:04:32,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:32,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:04:32,168 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:04:32,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2019-11-16 00:04:32,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698318938] [2019-11-16 00:04:32,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:04:32,169 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:32,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:04:32,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:04:32,170 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 5 states. [2019-11-16 00:04:32,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:32,214 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-11-16 00:04:32,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:04:32,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-16 00:04:32,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:32,215 INFO L225 Difference]: With dead ends: 26 [2019-11-16 00:04:32,215 INFO L226 Difference]: Without dead ends: 24 [2019-11-16 00:04:32,216 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:04:32,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-16 00:04:32,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-16 00:04:32,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-16 00:04:32,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-11-16 00:04:32,219 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 19 [2019-11-16 00:04:32,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:32,219 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-11-16 00:04:32,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:04:32,219 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-11-16 00:04:32,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-16 00:04:32,220 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:32,220 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:32,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:32,421 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-16 00:04:32,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:32,422 INFO L82 PathProgramCache]: Analyzing trace with hash 316354064, now seen corresponding path program 1 times [2019-11-16 00:04:32,422 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:32,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576793567] [2019-11-16 00:04:32,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:32,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:32,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:32,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:32,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576793567] [2019-11-16 00:04:32,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955005363] [2019-11-16 00:04:32,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c0d5f85-130f-4257-97be-c9197e6c9160/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-11-16 00:04:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:32,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:04:32,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:32,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:32,544 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:32,544 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-11-16 00:04:32,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141731278] [2019-11-16 00:04:32,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:04:32,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:32,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:04:32,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:04:32,547 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 7 states. [2019-11-16 00:04:32,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:32,617 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-11-16 00:04:32,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:04:32,617 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-16 00:04:32,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:32,618 INFO L225 Difference]: With dead ends: 31 [2019-11-16 00:04:32,618 INFO L226 Difference]: Without dead ends: 31 [2019-11-16 00:04:32,619 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:04:32,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-16 00:04:32,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2019-11-16 00:04:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-16 00:04:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-11-16 00:04:32,622 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 19 [2019-11-16 00:04:32,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:32,622 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-11-16 00:04:32,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:04:32,622 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-11-16 00:04:32,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-16 00:04:32,623 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:32,623 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:32,829 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:32,830 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-16 00:04:32,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:32,830 INFO L82 PathProgramCache]: Analyzing trace with hash -564453139, now seen corresponding path program 2 times [2019-11-16 00:04:32,830 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:32,830 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571136923] [2019-11-16 00:04:32,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:32,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:32,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:32,917 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:32,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571136923] [2019-11-16 00:04:32,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061714520] [2019-11-16 00:04:32,917 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c0d5f85-130f-4257-97be-c9197e6c9160/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-11-16 00:04:32,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:04:32,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:04:32,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:04:32,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:32,994 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:32,995 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-11-16 00:04:32,995 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341821098] [2019-11-16 00:04:32,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:04:32,995 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:32,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:04:32,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:04:32,996 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 8 states. [2019-11-16 00:04:33,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:33,070 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-11-16 00:04:33,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:04:33,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-16 00:04:33,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:33,071 INFO L225 Difference]: With dead ends: 35 [2019-11-16 00:04:33,071 INFO L226 Difference]: Without dead ends: 35 [2019-11-16 00:04:33,072 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:04:33,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-16 00:04:33,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-11-16 00:04:33,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-16 00:04:33,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-11-16 00:04:33,076 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 23 [2019-11-16 00:04:33,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:33,076 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-11-16 00:04:33,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:04:33,077 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-11-16 00:04:33,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-16 00:04:33,078 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:33,078 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:33,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:33,279 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-16 00:04:33,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:33,279 INFO L82 PathProgramCache]: Analyzing trace with hash 817651018, now seen corresponding path program 3 times [2019-11-16 00:04:33,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:33,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845552654] [2019-11-16 00:04:33,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:33,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:33,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:33,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845552654] [2019-11-16 00:04:33,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853176007] [2019-11-16 00:04:33,378 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c0d5f85-130f-4257-97be-c9197e6c9160/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-11-16 00:04:33,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-16 00:04:33,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:04:33,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:04:33,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:33,446 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:33,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-11-16 00:04:33,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949643853] [2019-11-16 00:04:33,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:04:33,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:33,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:04:33,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:04:33,448 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 9 states. [2019-11-16 00:04:33,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:33,536 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-11-16 00:04:33,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:04:33,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-11-16 00:04:33,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:33,537 INFO L225 Difference]: With dead ends: 39 [2019-11-16 00:04:33,537 INFO L226 Difference]: Without dead ends: 39 [2019-11-16 00:04:33,538 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:04:33,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-16 00:04:33,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-11-16 00:04:33,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-16 00:04:33,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-11-16 00:04:33,540 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 27 [2019-11-16 00:04:33,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:33,540 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-11-16 00:04:33,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:04:33,540 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-11-16 00:04:33,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-16 00:04:33,541 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:33,541 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:33,741 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:33,742 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-16 00:04:33,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:33,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1120001241, now seen corresponding path program 4 times [2019-11-16 00:04:33,742 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:33,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762666963] [2019-11-16 00:04:33,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:33,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:33,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:33,830 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:33,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762666963] [2019-11-16 00:04:33,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267022084] [2019-11-16 00:04:33,831 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c0d5f85-130f-4257-97be-c9197e6c9160/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-11-16 00:04:33,875 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:04:33,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:04:33,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:04:33,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:33,897 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:33,897 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:33,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-11-16 00:04:33,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049077573] [2019-11-16 00:04:33,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:04:33,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:33,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:04:33,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:04:33,899 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 10 states. [2019-11-16 00:04:33,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:33,975 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-11-16 00:04:33,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:04:33,976 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-11-16 00:04:33,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:33,976 INFO L225 Difference]: With dead ends: 43 [2019-11-16 00:04:33,976 INFO L226 Difference]: Without dead ends: 43 [2019-11-16 00:04:33,977 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:04:33,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-16 00:04:33,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-11-16 00:04:33,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-16 00:04:33,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-11-16 00:04:33,980 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 31 [2019-11-16 00:04:33,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:33,981 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-11-16 00:04:33,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:04:33,981 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-11-16 00:04:33,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-16 00:04:33,982 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:33,982 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:34,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:34,186 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-16 00:04:34,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:34,187 INFO L82 PathProgramCache]: Analyzing trace with hash 92254852, now seen corresponding path program 5 times [2019-11-16 00:04:34,187 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:34,187 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313735644] [2019-11-16 00:04:34,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:34,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:34,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:34,290 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:34,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313735644] [2019-11-16 00:04:34,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040276570] [2019-11-16 00:04:34,290 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c0d5f85-130f-4257-97be-c9197e6c9160/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:34,347 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-16 00:04:34,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:04:34,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:04:34,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:34,365 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:34,365 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:34,365 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-16 00:04:34,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146566921] [2019-11-16 00:04:34,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:04:34,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:34,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:04:34,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:04:34,367 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 11 states. [2019-11-16 00:04:34,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:34,434 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-11-16 00:04:34,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:04:34,435 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-11-16 00:04:34,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:34,436 INFO L225 Difference]: With dead ends: 47 [2019-11-16 00:04:34,436 INFO L226 Difference]: Without dead ends: 47 [2019-11-16 00:04:34,436 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:04:34,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-16 00:04:34,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-11-16 00:04:34,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-16 00:04:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-11-16 00:04:34,440 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 35 [2019-11-16 00:04:34,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:34,440 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-11-16 00:04:34,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:04:34,440 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-11-16 00:04:34,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-16 00:04:34,441 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:34,442 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:34,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:34,649 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-16 00:04:34,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:34,649 INFO L82 PathProgramCache]: Analyzing trace with hash 696273761, now seen corresponding path program 6 times [2019-11-16 00:04:34,649 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:34,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481465530] [2019-11-16 00:04:34,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:34,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:34,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:34,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481465530] [2019-11-16 00:04:34,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580711975] [2019-11-16 00:04:34,766 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c0d5f85-130f-4257-97be-c9197e6c9160/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:34,831 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-16 00:04:34,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:04:34,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:04:34,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:34,849 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:34,849 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:34,849 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2019-11-16 00:04:34,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946360698] [2019-11-16 00:04:34,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:04:34,850 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:34,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:04:34,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:04:34,851 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 12 states. [2019-11-16 00:04:34,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:34,938 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-11-16 00:04:34,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:04:34,939 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2019-11-16 00:04:34,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:34,940 INFO L225 Difference]: With dead ends: 51 [2019-11-16 00:04:34,940 INFO L226 Difference]: Without dead ends: 51 [2019-11-16 00:04:34,940 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:04:34,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-16 00:04:34,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-11-16 00:04:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-16 00:04:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-11-16 00:04:34,944 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 39 [2019-11-16 00:04:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:34,944 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-11-16 00:04:34,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:04:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-11-16 00:04:34,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-16 00:04:34,945 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:34,945 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:35,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:35,153 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-16 00:04:35,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:35,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1214304834, now seen corresponding path program 7 times [2019-11-16 00:04:35,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:35,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302887705] [2019-11-16 00:04:35,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:35,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:35,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:35,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302887705] [2019-11-16 00:04:35,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955801778] [2019-11-16 00:04:35,275 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c0d5f85-130f-4257-97be-c9197e6c9160/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:35,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:04:35,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:35,354 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:35,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2019-11-16 00:04:35,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982003797] [2019-11-16 00:04:35,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-16 00:04:35,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:35,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:04:35,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:04:35,356 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 13 states. [2019-11-16 00:04:35,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:35,432 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-11-16 00:04:35,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:04:35,432 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2019-11-16 00:04:35,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:35,433 INFO L225 Difference]: With dead ends: 55 [2019-11-16 00:04:35,433 INFO L226 Difference]: Without dead ends: 55 [2019-11-16 00:04:35,433 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:04:35,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-16 00:04:35,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-11-16 00:04:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-16 00:04:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-11-16 00:04:35,437 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 43 [2019-11-16 00:04:35,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:35,438 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-11-16 00:04:35,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-16 00:04:35,438 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-11-16 00:04:35,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:04:35,439 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:35,439 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:35,639 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:35,640 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-16 00:04:35,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:35,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2090572187, now seen corresponding path program 8 times [2019-11-16 00:04:35,640 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:35,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144187577] [2019-11-16 00:04:35,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:35,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:35,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:35,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144187577] [2019-11-16 00:04:35,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181285094] [2019-11-16 00:04:35,779 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c0d5f85-130f-4257-97be-c9197e6c9160/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:35,836 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:04:35,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:04:35,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:04:35,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:35,854 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:04:35,855 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:04:35,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2019-11-16 00:04:35,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079769924] [2019-11-16 00:04:35,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:04:35,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:35,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:04:35,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:04:35,857 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 14 states. [2019-11-16 00:04:35,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:35,937 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-11-16 00:04:35,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:04:35,937 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2019-11-16 00:04:35,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:35,938 INFO L225 Difference]: With dead ends: 56 [2019-11-16 00:04:35,938 INFO L226 Difference]: Without dead ends: 56 [2019-11-16 00:04:35,939 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:04:35,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-16 00:04:35,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-16 00:04:35,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-16 00:04:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-11-16 00:04:35,943 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 47 [2019-11-16 00:04:35,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:35,943 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-11-16 00:04:35,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:04:35,944 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-11-16 00:04:35,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:04:35,945 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:35,945 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:36,149 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:36,149 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-16 00:04:36,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:36,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1402261240, now seen corresponding path program 9 times [2019-11-16 00:04:36,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:36,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234453465] [2019-11-16 00:04:36,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:36,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:36,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:04:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:04:36,231 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:04:36,234 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:04:36,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:04:36 BoogieIcfgContainer [2019-11-16 00:04:36,296 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:04:36,300 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:04:36,300 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:04:36,300 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:04:36,301 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:04:30" (3/4) ... [2019-11-16 00:04:36,303 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:04:36,372 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4c0d5f85-130f-4257-97be-c9197e6c9160/bin/uautomizer/witness.graphml [2019-11-16 00:04:36,372 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:04:36,374 INFO L168 Benchmark]: Toolchain (without parser) took 6631.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 944.8 MB in the beginning and 930.4 MB in the end (delta: 14.4 MB). Peak memory consumption was 186.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:36,375 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:04:36,376 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 944.8 MB in the beginning and 1.2 GB in the end (delta: -221.4 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:36,376 INFO L168 Benchmark]: Boogie Preprocessor took 34.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:04:36,376 INFO L168 Benchmark]: RCFGBuilder took 300.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:36,377 INFO L168 Benchmark]: TraceAbstraction took 5879.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 932.2 MB in the end (delta: 210.3 MB). Peak memory consumption was 210.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:36,377 INFO L168 Benchmark]: Witness Printer took 72.67 ms. Allocated memory is still 1.2 GB. Free memory was 932.2 MB in the beginning and 930.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:36,379 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 944.8 MB in the beginning and 1.2 GB in the end (delta: -221.4 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 300.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5879.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 932.2 MB in the end (delta: 210.3 MB). Peak memory consumption was 210.3 MB. Max. memory is 11.5 GB. * Witness Printer took 72.67 ms. Allocated memory is still 1.2 GB. Free memory was 932.2 MB in the beginning and 930.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L6] char *p = alloca(10 * sizeof(char)); [L8] int i = 0; VAL [alloca(10 * sizeof(char))={12:0}, i=0, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=0, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=1, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=1, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=2, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=97, alloca(10 * sizeof(char))={12:0}, i=2, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=3, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=3, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=4, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=4, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=5, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=5, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=6, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=6, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=7, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=7, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=8, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=8, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=9, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=9, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=10, p={12:0}] [L8] COND FALSE !(i < 10) VAL [alloca(10 * sizeof(char))={12:0}, i=10, p={12:0}] [L12] EXPR p[2] VAL [alloca(10 * sizeof(char))={12:0}, i=10, p={12:0}, p[2]=97] [L12] COND TRUE p[2] == 'a' [L13] free(p) VAL [alloca(10 * sizeof(char))={12:0}, i=10, p={12:0}] [L13] free(p) VAL [alloca(10 * sizeof(char))={12:0}, i=10, p={12:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 8 error locations. Result: UNSAFE, OverallTime: 5.8s, OverallIterations: 17, TraceHistogramMax: 10, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 243 SDtfs, 235 SDslu, 783 SDs, 0 SdLazy, 697 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 414 GetRequests, 320 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=16, 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, 16 MinimizatonAttempts, 36 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 703 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 626 ConstructedInterpolants, 1 QuantifiedInterpolants, 53253 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1008 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 26 InterpolantComputations, 7 PerfectInterpolantSequences, 9/1065 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...