./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6b4703a8-e852-4308-af3b-60cfb92bc299/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6b4703a8-e852-4308-af3b-60cfb92bc299/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6b4703a8-e852-4308-af3b-60cfb92bc299/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6b4703a8-e852-4308-af3b-60cfb92bc299/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6b4703a8-e852-4308-af3b-60cfb92bc299/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6b4703a8-e852-4308-af3b-60cfb92bc299/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 97fe3d28a1849ecc88958d9d302f4fb4c5dbb992 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:54:33,072 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:54:33,073 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:54:33,079 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:54:33,079 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:54:33,080 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:54:33,081 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:54:33,082 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:54:33,083 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:54:33,083 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:54:33,084 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:54:33,084 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:54:33,085 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:54:33,085 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:54:33,086 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:54:33,086 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:54:33,087 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:54:33,087 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:54:33,089 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:54:33,090 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:54:33,091 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:54:33,092 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:54:33,093 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:54:33,093 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:54:33,094 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:54:33,094 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:54:33,095 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:54:33,095 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:54:33,096 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:54:33,097 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:54:33,097 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:54:33,097 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:54:33,098 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:54:33,098 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:54:33,098 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:54:33,099 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:54:33,099 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6b4703a8-e852-4308-af3b-60cfb92bc299/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-10 12:54:33,106 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:54:33,106 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:54:33,107 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:54:33,107 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 12:54:33,107 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 12:54:33,107 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 12:54:33,107 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 12:54:33,107 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 12:54:33,108 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 12:54:33,108 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 12:54:33,108 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 12:54:33,108 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:54:33,108 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:54:33,109 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:54:33,109 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:54:33,109 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:54:33,109 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:54:33,109 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:54:33,109 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:54:33,109 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-10 12:54:33,109 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-10 12:54:33,110 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-10 12:54:33,110 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:54:33,110 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:54:33,110 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:54:33,110 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:54:33,110 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:54:33,110 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:54:33,111 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:54:33,111 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:54:33,111 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:54:33,111 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 12:54:33,111 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:54:33,111 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:54:33,111 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_6b4703a8-e852-4308-af3b-60cfb92bc299/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 -> 97fe3d28a1849ecc88958d9d302f4fb4c5dbb992 [2018-11-10 12:54:33,135 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:54:33,144 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:54:33,146 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:54:33,147 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:54:33,148 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:54:33,148 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6b4703a8-e852-4308-af3b-60cfb92bc299/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-11-10 12:54:33,192 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6b4703a8-e852-4308-af3b-60cfb92bc299/bin-2019/utaipan/data/35c14be68/68a219f9420348739c8bda0a521910a0/FLAGe917e751f [2018-11-10 12:54:33,593 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:54:33,593 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6b4703a8-e852-4308-af3b-60cfb92bc299/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-11-10 12:54:33,598 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6b4703a8-e852-4308-af3b-60cfb92bc299/bin-2019/utaipan/data/35c14be68/68a219f9420348739c8bda0a521910a0/FLAGe917e751f [2018-11-10 12:54:33,608 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6b4703a8-e852-4308-af3b-60cfb92bc299/bin-2019/utaipan/data/35c14be68/68a219f9420348739c8bda0a521910a0 [2018-11-10 12:54:33,611 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:54:33,611 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:54:33,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:54:33,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:54:33,615 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:54:33,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:54:33" (1/1) ... [2018-11-10 12:54:33,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21f93067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:33, skipping insertion in model container [2018-11-10 12:54:33,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:54:33" (1/1) ... [2018-11-10 12:54:33,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:54:33,639 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:54:33,737 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:54:33,744 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:54:33,753 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:54:33,763 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:54:33,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:33 WrapperNode [2018-11-10 12:54:33,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:54:33,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:54:33,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:54:33,764 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:54:33,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:33" (1/1) ... [2018-11-10 12:54:33,774 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:33" (1/1) ... [2018-11-10 12:54:33,788 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:54:33,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:54:33,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:54:33,788 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:54:33,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:33" (1/1) ... [2018-11-10 12:54:33,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:33" (1/1) ... [2018-11-10 12:54:33,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:33" (1/1) ... [2018-11-10 12:54:33,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:33" (1/1) ... [2018-11-10 12:54:33,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:33" (1/1) ... [2018-11-10 12:54:33,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:33" (1/1) ... [2018-11-10 12:54:33,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:33" (1/1) ... [2018-11-10 12:54:33,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:54:33,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:54:33,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:54:33,807 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:54:33,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b4703a8-e852-4308-af3b-60cfb92bc299/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-11-10 12:54:33,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:54:33,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:54:33,879 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-10 12:54:33,880 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-10 12:54:33,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:54:33,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:54:33,880 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:54:33,880 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:54:34,071 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:54:34,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:54:34 BoogieIcfgContainer [2018-11-10 12:54:34,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:54:34,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:54:34,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:54:34,074 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:54:34,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:54:33" (1/3) ... [2018-11-10 12:54:34,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e45b628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:54:34, skipping insertion in model container [2018-11-10 12:54:34,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:33" (2/3) ... [2018-11-10 12:54:34,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e45b628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:54:34, skipping insertion in model container [2018-11-10 12:54:34,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:54:34" (3/3) ... [2018-11-10 12:54:34,077 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-11-10 12:54:34,085 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:54:34,090 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-10 12:54:34,104 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-10 12:54:34,123 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:54:34,123 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-10 12:54:34,123 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:54:34,123 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:54:34,124 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:54:34,124 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:54:34,124 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:54:34,124 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:54:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-10 12:54:34,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 12:54:34,138 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:54:34,138 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:54:34,139 INFO L424 AbstractCegarLoop]: === Iteration 1 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 12:54:34,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:34,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1864571930, now seen corresponding path program 1 times [2018-11-10 12:54:34,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:54:34,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:34,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:34,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:34,180 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:54:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:34,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:54:34,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:54:34,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:54:34,237 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:54:34,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 12:54:34,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 12:54:34,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 12:54:34,249 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-11-10 12:54:34,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:54:34,259 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-10 12:54:34,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 12:54:34,260 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-10 12:54:34,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:54:34,267 INFO L225 Difference]: With dead ends: 44 [2018-11-10 12:54:34,267 INFO L226 Difference]: Without dead ends: 41 [2018-11-10 12:54:34,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 12:54:34,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-10 12:54:34,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-10 12:54:34,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 12:54:34,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-11-10 12:54:34,293 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 11 [2018-11-10 12:54:34,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:54:34,293 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-11-10 12:54:34,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 12:54:34,294 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-11-10 12:54:34,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 12:54:34,294 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:54:34,294 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:54:34,295 INFO L424 AbstractCegarLoop]: === Iteration 2 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 12:54:34,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:34,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1885321814, now seen corresponding path program 1 times [2018-11-10 12:54:34,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:54:34,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:34,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:34,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:34,296 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:54:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:34,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:54:34,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:54:34,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:54:34,338 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:54:34,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:54:34,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:54:34,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:54:34,340 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 3 states. [2018-11-10 12:54:34,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:54:34,380 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-10 12:54:34,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:54:34,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-10 12:54:34,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:54:34,383 INFO L225 Difference]: With dead ends: 61 [2018-11-10 12:54:34,383 INFO L226 Difference]: Without dead ends: 61 [2018-11-10 12:54:34,383 INFO L605 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-11-10 12:54:34,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-10 12:54:34,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 45. [2018-11-10 12:54:34,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 12:54:34,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-10 12:54:34,389 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 12 [2018-11-10 12:54:34,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:54:34,389 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-10 12:54:34,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:54:34,390 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-10 12:54:34,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 12:54:34,390 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:54:34,390 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:54:34,390 INFO L424 AbstractCegarLoop]: === Iteration 3 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 12:54:34,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:34,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1599325725, now seen corresponding path program 1 times [2018-11-10 12:54:34,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:54:34,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:34,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:34,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:34,392 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:54:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:34,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:54:34,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:54:34,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:54:34,420 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:54:34,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:54:34,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:54:34,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:54:34,421 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 3 states. [2018-11-10 12:54:34,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:54:34,446 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-11-10 12:54:34,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:54:34,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-10 12:54:34,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:54:34,448 INFO L225 Difference]: With dead ends: 56 [2018-11-10 12:54:34,449 INFO L226 Difference]: Without dead ends: 56 [2018-11-10 12:54:34,449 INFO L605 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-11-10 12:54:34,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-10 12:54:34,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2018-11-10 12:54:34,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 12:54:34,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-10 12:54:34,454 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 13 [2018-11-10 12:54:34,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:54:34,454 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-10 12:54:34,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:54:34,455 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-10 12:54:34,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 12:54:34,455 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:54:34,455 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:54:34,455 INFO L424 AbstractCegarLoop]: === Iteration 4 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 12:54:34,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:34,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1960510122, now seen corresponding path program 1 times [2018-11-10 12:54:34,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:54:34,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:34,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:34,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:34,458 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:54:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:54:34,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:54:34,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:54:34,507 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:54:34,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:54:34,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:54:34,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:54:34,508 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 6 states. [2018-11-10 12:54:34,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:54:34,586 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-10 12:54:34,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:54:34,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-10 12:54:34,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:54:34,587 INFO L225 Difference]: With dead ends: 50 [2018-11-10 12:54:34,587 INFO L226 Difference]: Without dead ends: 50 [2018-11-10 12:54:34,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:54:34,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-10 12:54:34,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-11-10 12:54:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 12:54:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-10 12:54:34,590 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 14 [2018-11-10 12:54:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:54:34,591 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-10 12:54:34,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:54:34,591 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-10 12:54:34,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 12:54:34,591 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:54:34,591 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:54:34,592 INFO L424 AbstractCegarLoop]: === Iteration 5 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 12:54:34,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:34,592 INFO L82 PathProgramCache]: Analyzing trace with hash 646271685, now seen corresponding path program 1 times [2018-11-10 12:54:34,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:54:34,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:34,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:34,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:34,593 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:54:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:54:34,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:54:34,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:54:34,663 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:54:34,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:54:34,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:54:34,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:54:34,664 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 6 states. [2018-11-10 12:54:34,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:54:34,745 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-10 12:54:34,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:54:34,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-10 12:54:34,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:54:34,746 INFO L225 Difference]: With dead ends: 49 [2018-11-10 12:54:34,746 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 12:54:34,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:54:34,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 12:54:34,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-11-10 12:54:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 12:54:34,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-10 12:54:34,749 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 15 [2018-11-10 12:54:34,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:54:34,749 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-10 12:54:34,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:54:34,749 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-10 12:54:34,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 12:54:34,749 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:54:34,749 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:54:34,750 INFO L424 AbstractCegarLoop]: === Iteration 6 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 12:54:34,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:34,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1750858933, now seen corresponding path program 1 times [2018-11-10 12:54:34,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:54:34,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:34,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:34,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:34,751 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:54:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:54:34,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:54:34,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:54:34,807 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:54:34,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:54:34,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:54:34,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:54:34,808 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2018-11-10 12:54:34,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:54:34,846 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-10 12:54:34,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:54:34,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-10 12:54:34,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:54:34,847 INFO L225 Difference]: With dead ends: 52 [2018-11-10 12:54:34,847 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 12:54:34,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:54:34,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 12:54:34,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-11-10 12:54:34,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 12:54:34,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-11-10 12:54:34,851 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 17 [2018-11-10 12:54:34,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:54:34,851 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-11-10 12:54:34,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:54:34,851 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-10 12:54:34,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 12:54:34,852 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:54:34,852 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:54:34,852 INFO L424 AbstractCegarLoop]: === Iteration 7 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 12:54:34,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:34,856 INFO L82 PathProgramCache]: Analyzing trace with hash -361022790, now seen corresponding path program 1 times [2018-11-10 12:54:34,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:54:34,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:34,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:34,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:34,857 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:54:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:34,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:54:34,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:54:34,934 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:54:34,934 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-11-10 12:54:34,936 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [13], [15], [17], [19], [28], [32], [37], [77], [78], [79], [81] [2018-11-10 12:54:34,964 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 12:54:34,964 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 12:54:35,351 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 12:54:35,352 INFO L272 AbstractInterpreter]: Visited 17 different actions 68 times. Merged at 6 different actions 44 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-10 12:54:35,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:35,361 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 12:54:35,445 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 80.57% of their original sizes. [2018-11-10 12:54:35,445 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 12:54:35,608 INFO L415 sIntCurrentIteration]: We unified 18 AI predicates to 18 [2018-11-10 12:54:35,609 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 12:54:35,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:54:35,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 15 [2018-11-10 12:54:35,609 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:54:35,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 12:54:35,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 12:54:35,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:54:35,610 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 11 states. [2018-11-10 12:54:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:54:36,017 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-11-10 12:54:36,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:54:36,017 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-11-10 12:54:36,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:54:36,018 INFO L225 Difference]: With dead ends: 59 [2018-11-10 12:54:36,018 INFO L226 Difference]: Without dead ends: 59 [2018-11-10 12:54:36,018 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-11-10 12:54:36,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-10 12:54:36,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2018-11-10 12:54:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 12:54:36,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-11-10 12:54:36,020 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 19 [2018-11-10 12:54:36,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:54:36,021 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-11-10 12:54:36,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 12:54:36,021 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-10 12:54:36,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:54:36,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:54:36,021 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:54:36,023 INFO L424 AbstractCegarLoop]: === Iteration 8 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 12:54:36,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:36,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1841873058, now seen corresponding path program 1 times [2018-11-10 12:54:36,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:54:36,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:36,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:36,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:36,024 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:54:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:36,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:54:36,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:54:36,104 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:54:36,104 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-11-10 12:54:36,104 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [17], [19], [23], [24], [28], [32], [37], [39], [40], [77], [78], [79], [81], [82] [2018-11-10 12:54:36,106 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 12:54:36,106 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 12:54:36,290 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 12:54:36,290 INFO L272 AbstractInterpreter]: Visited 22 different actions 95 times. Merged at 6 different actions 62 times. Widened at 1 different actions 7 times. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-11-10 12:54:36,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:36,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 12:54:36,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:54:36,294 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b4703a8-e852-4308-af3b-60cfb92bc299/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:54:36,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:36,310 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 12:54:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:36,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:54:36,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:54:36,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:54:36,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:54:36,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 12:54:36,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-11-10 12:54:36,469 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 12:54:36,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:54:36,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:54:36,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:54:36,470 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 8 states. [2018-11-10 12:54:36,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:54:36,556 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-11-10 12:54:36,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:54:36,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-10 12:54:36,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:54:36,557 INFO L225 Difference]: With dead ends: 57 [2018-11-10 12:54:36,557 INFO L226 Difference]: Without dead ends: 54 [2018-11-10 12:54:36,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-11-10 12:54:36,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-10 12:54:36,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-11-10 12:54:36,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 12:54:36,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-11-10 12:54:36,562 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 23 [2018-11-10 12:54:36,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:54:36,562 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-11-10 12:54:36,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:54:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-10 12:54:36,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 12:54:36,563 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:54:36,563 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:54:36,563 INFO L424 AbstractCegarLoop]: === Iteration 9 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 12:54:36,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:36,564 INFO L82 PathProgramCache]: Analyzing trace with hash 216654009, now seen corresponding path program 2 times [2018-11-10 12:54:36,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:54:36,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:36,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:36,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:36,566 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:54:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:36,670 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:54:36,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:54:36,670 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:54:36,670 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 12:54:36,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 12:54:36,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:54:36,670 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b4703a8-e852-4308-af3b-60cfb92bc299/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:54:36,677 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 12:54:36,677 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 12:54:36,689 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 12:54:36,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:54:36,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:54:36,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-10 12:54:36,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 12:54:36,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:36,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:36,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:54:36,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2018-11-10 12:54:36,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 12:54:36,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:54:36,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 12:54:36,795 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:54:36,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [6] total 9 [2018-11-10 12:54:36,795 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:54:36,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:54:36,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:54:36,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:54:36,796 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 5 states. [2018-11-10 12:54:36,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:54:36,831 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-10 12:54:36,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:54:36,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-10 12:54:36,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:54:36,832 INFO L225 Difference]: With dead ends: 51 [2018-11-10 12:54:36,832 INFO L226 Difference]: Without dead ends: 51 [2018-11-10 12:54:36,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:54:36,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-10 12:54:36,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-11-10 12:54:36,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 12:54:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-11-10 12:54:36,836 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 29 [2018-11-10 12:54:36,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:54:36,836 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-11-10 12:54:36,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:54:36,836 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-10 12:54:36,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 12:54:36,837 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:54:36,837 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:54:36,837 INFO L424 AbstractCegarLoop]: === Iteration 10 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 12:54:36,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:36,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1873660240, now seen corresponding path program 1 times [2018-11-10 12:54:36,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:54:36,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:36,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:54:36,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:36,838 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:54:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:36,916 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:54:36,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:54:36,916 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:54:36,916 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-11-10 12:54:36,916 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [17], [19], [23], [24], [28], [32], [37], [39], [41], [42], [77], [78], [79], [81], [82] [2018-11-10 12:54:36,919 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 12:54:36,919 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 12:54:37,115 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 12:54:37,115 INFO L272 AbstractInterpreter]: Visited 23 different actions 96 times. Merged at 6 different actions 62 times. Widened at 1 different actions 7 times. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-11-10 12:54:37,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:37,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 12:54:37,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:54:37,121 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b4703a8-e852-4308-af3b-60cfb92bc299/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:54:37,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:37,126 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 12:54:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:37,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:54:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:54:37,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:54:37,246 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:54:37,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 12:54:37,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2018-11-10 12:54:37,262 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 12:54:37,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 12:54:37,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 12:54:37,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-11-10 12:54:37,262 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 10 states. [2018-11-10 12:54:37,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:54:37,336 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-11-10 12:54:37,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:54:37,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-10 12:54:37,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:54:37,337 INFO L225 Difference]: With dead ends: 62 [2018-11-10 12:54:37,337 INFO L226 Difference]: Without dead ends: 59 [2018-11-10 12:54:37,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-10 12:54:37,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-10 12:54:37,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-11-10 12:54:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-10 12:54:37,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-11-10 12:54:37,340 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 30 [2018-11-10 12:54:37,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:54:37,340 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-11-10 12:54:37,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 12:54:37,340 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-11-10 12:54:37,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 12:54:37,341 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:54:37,341 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:54:37,341 INFO L424 AbstractCegarLoop]: === Iteration 11 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 12:54:37,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:37,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1424498361, now seen corresponding path program 2 times [2018-11-10 12:54:37,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:54:37,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:37,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:37,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:37,342 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:54:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:37,449 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:54:37,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:54:37,449 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:54:37,449 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 12:54:37,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 12:54:37,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:54:37,450 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b4703a8-e852-4308-af3b-60cfb92bc299/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:54:37,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 12:54:37,456 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 12:54:37,467 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 12:54:37,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:54:37,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:54:37,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 12:54:37,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:37,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-10 12:54:37,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-10 12:54:37,499 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:37,502 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:37,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:37,510 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2018-11-10 12:54:37,564 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 12:54:37,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:54:37,597 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 12:54:37,614 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:54:37,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [7] total 14 [2018-11-10 12:54:37,614 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:54:37,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:54:37,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:54:37,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-10 12:54:37,615 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 6 states. [2018-11-10 12:54:37,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:54:37,679 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-11-10 12:54:37,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:54:37,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-11-10 12:54:37,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:54:37,681 INFO L225 Difference]: With dead ends: 56 [2018-11-10 12:54:37,681 INFO L226 Difference]: Without dead ends: 56 [2018-11-10 12:54:37,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-11-10 12:54:37,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-10 12:54:37,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-11-10 12:54:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 12:54:37,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-11-10 12:54:37,692 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 36 [2018-11-10 12:54:37,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:54:37,692 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-11-10 12:54:37,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:54:37,692 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-11-10 12:54:37,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 12:54:37,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:54:37,693 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:54:37,693 INFO L424 AbstractCegarLoop]: === Iteration 12 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 12:54:37,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:37,694 INFO L82 PathProgramCache]: Analyzing trace with hash 940344667, now seen corresponding path program 1 times [2018-11-10 12:54:37,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:54:37,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:37,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:54:37,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:37,695 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:54:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:37,725 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 12:54:37,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:54:37,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:54:37,725 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:54:37,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:54:37,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:54:37,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:54:37,726 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 6 states. [2018-11-10 12:54:37,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:54:37,756 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-11-10 12:54:37,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:54:37,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-11-10 12:54:37,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:54:37,757 INFO L225 Difference]: With dead ends: 55 [2018-11-10 12:54:37,757 INFO L226 Difference]: Without dead ends: 55 [2018-11-10 12:54:37,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:54:37,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-10 12:54:37,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-11-10 12:54:37,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 12:54:37,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-11-10 12:54:37,759 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 43 [2018-11-10 12:54:37,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:54:37,760 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-11-10 12:54:37,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:54:37,760 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-11-10 12:54:37,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 12:54:37,760 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:54:37,765 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:54:37,765 INFO L424 AbstractCegarLoop]: === Iteration 13 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 12:54:37,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:37,765 INFO L82 PathProgramCache]: Analyzing trace with hash -914086303, now seen corresponding path program 1 times [2018-11-10 12:54:37,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:54:37,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:37,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:37,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:37,766 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:54:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:37,796 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 12:54:37,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:54:37,796 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:54:37,796 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-11-10 12:54:37,796 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [17], [19], [23], [24], [28], [32], [35], [37], [39], [41], [43], [45], [49], [53], [58], [60], [61], [77], [78], [79], [81], [82] [2018-11-10 12:54:37,797 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 12:54:37,798 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 12:54:39,502 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 12:54:39,503 INFO L272 AbstractInterpreter]: Visited 30 different actions 1026 times. Merged at 13 different actions 754 times. Widened at 2 different actions 84 times. Found 12 fixpoints after 2 different actions. Largest state had 31 variables. [2018-11-10 12:54:39,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:39,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 12:54:39,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:54:39,528 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b4703a8-e852-4308-af3b-60cfb92bc299/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:54:39,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:39,545 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 12:54:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:39,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:54:39,617 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:54:39,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:54:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:54:39,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 12:54:39,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2018-11-10 12:54:39,693 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 12:54:39,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:54:39,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:54:39,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-11-10 12:54:39,694 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 9 states. [2018-11-10 12:54:39,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:54:39,754 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-11-10 12:54:39,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:54:39,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-11-10 12:54:39,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:54:39,756 INFO L225 Difference]: With dead ends: 96 [2018-11-10 12:54:39,756 INFO L226 Difference]: Without dead ends: 93 [2018-11-10 12:54:39,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-11-10 12:54:39,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-10 12:54:39,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2018-11-10 12:54:39,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-10 12:54:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-11-10 12:54:39,760 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 44 [2018-11-10 12:54:39,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:54:39,760 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-11-10 12:54:39,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:54:39,760 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-11-10 12:54:39,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 12:54:39,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:54:39,762 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 8, 8, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:54:39,763 INFO L424 AbstractCegarLoop]: === Iteration 14 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 12:54:39,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:39,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1005236038, now seen corresponding path program 2 times [2018-11-10 12:54:39,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:54:39,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:39,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:39,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:39,764 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:54:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-11-10 12:54:39,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:54:39,819 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:54:39,819 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 12:54:39,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 12:54:39,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:54:39,819 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b4703a8-e852-4308-af3b-60cfb92bc299/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:54:39,837 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 12:54:39,837 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 12:54:39,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 12:54:39,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:54:39,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:54:39,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 12:54:39,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:39,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-10 12:54:39,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-10 12:54:39,869 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:39,873 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:39,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:39,877 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2018-11-10 12:54:39,955 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-11-10 12:54:39,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:54:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-11-10 12:54:40,059 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:54:40,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 12 [2018-11-10 12:54:40,060 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:54:40,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:54:40,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:54:40,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:54:40,060 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 6 states. [2018-11-10 12:54:40,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:54:40,102 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-11-10 12:54:40,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:54:40,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-11-10 12:54:40,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:54:40,103 INFO L225 Difference]: With dead ends: 71 [2018-11-10 12:54:40,103 INFO L226 Difference]: Without dead ends: 71 [2018-11-10 12:54:40,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 165 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:54:40,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-10 12:54:40,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-11-10 12:54:40,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-10 12:54:40,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-11-10 12:54:40,106 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 87 [2018-11-10 12:54:40,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:54:40,106 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-11-10 12:54:40,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:54:40,107 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-11-10 12:54:40,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 12:54:40,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:54:40,108 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 8, 8, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:54:40,108 INFO L424 AbstractCegarLoop]: === Iteration 15 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 12:54:40,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:40,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1820052541, now seen corresponding path program 1 times [2018-11-10 12:54:40,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:54:40,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:40,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:54:40,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:40,113 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:54:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:40,155 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-11-10 12:54:40,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:54:40,155 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:54:40,156 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 91 with the following transitions: [2018-11-10 12:54:40,156 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [15], [17], [19], [23], [24], [28], [32], [35], [37], [39], [41], [43], [45], [49], [53], [58], [60], [62], [65], [67], [76], [77], [78], [79], [81], [82] [2018-11-10 12:54:40,157 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 12:54:40,157 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 12:54:41,574 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 12:54:41,574 INFO L272 AbstractInterpreter]: Visited 33 different actions 1029 times. Merged at 13 different actions 754 times. Widened at 2 different actions 84 times. Found 12 fixpoints after 2 different actions. Largest state had 37 variables. [2018-11-10 12:54:41,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:41,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 12:54:41,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:54:41,581 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b4703a8-e852-4308-af3b-60cfb92bc299/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:54:41,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:41,589 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 12:54:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:41,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:54:41,686 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 123 proven. 44 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-10 12:54:41,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:54:41,770 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 5 proven. 161 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 12:54:41,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 12:54:41,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 17 [2018-11-10 12:54:41,786 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 12:54:41,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 12:54:41,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 12:54:41,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-11-10 12:54:41,787 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 11 states. [2018-11-10 12:54:41,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:54:41,862 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-11-10 12:54:41,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 12:54:41,864 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2018-11-10 12:54:41,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:54:41,864 INFO L225 Difference]: With dead ends: 115 [2018-11-10 12:54:41,864 INFO L226 Difference]: Without dead ends: 112 [2018-11-10 12:54:41,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2018-11-10 12:54:41,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-10 12:54:41,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 90. [2018-11-10 12:54:41,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-10 12:54:41,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2018-11-10 12:54:41,867 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 90 [2018-11-10 12:54:41,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:54:41,868 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2018-11-10 12:54:41,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 12:54:41,868 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2018-11-10 12:54:41,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-10 12:54:41,869 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:54:41,869 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:54:41,869 INFO L424 AbstractCegarLoop]: === Iteration 16 === [fooErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, mainErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-11-10 12:54:41,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:54:41,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1515618710, now seen corresponding path program 2 times [2018-11-10 12:54:41,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:54:41,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:41,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:54:41,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:54:41,872 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:54:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:54:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2018-11-10 12:54:41,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:54:41,939 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:54:41,939 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 12:54:41,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 12:54:41,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:54:41,939 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b4703a8-e852-4308-af3b-60cfb92bc299/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:54:41,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 12:54:41,950 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 12:54:41,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-10 12:54:41,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:54:41,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:54:42,003 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:42,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 12:54:42,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 12:54:42,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:42,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:42,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 12:54:42,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 12:54:42,051 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:42,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 12:54:42,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 12:54:42,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:42,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:42,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 12:54:42,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 12:54:42,105 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:54:42,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 12:54:42,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 12:54:42,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:54:42,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:54:42,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 12:54:42,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 12:54:42,142 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_ULTIMATE.dealloc_~addr.base Int) (|v_main_~#b~0.base_12| Int)) (let ((.cse0 (store |c_old(#valid)| |v_main_~#b~0.base_12| 1))) (and (= |c_#valid| (store (store (store .cse0 main_ULTIMATE.dealloc_~addr.base 1) |v_main_~#b~0.base_12| 0) main_ULTIMATE.dealloc_~addr.base 0)) (= 0 (select .cse0 main_ULTIMATE.dealloc_~addr.base)) (= 0 (select |c_old(#valid)| |v_main_~#b~0.base_12|))))) is different from true [2018-11-10 12:54:42,178 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2018-11-10 12:54:42,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:54:42,205 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_main_#Ultimate.alloc_#res.base_6| Int) (|v_main_~#b~0.base_14| Int)) (let ((.cse0 (store |c_#valid| |v_main_~#b~0.base_14| 1))) (or (not (= (select .cse0 |v_main_#Ultimate.alloc_#res.base_6|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#Ultimate.alloc_#res.base_6| 1) |v_main_~#b~0.base_14| 0) |v_main_#Ultimate.alloc_#res.base_6| 0)) (not (= 0 (select |c_#valid| |v_main_~#b~0.base_14|)))))) is different from false [2018-11-10 12:54:42,217 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2018-11-10 12:54:42,233 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:54:42,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [6] total 12 [2018-11-10 12:54:42,233 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:54:42,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:54:42,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:54:42,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=67, Unknown=2, NotChecked=34, Total=132 [2018-11-10 12:54:42,234 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand 6 states. [2018-11-10 12:54:42,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:54:42,287 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-11-10 12:54:42,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:54:42,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2018-11-10 12:54:42,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:54:42,288 INFO L225 Difference]: With dead ends: 90 [2018-11-10 12:54:42,288 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 12:54:42,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 280 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=102, Unknown=2, NotChecked=42, Total=182 [2018-11-10 12:54:42,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 12:54:42,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 12:54:42,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 12:54:42,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 12:54:42,289 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 145 [2018-11-10 12:54:42,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:54:42,289 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:54:42,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:54:42,290 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:54:42,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 12:54:42,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:54:42 BoogieIcfgContainer [2018-11-10 12:54:42,294 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:54:42,294 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:54:42,295 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:54:42,295 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:54:42,295 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:54:34" (3/4) ... [2018-11-10 12:54:42,297 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 12:54:42,301 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 12:54:42,301 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2018-11-10 12:54:42,301 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 12:54:42,304 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 47 nodes and edges [2018-11-10 12:54:42,306 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2018-11-10 12:54:42,306 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-10 12:54:42,336 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6b4703a8-e852-4308-af3b-60cfb92bc299/bin-2019/utaipan/witness.graphml [2018-11-10 12:54:42,336 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:54:42,336 INFO L168 Benchmark]: Toolchain (without parser) took 8725.48 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 828.4 MB). Free memory was 959.2 MB in the beginning and 832.0 MB in the end (delta: 127.3 MB). Peak memory consumption was 955.6 MB. Max. memory is 11.5 GB. [2018-11-10 12:54:42,338 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:54:42,338 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.98 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:54:42,338 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.52 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:54:42,338 INFO L168 Benchmark]: Boogie Preprocessor took 18.44 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:54:42,339 INFO L168 Benchmark]: RCFGBuilder took 265.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:54:42,339 INFO L168 Benchmark]: TraceAbstraction took 8221.99 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 696.3 MB). Free memory was 1.1 GB in the beginning and 832.0 MB in the end (delta: 280.1 MB). Peak memory consumption was 976.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:54:42,339 INFO L168 Benchmark]: Witness Printer took 41.39 ms. Allocated memory is still 1.9 GB. Free memory is still 832.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:54:42,344 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 151.98 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.52 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.44 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 265.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8221.99 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 696.3 MB). Free memory was 1.1 GB in the beginning and 832.0 MB in the end (delta: 280.1 MB). Peak memory consumption was 976.3 MB. Max. memory is 11.5 GB. * Witness Printer took 41.39 ms. Allocated memory is still 1.9 GB. Free memory is still 832.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 44 locations, 8 error locations. SAFE Result, 8.1s OverallTime, 16 OverallIterations, 18 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 520 SDtfs, 549 SDslu, 1404 SDs, 0 SdLazy, 662 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1073 GetRequests, 922 SyntacticMatches, 14 SemanticMatches, 137 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.9s AbstIntTime, 5 AbstIntIterations, 1 AbstIntStrong, 0.9263888888888889 AbsIntWeakeningRatio, 1.5 AbsIntAvgWeakeningVarsNumRemoved, 126.77777777777777 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 105 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1112 NumberOfCodeBlocks, 879 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1564 ConstructedInterpolants, 233 QuantifiedInterpolants, 704262 SizeOfPredicates, 35 NumberOfNonLiveVariables, 1067 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 32 InterpolantComputations, 15 PerfectInterpolantSequences, 3467/3842 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...