./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-memsafety/fillarray_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a5728a36-abda-4577-821b-a90314740a0a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a5728a36-abda-4577-821b-a90314740a0a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a5728a36-abda-4577-821b-a90314740a0a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a5728a36-abda-4577-821b-a90314740a0a/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-memsafety/fillarray_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a5728a36-abda-4577-821b-a90314740a0a/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a5728a36-abda-4577-821b-a90314740a0a/bin-2019/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 317acdded5b2f05710e753bf8fd3c2308f1aec62 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.23-635dfa2 [2018-12-09 17:54:09,842 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 17:54:09,843 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 17:54:09,849 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 17:54:09,849 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 17:54:09,849 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 17:54:09,850 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 17:54:09,851 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 17:54:09,852 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 17:54:09,852 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 17:54:09,852 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 17:54:09,852 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 17:54:09,853 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 17:54:09,853 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 17:54:09,854 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 17:54:09,854 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 17:54:09,855 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 17:54:09,855 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 17:54:09,856 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 17:54:09,857 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 17:54:09,858 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 17:54:09,858 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 17:54:09,859 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 17:54:09,859 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 17:54:09,860 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 17:54:09,860 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 17:54:09,861 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 17:54:09,861 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 17:54:09,861 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 17:54:09,862 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 17:54:09,862 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 17:54:09,862 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 17:54:09,862 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 17:54:09,863 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 17:54:09,863 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 17:54:09,863 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 17:54:09,863 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a5728a36-abda-4577-821b-a90314740a0a/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 17:54:09,871 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 17:54:09,871 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 17:54:09,871 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 17:54:09,872 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 17:54:09,872 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 17:54:09,872 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 17:54:09,872 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 17:54:09,872 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 17:54:09,872 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 17:54:09,872 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 17:54:09,872 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 17:54:09,872 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 17:54:09,872 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 17:54:09,873 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 17:54:09,873 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 17:54:09,873 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 17:54:09,873 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 17:54:09,873 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 17:54:09,873 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 17:54:09,873 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 17:54:09,873 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 17:54:09,873 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 17:54:09,873 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 17:54:09,874 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 17:54:09,874 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 17:54:09,874 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 17:54:09,874 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 17:54:09,874 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 17:54:09,874 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 17:54:09,874 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 17:54:09,874 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 17:54:09,874 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 17:54:09,874 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 17:54:09,875 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 17:54:09,875 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 17:54:09,875 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 17:54:09,875 INFO L133 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_a5728a36-abda-4577-821b-a90314740a0a/bin-2019/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 -> 317acdded5b2f05710e753bf8fd3c2308f1aec62 [2018-12-09 17:54:09,892 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 17:54:09,898 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 17:54:09,900 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 17:54:09,901 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 17:54:09,901 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 17:54:09,902 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a5728a36-abda-4577-821b-a90314740a0a/bin-2019/utaipan/../../sv-benchmarks/c/pthread-memsafety/fillarray_false-valid-deref.i [2018-12-09 17:54:09,937 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a5728a36-abda-4577-821b-a90314740a0a/bin-2019/utaipan/data/fcd8c4cdd/0e8a17594116425bb39c73d345a4d3cd/FLAGa5d3af63b [2018-12-09 17:54:10,380 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 17:54:10,381 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a5728a36-abda-4577-821b-a90314740a0a/sv-benchmarks/c/pthread-memsafety/fillarray_false-valid-deref.i [2018-12-09 17:54:10,391 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a5728a36-abda-4577-821b-a90314740a0a/bin-2019/utaipan/data/fcd8c4cdd/0e8a17594116425bb39c73d345a4d3cd/FLAGa5d3af63b [2018-12-09 17:54:10,399 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a5728a36-abda-4577-821b-a90314740a0a/bin-2019/utaipan/data/fcd8c4cdd/0e8a17594116425bb39c73d345a4d3cd [2018-12-09 17:54:10,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 17:54:10,402 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 17:54:10,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 17:54:10,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 17:54:10,405 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 17:54:10,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:54:10" (1/1) ... [2018-12-09 17:54:10,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56412a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:10, skipping insertion in model container [2018-12-09 17:54:10,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:54:10" (1/1) ... [2018-12-09 17:54:10,414 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 17:54:10,439 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 17:54:10,685 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 17:54:10,691 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 17:54:10,723 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 17:54:10,784 INFO L195 MainTranslator]: Completed translation [2018-12-09 17:54:10,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:10 WrapperNode [2018-12-09 17:54:10,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 17:54:10,785 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 17:54:10,785 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 17:54:10,785 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 17:54:10,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:10" (1/1) ... [2018-12-09 17:54:10,800 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:10" (1/1) ... [2018-12-09 17:54:10,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 17:54:10,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 17:54:10,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 17:54:10,812 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 17:54:10,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:10" (1/1) ... [2018-12-09 17:54:10,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:10" (1/1) ... [2018-12-09 17:54:10,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:10" (1/1) ... [2018-12-09 17:54:10,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:10" (1/1) ... [2018-12-09 17:54:10,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:10" (1/1) ... [2018-12-09 17:54:10,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:10" (1/1) ... [2018-12-09 17:54:10,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:10" (1/1) ... [2018-12-09 17:54:10,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 17:54:10,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 17:54:10,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 17:54:10,827 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 17:54:10,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5728a36-abda-4577-821b-a90314740a0a/bin-2019/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 [2018-12-09 17:54:10,858 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2018-12-09 17:54:10,858 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2018-12-09 17:54:10,858 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2018-12-09 17:54:10,858 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2018-12-09 17:54:10,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 17:54:10,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 17:54:10,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 17:54:10,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 17:54:10,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 17:54:10,859 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 17:54:11,039 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 17:54:11,039 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-09 17:54:11,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:54:11 BoogieIcfgContainer [2018-12-09 17:54:11,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 17:54:11,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 17:54:11,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 17:54:11,042 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 17:54:11,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:54:10" (1/3) ... [2018-12-09 17:54:11,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a8b83f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:54:11, skipping insertion in model container [2018-12-09 17:54:11,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:10" (2/3) ... [2018-12-09 17:54:11,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a8b83f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:54:11, skipping insertion in model container [2018-12-09 17:54:11,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:54:11" (3/3) ... [2018-12-09 17:54:11,044 INFO L112 eAbstractionObserver]: Analyzing ICFG fillarray_false-valid-deref.i [2018-12-09 17:54:11,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,063 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,063 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,063 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,063 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,063 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~a~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,063 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~a~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,064 WARN L317 ript$VariableManager]: TermVariabe |Thread1_t1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,064 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~a~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,064 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~a~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,064 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~a~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,064 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~a~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,064 WARN L317 ript$VariableManager]: TermVariabe Thread1_t1_~a~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,064 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,064 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,064 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,065 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,065 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,065 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,065 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~a~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,065 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~a~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,065 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,065 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,065 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#t~pre3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,065 WARN L317 ript$VariableManager]: TermVariabe |Thread0_t2_#t~pre3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,065 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~a~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,066 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~a~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,066 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~a~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,066 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~a~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,066 WARN L317 ript$VariableManager]: TermVariabe Thread0_t2_~a~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:54:11,072 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 17:54:11,077 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-09 17:54:11,086 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-09 17:54:11,100 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 17:54:11,100 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 17:54:11,100 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 17:54:11,101 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 17:54:11,101 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 17:54:11,101 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 17:54:11,101 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 17:54:11,101 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 17:54:11,106 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 72places, 74 transitions [2018-12-09 17:54:11,163 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2540 states. [2018-12-09 17:54:11,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states. [2018-12-09 17:54:11,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 17:54:11,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:54:11,170 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:54:11,171 INFO L423 AbstractCegarLoop]: === Iteration 1 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-09 17:54:11,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:54:11,175 INFO L82 PathProgramCache]: Analyzing trace with hash -635543380, now seen corresponding path program 1 times [2018-12-09 17:54:11,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:54:11,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:11,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:54:11,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:11,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:54:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:54:11,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:54:11,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:54:11,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 17:54:11,281 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:54:11,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:54:11,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:54:11,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:54:11,293 INFO L87 Difference]: Start difference. First operand 2540 states. Second operand 3 states. [2018-12-09 17:54:11,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:54:11,362 INFO L93 Difference]: Finished difference Result 2539 states and 7351 transitions. [2018-12-09 17:54:11,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:54:11,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-09 17:54:11,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:54:11,380 INFO L225 Difference]: With dead ends: 2539 [2018-12-09 17:54:11,380 INFO L226 Difference]: Without dead ends: 2497 [2018-12-09 17:54:11,381 INFO L631 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 [2018-12-09 17:54:11,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2497 states. [2018-12-09 17:54:11,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2497 to 2497. [2018-12-09 17:54:11,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2497 states. [2018-12-09 17:54:11,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2497 states to 2497 states and 7237 transitions. [2018-12-09 17:54:11,467 INFO L78 Accepts]: Start accepts. Automaton has 2497 states and 7237 transitions. Word has length 18 [2018-12-09 17:54:11,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:54:11,467 INFO L480 AbstractCegarLoop]: Abstraction has 2497 states and 7237 transitions. [2018-12-09 17:54:11,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:54:11,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2497 states and 7237 transitions. [2018-12-09 17:54:11,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 17:54:11,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:54:11,468 INFO L402 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] [2018-12-09 17:54:11,468 INFO L423 AbstractCegarLoop]: === Iteration 2 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-09 17:54:11,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:54:11,469 INFO L82 PathProgramCache]: Analyzing trace with hash -66291374, now seen corresponding path program 1 times [2018-12-09 17:54:11,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:54:11,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:11,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:54:11,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:11,473 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:54:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:54:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:54:11,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:54:11,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 17:54:11,524 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:54:11,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:54:11,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:54:11,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:54:11,526 INFO L87 Difference]: Start difference. First operand 2497 states and 7237 transitions. Second operand 3 states. [2018-12-09 17:54:11,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:54:11,579 INFO L93 Difference]: Finished difference Result 2496 states and 7236 transitions. [2018-12-09 17:54:11,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:54:11,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 17:54:11,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:54:11,587 INFO L225 Difference]: With dead ends: 2496 [2018-12-09 17:54:11,587 INFO L226 Difference]: Without dead ends: 2496 [2018-12-09 17:54:11,588 INFO L631 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 [2018-12-09 17:54:11,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2018-12-09 17:54:11,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2496. [2018-12-09 17:54:11,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2496 states. [2018-12-09 17:54:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 7236 transitions. [2018-12-09 17:54:11,634 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 7236 transitions. Word has length 22 [2018-12-09 17:54:11,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:54:11,634 INFO L480 AbstractCegarLoop]: Abstraction has 2496 states and 7236 transitions. [2018-12-09 17:54:11,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:54:11,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 7236 transitions. [2018-12-09 17:54:11,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 17:54:11,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:54:11,635 INFO L402 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] [2018-12-09 17:54:11,635 INFO L423 AbstractCegarLoop]: === Iteration 3 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-09 17:54:11,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:54:11,635 INFO L82 PathProgramCache]: Analyzing trace with hash -66291373, now seen corresponding path program 1 times [2018-12-09 17:54:11,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:54:11,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:11,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:54:11,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:11,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:54:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:54:11,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:54:11,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:54:11,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:54:11,688 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:54:11,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:54:11,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:54:11,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:54:11,689 INFO L87 Difference]: Start difference. First operand 2496 states and 7236 transitions. Second operand 4 states. [2018-12-09 17:54:11,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:54:11,754 INFO L93 Difference]: Finished difference Result 2495 states and 7235 transitions. [2018-12-09 17:54:11,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 17:54:11,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-09 17:54:11,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:54:11,765 INFO L225 Difference]: With dead ends: 2495 [2018-12-09 17:54:11,766 INFO L226 Difference]: Without dead ends: 2495 [2018-12-09 17:54:11,766 INFO L631 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 [2018-12-09 17:54:11,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2018-12-09 17:54:11,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2495. [2018-12-09 17:54:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2495 states. [2018-12-09 17:54:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 7235 transitions. [2018-12-09 17:54:11,812 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 7235 transitions. Word has length 22 [2018-12-09 17:54:11,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:54:11,812 INFO L480 AbstractCegarLoop]: Abstraction has 2495 states and 7235 transitions. [2018-12-09 17:54:11,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:54:11,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 7235 transitions. [2018-12-09 17:54:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 17:54:11,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:54:11,813 INFO L402 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] [2018-12-09 17:54:11,813 INFO L423 AbstractCegarLoop]: === Iteration 4 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-09 17:54:11,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:54:11,813 INFO L82 PathProgramCache]: Analyzing trace with hash 798797317, now seen corresponding path program 1 times [2018-12-09 17:54:11,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:54:11,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:11,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:54:11,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:11,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:54:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:54:11,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:54:11,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:54:11,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 17:54:11,845 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:54:11,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:54:11,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:54:11,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:54:11,846 INFO L87 Difference]: Start difference. First operand 2495 states and 7235 transitions. Second operand 3 states. [2018-12-09 17:54:11,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:54:11,903 INFO L93 Difference]: Finished difference Result 2483 states and 7211 transitions. [2018-12-09 17:54:11,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:54:11,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 17:54:11,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:54:11,913 INFO L225 Difference]: With dead ends: 2483 [2018-12-09 17:54:11,913 INFO L226 Difference]: Without dead ends: 2483 [2018-12-09 17:54:11,913 INFO L631 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 [2018-12-09 17:54:11,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2018-12-09 17:54:11,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2483. [2018-12-09 17:54:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2483 states. [2018-12-09 17:54:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 7211 transitions. [2018-12-09 17:54:11,955 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 7211 transitions. Word has length 25 [2018-12-09 17:54:11,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:54:11,955 INFO L480 AbstractCegarLoop]: Abstraction has 2483 states and 7211 transitions. [2018-12-09 17:54:11,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:54:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 7211 transitions. [2018-12-09 17:54:11,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 17:54:11,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:54:11,956 INFO L402 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] [2018-12-09 17:54:11,956 INFO L423 AbstractCegarLoop]: === Iteration 5 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-09 17:54:11,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:54:11,957 INFO L82 PathProgramCache]: Analyzing trace with hash 798797318, now seen corresponding path program 1 times [2018-12-09 17:54:11,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:54:11,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:11,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:54:11,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:11,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:54:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:54:11,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:54:11,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:54:11,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 17:54:11,980 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:54:11,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:54:11,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:54:11,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:54:11,981 INFO L87 Difference]: Start difference. First operand 2483 states and 7211 transitions. Second operand 3 states. [2018-12-09 17:54:12,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:54:12,009 INFO L93 Difference]: Finished difference Result 2471 states and 7187 transitions. [2018-12-09 17:54:12,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:54:12,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 17:54:12,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:54:12,017 INFO L225 Difference]: With dead ends: 2471 [2018-12-09 17:54:12,017 INFO L226 Difference]: Without dead ends: 2471 [2018-12-09 17:54:12,017 INFO L631 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 [2018-12-09 17:54:12,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2018-12-09 17:54:12,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2471. [2018-12-09 17:54:12,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2471 states. [2018-12-09 17:54:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 7187 transitions. [2018-12-09 17:54:12,058 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 7187 transitions. Word has length 25 [2018-12-09 17:54:12,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:54:12,058 INFO L480 AbstractCegarLoop]: Abstraction has 2471 states and 7187 transitions. [2018-12-09 17:54:12,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:54:12,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 7187 transitions. [2018-12-09 17:54:12,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 17:54:12,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:54:12,059 INFO L402 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] [2018-12-09 17:54:12,059 INFO L423 AbstractCegarLoop]: === Iteration 6 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-09 17:54:12,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:54:12,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1442752698, now seen corresponding path program 1 times [2018-12-09 17:54:12,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:54:12,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:12,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:54:12,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:12,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:54:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:54:12,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:54:12,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:54:12,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:54:12,083 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:54:12,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:54:12,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:54:12,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:54:12,084 INFO L87 Difference]: Start difference. First operand 2471 states and 7187 transitions. Second operand 4 states. [2018-12-09 17:54:12,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:54:12,103 INFO L93 Difference]: Finished difference Result 2327 states and 6755 transitions. [2018-12-09 17:54:12,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 17:54:12,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-12-09 17:54:12,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:54:12,111 INFO L225 Difference]: With dead ends: 2327 [2018-12-09 17:54:12,111 INFO L226 Difference]: Without dead ends: 2327 [2018-12-09 17:54:12,111 INFO L631 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 [2018-12-09 17:54:12,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2327 states. [2018-12-09 17:54:12,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2327 to 2327. [2018-12-09 17:54:12,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2327 states. [2018-12-09 17:54:12,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 6755 transitions. [2018-12-09 17:54:12,145 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 6755 transitions. Word has length 28 [2018-12-09 17:54:12,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:54:12,146 INFO L480 AbstractCegarLoop]: Abstraction has 2327 states and 6755 transitions. [2018-12-09 17:54:12,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:54:12,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 6755 transitions. [2018-12-09 17:54:12,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 17:54:12,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:54:12,147 INFO L402 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] [2018-12-09 17:54:12,147 INFO L423 AbstractCegarLoop]: === Iteration 7 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-09 17:54:12,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:54:12,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1775660498, now seen corresponding path program 1 times [2018-12-09 17:54:12,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:54:12,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:12,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:54:12,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:12,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:54:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:54:12,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:54:12,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:54:12,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:54:12,215 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:54:12,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 17:54:12,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 17:54:12,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:54:12,216 INFO L87 Difference]: Start difference. First operand 2327 states and 6755 transitions. Second operand 7 states. [2018-12-09 17:54:12,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:54:12,274 INFO L93 Difference]: Finished difference Result 2183 states and 6323 transitions. [2018-12-09 17:54:12,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 17:54:12,275 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-12-09 17:54:12,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:54:12,280 INFO L225 Difference]: With dead ends: 2183 [2018-12-09 17:54:12,280 INFO L226 Difference]: Without dead ends: 2183 [2018-12-09 17:54:12,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-09 17:54:12,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2018-12-09 17:54:12,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 2183. [2018-12-09 17:54:12,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2183 states. [2018-12-09 17:54:12,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 6323 transitions. [2018-12-09 17:54:12,303 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 6323 transitions. Word has length 29 [2018-12-09 17:54:12,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:54:12,304 INFO L480 AbstractCegarLoop]: Abstraction has 2183 states and 6323 transitions. [2018-12-09 17:54:12,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 17:54:12,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 6323 transitions. [2018-12-09 17:54:12,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 17:54:12,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:54:12,304 INFO L402 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] [2018-12-09 17:54:12,304 INFO L423 AbstractCegarLoop]: === Iteration 8 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-09 17:54:12,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:54:12,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1335077213, now seen corresponding path program 1 times [2018-12-09 17:54:12,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:54:12,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:12,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:54:12,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:12,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:54:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:54:12,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:54:12,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:54:12,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 17:54:12,347 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:54:12,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 17:54:12,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 17:54:12,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 17:54:12,347 INFO L87 Difference]: Start difference. First operand 2183 states and 6323 transitions. Second operand 8 states. [2018-12-09 17:54:12,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:54:12,502 INFO L93 Difference]: Finished difference Result 3284 states and 9521 transitions. [2018-12-09 17:54:12,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 17:54:12,502 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-12-09 17:54:12,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:54:12,509 INFO L225 Difference]: With dead ends: 3284 [2018-12-09 17:54:12,509 INFO L226 Difference]: Without dead ends: 3284 [2018-12-09 17:54:12,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-12-09 17:54:12,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3284 states. [2018-12-09 17:54:12,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3284 to 2792. [2018-12-09 17:54:12,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2792 states. [2018-12-09 17:54:12,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2792 states and 8345 transitions. [2018-12-09 17:54:12,547 INFO L78 Accepts]: Start accepts. Automaton has 2792 states and 8345 transitions. Word has length 30 [2018-12-09 17:54:12,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:54:12,547 INFO L480 AbstractCegarLoop]: Abstraction has 2792 states and 8345 transitions. [2018-12-09 17:54:12,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 17:54:12,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 8345 transitions. [2018-12-09 17:54:12,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 17:54:12,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:54:12,548 INFO L402 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] [2018-12-09 17:54:12,548 INFO L423 AbstractCegarLoop]: === Iteration 9 === [t1Err1REQUIRES_VIOLATION, t1Err0REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, t1Err0REQUIRES_VIOLATION, t1Err1REQUIRES_VIOLATION, t2Err1REQUIRES_VIOLATION, t2Err0REQUIRES_VIOLATION]=== [2018-12-09 17:54:12,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:54:12,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1335077214, now seen corresponding path program 1 times [2018-12-09 17:54:12,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:54:12,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:12,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:54:12,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:12,550 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:54:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 17:54:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 17:54:12,582 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 17:54:12,605 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 17:54:12,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:54:12 BasicIcfg [2018-12-09 17:54:12,606 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 17:54:12,607 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 17:54:12,607 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 17:54:12,607 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 17:54:12,607 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:54:11" (3/4) ... [2018-12-09 17:54:12,608 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 17:54:12,640 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a5728a36-abda-4577-821b-a90314740a0a/bin-2019/utaipan/witness.graphml [2018-12-09 17:54:12,640 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 17:54:12,641 INFO L168 Benchmark]: Toolchain (without parser) took 2239.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 948.1 MB in the beginning and 829.0 MB in the end (delta: 119.1 MB). Peak memory consumption was 223.9 MB. Max. memory is 11.5 GB. [2018-12-09 17:54:12,642 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 17:54:12,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -116.0 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2018-12-09 17:54:12,642 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.73 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 17:54:12,643 INFO L168 Benchmark]: Boogie Preprocessor took 15.09 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 17:54:12,643 INFO L168 Benchmark]: RCFGBuilder took 212.43 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2018-12-09 17:54:12,643 INFO L168 Benchmark]: TraceAbstraction took 1566.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 835.9 MB in the end (delta: 195.0 MB). Peak memory consumption was 195.0 MB. Max. memory is 11.5 GB. [2018-12-09 17:54:12,644 INFO L168 Benchmark]: Witness Printer took 33.98 ms. Allocated memory is still 1.1 GB. Free memory was 832.5 MB in the beginning and 829.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-09 17:54:12,645 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 382.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -116.0 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.73 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.09 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 212.43 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1566.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 835.9 MB in the end (delta: 195.0 MB). Peak memory consumption was 195.0 MB. Max. memory is 11.5 GB. * Witness Printer took 33.98 ms. Allocated memory is still 1.1 GB. Free memory was 832.5 MB in the beginning and 829.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1044]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1037] -1 int size; VAL [size=0] [L1038] -1 int ind; VAL [ind=0, size=0] [L1039] -1 int j = 2, i = 1; VAL [i=1, ind=0, j=2, size=0] [L1057] -1 size = __VERIFIER_nondet_int() VAL [i=1, ind=0, j=2, size=2] [L1058] COND FALSE -1 !(size < 1 || size > 20) VAL [i=1, ind=0, j=2, size=2] [L1061] -1 int *a = (int *)malloc(size); VAL [i=1, ind=0, j=2, size=2] [L1062] -1 pthread_t id1, id2; VAL [i=1, ind=0, j=2, size=2] [L1063] -1 ind = 0 VAL [i=1, ind=0, j=2, size=2] [L1064] FCALL, FORK -1 pthread_create(&id1, ((void *)0), t1, a) VAL [arg={6:0}, i=1, ind=0, j=2, size=2] [L1041] 0 int *a = (int *)arg; VAL [a={6:0}, arg={6:0}, arg={6:0}, i=1, ind=0, j=2, size=2] [L1042] COND TRUE 0 ind < size - 1 VAL [a={6:0}, arg={6:0}, arg={6:0}, i=1, ind=0, j=2, size=2] [L1043] 0 ++ind VAL [a={6:0}, arg={6:0}, arg={6:0}, i=1, ind=1, j=2, size=2] [L1044] 0 a[ind] = i - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 96 locations, 15 error locations. UNSAFE Result, 1.5s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 507 SDtfs, 549 SDslu, 768 SDs, 0 SdLazy, 413 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2792occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 492 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 11986 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...