./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-memsafety/fillarray1.i --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/working_dir_884a0847-603e-41ad-bfcc-cebf1e89e286/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_884a0847-603e-41ad-bfcc-cebf1e89e286/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_884a0847-603e-41ad-bfcc-cebf1e89e286/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_884a0847-603e-41ad-bfcc-cebf1e89e286/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-memsafety/fillarray1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_884a0847-603e-41ad-bfcc-cebf1e89e286/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_884a0847-603e-41ad-bfcc-cebf1e89e286/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cfe359172ad2672387c82471e6d5c8b8ec22ae94 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:25:31,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:25:31,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:25:31,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:25:31,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:25:31,614 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:25:31,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:25:31,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:25:31,617 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:25:31,618 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:25:31,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:25:31,620 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:25:31,620 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:25:31,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:25:31,622 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:25:31,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:25:31,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:25:31,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:25:31,625 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:25:31,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:25:31,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:25:31,629 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:25:31,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:25:31,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:25:31,632 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:25:31,632 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:25:31,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:25:31,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:25:31,633 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:25:31,634 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:25:31,634 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:25:31,635 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:25:31,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:25:31,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:25:31,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:25:31,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:25:31,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:25:31,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:25:31,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:25:31,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:25:31,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:25:31,640 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_884a0847-603e-41ad-bfcc-cebf1e89e286/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-10-22 11:25:31,650 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:25:31,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:25:31,651 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:25:31,652 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:25:31,652 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:25:31,652 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:25:31,652 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:25:31,652 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:25:31,652 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:25:31,653 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:25:31,653 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:25:31,653 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:25:31,653 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:25:31,654 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:25:31,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:25:31,654 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:25:31,654 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:25:31,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:25:31,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:25:31,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:25:31,655 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:25:31,655 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:25:31,656 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:25:31,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:25:31,656 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:25:31,656 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:25:31,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:25:31,656 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:25:31,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:25:31,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:25:31,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:25:31,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:25:31,657 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:25:31,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:25:31,657 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:25:31,658 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_884a0847-603e-41ad-bfcc-cebf1e89e286/bin/utaipan 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 -> Taipan 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 -> cfe359172ad2672387c82471e6d5c8b8ec22ae94 [2019-10-22 11:25:31,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:25:31,692 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:25:31,695 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:25:31,696 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:25:31,697 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:25:31,697 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_884a0847-603e-41ad-bfcc-cebf1e89e286/bin/utaipan/../../sv-benchmarks/c/pthread-memsafety/fillarray1.i [2019-10-22 11:25:31,746 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_884a0847-603e-41ad-bfcc-cebf1e89e286/bin/utaipan/data/d3072bd26/23ee275f977b421796788c801b250ba9/FLAG43bba4cf7 [2019-10-22 11:25:32,266 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:25:32,267 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_884a0847-603e-41ad-bfcc-cebf1e89e286/sv-benchmarks/c/pthread-memsafety/fillarray1.i [2019-10-22 11:25:32,279 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_884a0847-603e-41ad-bfcc-cebf1e89e286/bin/utaipan/data/d3072bd26/23ee275f977b421796788c801b250ba9/FLAG43bba4cf7 [2019-10-22 11:25:32,717 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_884a0847-603e-41ad-bfcc-cebf1e89e286/bin/utaipan/data/d3072bd26/23ee275f977b421796788c801b250ba9 [2019-10-22 11:25:32,721 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:25:32,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:25:32,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:32,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:25:32,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:25:32,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:32" (1/1) ... [2019-10-22 11:25:32,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b293498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:32, skipping insertion in model container [2019-10-22 11:25:32,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:32" (1/1) ... [2019-10-22 11:25:32,739 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:25:32,784 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:25:33,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:33,314 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:25:33,359 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:33,461 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:25:33,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:33 WrapperNode [2019-10-22 11:25:33,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:33,462 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:33,462 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:25:33,462 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:25:33,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:33" (1/1) ... [2019-10-22 11:25:33,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:33" (1/1) ... [2019-10-22 11:25:33,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:33,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:25:33,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:25:33,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:25:33,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:33" (1/1) ... [2019-10-22 11:25:33,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:33" (1/1) ... [2019-10-22 11:25:33,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:33" (1/1) ... [2019-10-22 11:25:33,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:33" (1/1) ... [2019-10-22 11:25:33,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:33" (1/1) ... [2019-10-22 11:25:33,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:33" (1/1) ... [2019-10-22 11:25:33,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:33" (1/1) ... [2019-10-22 11:25:33,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:25:33,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:25:33,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:25:33,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:25:33,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_884a0847-603e-41ad-bfcc-cebf1e89e286/bin/utaipan/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-10-22 11:25:33,641 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-10-22 11:25:33,641 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-10-22 11:25:33,641 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-10-22 11:25:33,644 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-10-22 11:25:33,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:25:33,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:25:33,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:25:33,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:25:33,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:25:33,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:25:33,646 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-10-22 11:25:34,149 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:25:34,149 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 11:25:34,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:34 BoogieIcfgContainer [2019-10-22 11:25:34,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:25:34,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:25:34,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:25:34,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:25:34,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:25:32" (1/3) ... [2019-10-22 11:25:34,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ac2ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:34, skipping insertion in model container [2019-10-22 11:25:34,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:33" (2/3) ... [2019-10-22 11:25:34,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ac2ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:34, skipping insertion in model container [2019-10-22 11:25:34,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:34" (3/3) ... [2019-10-22 11:25:34,159 INFO L109 eAbstractionObserver]: Analyzing ICFG fillarray1.i [2019-10-22 11:25:34,192 WARN L315 ript$VariableManager]: TermVariabe |Thread0_t1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,193 WARN L315 ript$VariableManager]: TermVariabe |Thread0_t1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,193 WARN L315 ript$VariableManager]: TermVariabe Thread0_t1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,193 WARN L315 ript$VariableManager]: TermVariabe Thread0_t1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,193 WARN L315 ript$VariableManager]: TermVariabe Thread0_t1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,194 WARN L315 ript$VariableManager]: TermVariabe Thread0_t1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,194 WARN L315 ript$VariableManager]: TermVariabe Thread0_t1_~a~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,194 WARN L315 ript$VariableManager]: TermVariabe Thread0_t1_~a~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,194 WARN L315 ript$VariableManager]: TermVariabe |Thread0_t1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,195 WARN L315 ript$VariableManager]: TermVariabe |Thread0_t1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,195 WARN L315 ript$VariableManager]: TermVariabe |Thread0_t1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,195 WARN L315 ript$VariableManager]: TermVariabe |Thread0_t1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,195 WARN L315 ript$VariableManager]: TermVariabe Thread0_t1_~a~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,195 WARN L315 ript$VariableManager]: TermVariabe Thread0_t1_~a~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,196 WARN L315 ript$VariableManager]: TermVariabe Thread0_t1_~a~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,196 WARN L315 ript$VariableManager]: TermVariabe Thread0_t1_~a~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,196 WARN L315 ript$VariableManager]: TermVariabe Thread0_t1_~a~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,197 WARN L315 ript$VariableManager]: TermVariabe |Thread1_t2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,197 WARN L315 ript$VariableManager]: TermVariabe |Thread1_t2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,197 WARN L315 ript$VariableManager]: TermVariabe Thread1_t2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,197 WARN L315 ript$VariableManager]: TermVariabe Thread1_t2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,197 WARN L315 ript$VariableManager]: TermVariabe Thread1_t2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,197 WARN L315 ript$VariableManager]: TermVariabe Thread1_t2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,198 WARN L315 ript$VariableManager]: TermVariabe Thread1_t2_~a~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,198 WARN L315 ript$VariableManager]: TermVariabe Thread1_t2_~a~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,198 WARN L315 ript$VariableManager]: TermVariabe |Thread1_t2_#t~pre3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,198 WARN L315 ript$VariableManager]: TermVariabe |Thread1_t2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,198 WARN L315 ript$VariableManager]: TermVariabe |Thread1_t2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,199 WARN L315 ript$VariableManager]: TermVariabe |Thread1_t2_#t~pre3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,200 WARN L315 ript$VariableManager]: TermVariabe Thread1_t2_~a~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,200 WARN L315 ript$VariableManager]: TermVariabe Thread1_t2_~a~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,200 WARN L315 ript$VariableManager]: TermVariabe Thread1_t2_~a~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,200 WARN L315 ript$VariableManager]: TermVariabe Thread1_t2_~a~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,200 WARN L315 ript$VariableManager]: TermVariabe Thread1_t2_~a~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:25:34,210 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:25:34,219 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-10-22 11:25:34,230 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-10-22 11:25:34,250 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:25:34,250 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:25:34,251 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:25:34,251 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:25:34,251 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:25:34,251 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:25:34,251 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:25:34,251 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:25:34,263 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 91 transitions [2019-10-22 11:25:34,522 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4979 states. [2019-10-22 11:25:34,524 INFO L276 IsEmpty]: Start isEmpty. Operand 4979 states. [2019-10-22 11:25:34,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:25:34,531 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:34,532 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:34,534 INFO L410 AbstractCegarLoop]: === Iteration 1 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION]=== [2019-10-22 11:25:34,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:34,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1566992777, now seen corresponding path program 1 times [2019-10-22 11:25:34,548 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:34,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426338658] [2019-10-22 11:25:34,548 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:34,548 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:34,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:34,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:34,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426338658] [2019-10-22 11:25:34,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:34,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:34,725 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251428948] [2019-10-22 11:25:34,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:34,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:34,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:34,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:34,747 INFO L87 Difference]: Start difference. First operand 4979 states. Second operand 3 states. [2019-10-22 11:25:34,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:34,936 INFO L93 Difference]: Finished difference Result 4978 states and 15143 transitions. [2019-10-22 11:25:34,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:34,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-22 11:25:34,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:34,985 INFO L225 Difference]: With dead ends: 4978 [2019-10-22 11:25:34,985 INFO L226 Difference]: Without dead ends: 4908 [2019-10-22 11:25:34,986 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:35,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4908 states. [2019-10-22 11:25:35,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4908 to 4908. [2019-10-22 11:25:35,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4908 states. [2019-10-22 11:25:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4908 states to 4908 states and 14945 transitions. [2019-10-22 11:25:35,281 INFO L78 Accepts]: Start accepts. Automaton has 4908 states and 14945 transitions. Word has length 21 [2019-10-22 11:25:35,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:35,281 INFO L462 AbstractCegarLoop]: Abstraction has 4908 states and 14945 transitions. [2019-10-22 11:25:35,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:35,282 INFO L276 IsEmpty]: Start isEmpty. Operand 4908 states and 14945 transitions. [2019-10-22 11:25:35,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:25:35,282 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:35,282 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:35,283 INFO L410 AbstractCegarLoop]: === Iteration 2 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION]=== [2019-10-22 11:25:35,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:35,284 INFO L82 PathProgramCache]: Analyzing trace with hash 86417596, now seen corresponding path program 1 times [2019-10-22 11:25:35,284 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:35,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826611647] [2019-10-22 11:25:35,284 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:35,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:35,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:35,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:35,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826611647] [2019-10-22 11:25:35,421 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:35,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:35,422 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38869084] [2019-10-22 11:25:35,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:35,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:35,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:35,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:35,425 INFO L87 Difference]: Start difference. First operand 4908 states and 14945 transitions. Second operand 3 states. [2019-10-22 11:25:35,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:35,575 INFO L93 Difference]: Finished difference Result 4907 states and 14944 transitions. [2019-10-22 11:25:35,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:35,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 11:25:35,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:35,601 INFO L225 Difference]: With dead ends: 4907 [2019-10-22 11:25:35,601 INFO L226 Difference]: Without dead ends: 4907 [2019-10-22 11:25:35,602 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-22 11:25:35,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4907 states. [2019-10-22 11:25:35,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4907 to 4907. [2019-10-22 11:25:35,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4907 states. [2019-10-22 11:25:35,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4907 states to 4907 states and 14944 transitions. [2019-10-22 11:25:35,772 INFO L78 Accepts]: Start accepts. Automaton has 4907 states and 14944 transitions. Word has length 25 [2019-10-22 11:25:35,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:35,772 INFO L462 AbstractCegarLoop]: Abstraction has 4907 states and 14944 transitions. [2019-10-22 11:25:35,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:35,773 INFO L276 IsEmpty]: Start isEmpty. Operand 4907 states and 14944 transitions. [2019-10-22 11:25:35,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:25:35,773 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:35,773 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:35,774 INFO L410 AbstractCegarLoop]: === Iteration 3 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION]=== [2019-10-22 11:25:35,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:35,774 INFO L82 PathProgramCache]: Analyzing trace with hash 86417597, now seen corresponding path program 1 times [2019-10-22 11:25:35,774 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:35,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123395672] [2019-10-22 11:25:35,776 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:35,776 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:35,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:35,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:35,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123395672] [2019-10-22 11:25:35,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:35,877 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:35,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62815232] [2019-10-22 11:25:35,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:35,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:35,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:35,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:35,878 INFO L87 Difference]: Start difference. First operand 4907 states and 14944 transitions. Second operand 4 states. [2019-10-22 11:25:36,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:36,097 INFO L93 Difference]: Finished difference Result 4906 states and 14943 transitions. [2019-10-22 11:25:36,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:36,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-10-22 11:25:36,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:36,126 INFO L225 Difference]: With dead ends: 4906 [2019-10-22 11:25:36,126 INFO L226 Difference]: Without dead ends: 4906 [2019-10-22 11:25:36,126 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:36,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4906 states. [2019-10-22 11:25:36,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4906 to 4906. [2019-10-22 11:25:36,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4906 states. [2019-10-22 11:25:36,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4906 states to 4906 states and 14943 transitions. [2019-10-22 11:25:36,271 INFO L78 Accepts]: Start accepts. Automaton has 4906 states and 14943 transitions. Word has length 25 [2019-10-22 11:25:36,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:36,271 INFO L462 AbstractCegarLoop]: Abstraction has 4906 states and 14943 transitions. [2019-10-22 11:25:36,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:36,271 INFO L276 IsEmpty]: Start isEmpty. Operand 4906 states and 14943 transitions. [2019-10-22 11:25:36,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 11:25:36,272 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:36,272 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:36,273 INFO L410 AbstractCegarLoop]: === Iteration 4 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION]=== [2019-10-22 11:25:36,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:36,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1781415990, now seen corresponding path program 1 times [2019-10-22 11:25:36,273 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:36,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557949643] [2019-10-22 11:25:36,273 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:36,274 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:36,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:36,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:36,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557949643] [2019-10-22 11:25:36,316 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:36,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:36,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372229738] [2019-10-22 11:25:36,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:36,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:36,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:36,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:36,317 INFO L87 Difference]: Start difference. First operand 4906 states and 14943 transitions. Second operand 3 states. [2019-10-22 11:25:36,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:36,409 INFO L93 Difference]: Finished difference Result 4890 states and 14910 transitions. [2019-10-22 11:25:36,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:36,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-22 11:25:36,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:36,450 INFO L225 Difference]: With dead ends: 4890 [2019-10-22 11:25:36,451 INFO L226 Difference]: Without dead ends: 4890 [2019-10-22 11:25:36,451 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:36,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4890 states. [2019-10-22 11:25:36,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4890 to 4890. [2019-10-22 11:25:36,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4890 states. [2019-10-22 11:25:36,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4890 states to 4890 states and 14910 transitions. [2019-10-22 11:25:36,603 INFO L78 Accepts]: Start accepts. Automaton has 4890 states and 14910 transitions. Word has length 28 [2019-10-22 11:25:36,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:36,603 INFO L462 AbstractCegarLoop]: Abstraction has 4890 states and 14910 transitions. [2019-10-22 11:25:36,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:36,603 INFO L276 IsEmpty]: Start isEmpty. Operand 4890 states and 14910 transitions. [2019-10-22 11:25:36,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 11:25:36,605 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:36,605 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:36,606 INFO L410 AbstractCegarLoop]: === Iteration 5 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION]=== [2019-10-22 11:25:36,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:36,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1781415991, now seen corresponding path program 1 times [2019-10-22 11:25:36,606 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:36,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011533403] [2019-10-22 11:25:36,608 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:36,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:36,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:36,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:36,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011533403] [2019-10-22 11:25:36,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:36,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:36,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750518740] [2019-10-22 11:25:36,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:36,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:36,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:36,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:36,688 INFO L87 Difference]: Start difference. First operand 4890 states and 14910 transitions. Second operand 3 states. [2019-10-22 11:25:36,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:36,754 INFO L93 Difference]: Finished difference Result 4874 states and 14877 transitions. [2019-10-22 11:25:36,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:36,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-22 11:25:36,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:36,773 INFO L225 Difference]: With dead ends: 4874 [2019-10-22 11:25:36,773 INFO L226 Difference]: Without dead ends: 4874 [2019-10-22 11:25:36,773 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:36,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2019-10-22 11:25:36,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4874. [2019-10-22 11:25:36,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4874 states. [2019-10-22 11:25:36,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 14877 transitions. [2019-10-22 11:25:36,925 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 14877 transitions. Word has length 28 [2019-10-22 11:25:36,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:36,925 INFO L462 AbstractCegarLoop]: Abstraction has 4874 states and 14877 transitions. [2019-10-22 11:25:36,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:36,926 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 14877 transitions. [2019-10-22 11:25:36,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:25:36,926 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:36,927 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:36,927 INFO L410 AbstractCegarLoop]: === Iteration 6 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION]=== [2019-10-22 11:25:36,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:36,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1548074173, now seen corresponding path program 1 times [2019-10-22 11:25:36,927 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:36,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335775344] [2019-10-22 11:25:36,928 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:36,928 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:36,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:36,967 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335775344] [2019-10-22 11:25:36,967 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:36,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:36,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314734731] [2019-10-22 11:25:36,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:36,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:36,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:36,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:36,969 INFO L87 Difference]: Start difference. First operand 4874 states and 14877 transitions. Second operand 4 states. [2019-10-22 11:25:37,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:37,021 INFO L93 Difference]: Finished difference Result 4618 states and 14077 transitions. [2019-10-22 11:25:37,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:37,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-10-22 11:25:37,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:37,039 INFO L225 Difference]: With dead ends: 4618 [2019-10-22 11:25:37,040 INFO L226 Difference]: Without dead ends: 4618 [2019-10-22 11:25:37,040 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:37,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4618 states. [2019-10-22 11:25:37,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4618 to 4618. [2019-10-22 11:25:37,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4618 states. [2019-10-22 11:25:37,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4618 states to 4618 states and 14077 transitions. [2019-10-22 11:25:37,180 INFO L78 Accepts]: Start accepts. Automaton has 4618 states and 14077 transitions. Word has length 31 [2019-10-22 11:25:37,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:37,180 INFO L462 AbstractCegarLoop]: Abstraction has 4618 states and 14077 transitions. [2019-10-22 11:25:37,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:37,181 INFO L276 IsEmpty]: Start isEmpty. Operand 4618 states and 14077 transitions. [2019-10-22 11:25:37,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:25:37,181 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:37,182 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:37,182 INFO L410 AbstractCegarLoop]: === Iteration 7 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION]=== [2019-10-22 11:25:37,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:37,182 INFO L82 PathProgramCache]: Analyzing trace with hash 745659325, now seen corresponding path program 1 times [2019-10-22 11:25:37,182 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:37,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545603434] [2019-10-22 11:25:37,183 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:37,183 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:37,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:37,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:37,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545603434] [2019-10-22 11:25:37,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:37,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:37,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620528175] [2019-10-22 11:25:37,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:37,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:37,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:37,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:37,257 INFO L87 Difference]: Start difference. First operand 4618 states and 14077 transitions. Second operand 4 states. [2019-10-22 11:25:37,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:37,323 INFO L93 Difference]: Finished difference Result 4362 states and 13277 transitions. [2019-10-22 11:25:37,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:37,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-10-22 11:25:37,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:37,339 INFO L225 Difference]: With dead ends: 4362 [2019-10-22 11:25:37,339 INFO L226 Difference]: Without dead ends: 4362 [2019-10-22 11:25:37,339 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:37,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4362 states. [2019-10-22 11:25:37,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4362 to 4362. [2019-10-22 11:25:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4362 states. [2019-10-22 11:25:37,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4362 states to 4362 states and 13277 transitions. [2019-10-22 11:25:37,491 INFO L78 Accepts]: Start accepts. Automaton has 4362 states and 13277 transitions. Word has length 32 [2019-10-22 11:25:37,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:37,492 INFO L462 AbstractCegarLoop]: Abstraction has 4362 states and 13277 transitions. [2019-10-22 11:25:37,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:37,492 INFO L276 IsEmpty]: Start isEmpty. Operand 4362 states and 13277 transitions. [2019-10-22 11:25:37,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 11:25:37,493 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:37,493 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:37,493 INFO L410 AbstractCegarLoop]: === Iteration 8 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION]=== [2019-10-22 11:25:37,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:37,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1640602815, now seen corresponding path program 1 times [2019-10-22 11:25:37,494 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:37,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879513461] [2019-10-22 11:25:37,494 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:37,495 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:37,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:37,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879513461] [2019-10-22 11:25:37,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:37,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:25:37,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948544921] [2019-10-22 11:25:37,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:25:37,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:37,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:25:37,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:25:37,606 INFO L87 Difference]: Start difference. First operand 4362 states and 13277 transitions. Second operand 6 states. [2019-10-22 11:25:37,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:37,729 INFO L93 Difference]: Finished difference Result 4106 states and 12477 transitions. [2019-10-22 11:25:37,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:37,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-10-22 11:25:37,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:37,744 INFO L225 Difference]: With dead ends: 4106 [2019-10-22 11:25:37,745 INFO L226 Difference]: Without dead ends: 4106 [2019-10-22 11:25:37,746 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:37,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2019-10-22 11:25:37,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4106. [2019-10-22 11:25:37,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4106 states. [2019-10-22 11:25:37,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4106 states to 4106 states and 12477 transitions. [2019-10-22 11:25:37,891 INFO L78 Accepts]: Start accepts. Automaton has 4106 states and 12477 transitions. Word has length 33 [2019-10-22 11:25:37,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:37,892 INFO L462 AbstractCegarLoop]: Abstraction has 4106 states and 12477 transitions. [2019-10-22 11:25:37,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:25:37,892 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 12477 transitions. [2019-10-22 11:25:37,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 11:25:37,897 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:37,897 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:37,898 INFO L410 AbstractCegarLoop]: === Iteration 9 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION]=== [2019-10-22 11:25:37,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:37,898 INFO L82 PathProgramCache]: Analyzing trace with hash 2091924402, now seen corresponding path program 1 times [2019-10-22 11:25:37,898 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:37,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863561891] [2019-10-22 11:25:37,899 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:37,899 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:37,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:38,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:38,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863561891] [2019-10-22 11:25:38,013 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:38,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:25:38,014 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202632979] [2019-10-22 11:25:38,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:25:38,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:38,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:25:38,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:25:38,015 INFO L87 Difference]: Start difference. First operand 4106 states and 12477 transitions. Second operand 8 states. [2019-10-22 11:25:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:38,414 INFO L93 Difference]: Finished difference Result 5719 states and 17264 transitions. [2019-10-22 11:25:38,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:25:38,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-10-22 11:25:38,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:38,434 INFO L225 Difference]: With dead ends: 5719 [2019-10-22 11:25:38,434 INFO L226 Difference]: Without dead ends: 5719 [2019-10-22 11:25:38,435 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:25:38,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5719 states. [2019-10-22 11:25:38,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5719 to 4903. [2019-10-22 11:25:38,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4903 states. [2019-10-22 11:25:38,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4903 states to 4903 states and 15177 transitions. [2019-10-22 11:25:38,582 INFO L78 Accepts]: Start accepts. Automaton has 4903 states and 15177 transitions. Word has length 36 [2019-10-22 11:25:38,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:38,583 INFO L462 AbstractCegarLoop]: Abstraction has 4903 states and 15177 transitions. [2019-10-22 11:25:38,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:25:38,583 INFO L276 IsEmpty]: Start isEmpty. Operand 4903 states and 15177 transitions. [2019-10-22 11:25:38,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 11:25:38,585 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:38,585 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:38,585 INFO L410 AbstractCegarLoop]: === Iteration 10 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION]=== [2019-10-22 11:25:38,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:38,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2091924403, now seen corresponding path program 1 times [2019-10-22 11:25:38,586 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:38,586 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748778362] [2019-10-22 11:25:38,586 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:38,586 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:38,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:25:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:25:38,679 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:25:38,680 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:25:38,734 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-10-22 11:25:38,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:25:38 BasicIcfg [2019-10-22 11:25:38,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:25:38,738 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:25:38,738 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:25:38,738 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:25:38,739 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:34" (3/4) ... [2019-10-22 11:25:38,742 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:25:38,839 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_884a0847-603e-41ad-bfcc-cebf1e89e286/bin/utaipan/witness.graphml [2019-10-22 11:25:38,842 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:25:38,845 INFO L168 Benchmark]: Toolchain (without parser) took 6121.70 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 281.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 88.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:38,845 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:25:38,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 738.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -114.9 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:38,846 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:38,846 INFO L168 Benchmark]: Boogie Preprocessor took 37.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:38,854 INFO L168 Benchmark]: RCFGBuilder took 598.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:38,854 INFO L168 Benchmark]: TraceAbstraction took 4585.68 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -119.4 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:38,855 INFO L168 Benchmark]: Witness Printer took 104.80 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:38,857 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 738.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -114.9 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 598.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4585.68 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -119.4 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. * Witness Printer took 104.80 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1049]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1037] 0 int size; VAL [size=0] [L1038] 0 int ind; VAL [ind=0, size=0] [L1039] 0 int j = 2, i = 1; VAL [i=1, ind=0, j=2, size=0] [L1040] 0 int x, y, z; VAL [i=1, ind=0, j=2, size=0, x=0, y=0, z=0] [L1068] 0 size = __VERIFIER_nondet_int() VAL [i=1, ind=0, j=2, size=3, x=0, y=0, z=0] [L1069] COND FALSE 0 !(size < 1 || size > 20) VAL [i=1, ind=0, j=2, size=3, x=0, y=0, z=0] [L1072] 0 int *a = (int *)malloc(size); VAL [i=1, ind=0, j=2, size=3, x=0, y=0, z=0] [L1073] 0 pthread_t id1, id2; VAL [i=1, ind=0, j=2, size=3, x=0, y=0, z=0] [L1074] 0 ind = 0 VAL [i=1, ind=0, j=2, size=3, x=0, y=0, z=0] [L1075] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, a) VAL [arg={5:0}, i=1, ind=0, j=2, size=3, x=0, y=0, z=0] [L1042] 1 x = 1 VAL [arg={5:0}, arg={5:0}, i=1, ind=0, j=2, size=3, x=1, y=0, z=0] [L1043] 1 y = 1 VAL [arg={5:0}, arg={5:0}, i=1, ind=0, j=2, size=3, x=1, y=1, z=0] [L1044] 1 int *a = (int *)arg; VAL [a={5:0}, arg={5:0}, arg={5:0}, i=1, ind=0, j=2, size=3, x=1, y=1, z=0] [L1045] COND FALSE 1 !(y == 1 && z) VAL [a={5:0}, arg={5:0}, arg={5:0}, i=1, ind=0, j=2, size=3, x=1, y=1, z=0] [L1047] COND TRUE 1 ind < size - 1 VAL [a={5:0}, arg={5:0}, arg={5:0}, i=1, ind=0, j=2, size=3, x=1, y=1, z=0] [L1048] 1 ++ind VAL [a={5:0}, arg={5:0}, arg={5:0}, i=1, ind=1, j=2, size=3, x=1, y=1, z=0] [L1049] 1 a[ind] = i - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 117 locations, 16 error locations. Result: UNSAFE, OverallTime: 4.4s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 713 SDtfs, 916 SDslu, 879 SDs, 0 SdLazy, 374 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4979occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 816 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 295 NumberOfCodeBlocks, 295 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 17660 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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...