./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a3974288-019c-4058-b127-1024c8c5fb9f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a3974288-019c-4058-b127-1024c8c5fb9f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a3974288-019c-4058-b127-1024c8c5fb9f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a3974288-019c-4058-b127-1024c8c5fb9f/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a3974288-019c-4058-b127-1024c8c5fb9f/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a3974288-019c-4058-b127-1024c8c5fb9f/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 bd1b17fffb471392e4e5cb414f885f337c434a14 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 17:15:43,749 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 17:15:43,750 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 17:15:43,756 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 17:15:43,756 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 17:15:43,756 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 17:15:43,757 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 17:15:43,758 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 17:15:43,758 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 17:15:43,759 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 17:15:43,759 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 17:15:43,759 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 17:15:43,760 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 17:15:43,760 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 17:15:43,761 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 17:15:43,761 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 17:15:43,762 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 17:15:43,763 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 17:15:43,763 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 17:15:43,764 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 17:15:43,765 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 17:15:43,765 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 17:15:43,766 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 17:15:43,766 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 17:15:43,767 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 17:15:43,767 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 17:15:43,768 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 17:15:43,768 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 17:15:43,768 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 17:15:43,769 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 17:15:43,769 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 17:15:43,769 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 17:15:43,770 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 17:15:43,770 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 17:15:43,770 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 17:15:43,770 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 17:15:43,771 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a3974288-019c-4058-b127-1024c8c5fb9f/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 17:15:43,778 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 17:15:43,778 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 17:15:43,778 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 17:15:43,778 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 17:15:43,779 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 17:15:43,779 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 17:15:43,779 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 17:15:43,779 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 17:15:43,779 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 17:15:43,779 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 17:15:43,779 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 17:15:43,779 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 17:15:43,779 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 17:15:43,779 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 17:15:43,780 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 17:15:43,780 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 17:15:43,780 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 17:15:43,780 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 17:15:43,780 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 17:15:43,780 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 17:15:43,780 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 17:15:43,780 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 17:15:43,780 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 17:15:43,780 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 17:15:43,780 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 17:15:43,780 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 17:15:43,781 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 17:15:43,781 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 17:15:43,781 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 17:15:43,781 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 17:15:43,781 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 17:15:43,781 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 17:15:43,781 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 17:15:43,781 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 17:15:43,781 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 17:15:43,781 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 17:15:43,781 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_a3974288-019c-4058-b127-1024c8c5fb9f/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 -> bd1b17fffb471392e4e5cb414f885f337c434a14 [2018-12-09 17:15:43,798 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 17:15:43,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 17:15:43,807 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 17:15:43,808 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 17:15:43,808 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 17:15:43,808 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a3974288-019c-4058-b127-1024c8c5fb9f/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-12-09 17:15:43,846 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a3974288-019c-4058-b127-1024c8c5fb9f/bin-2019/utaipan/data/1a1f9b1c0/bc355eb9088a473b99203a9384115f21/FLAG6abc0f238 [2018-12-09 17:15:44,192 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 17:15:44,192 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a3974288-019c-4058-b127-1024c8c5fb9f/sv-benchmarks/c/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-12-09 17:15:44,198 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a3974288-019c-4058-b127-1024c8c5fb9f/bin-2019/utaipan/data/1a1f9b1c0/bc355eb9088a473b99203a9384115f21/FLAG6abc0f238 [2018-12-09 17:15:44,206 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a3974288-019c-4058-b127-1024c8c5fb9f/bin-2019/utaipan/data/1a1f9b1c0/bc355eb9088a473b99203a9384115f21 [2018-12-09 17:15:44,208 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 17:15:44,208 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 17:15:44,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 17:15:44,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 17:15:44,211 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 17:15:44,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:15:44" (1/1) ... [2018-12-09 17:15:44,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4834854b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:15:44, skipping insertion in model container [2018-12-09 17:15:44,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:15:44" (1/1) ... [2018-12-09 17:15:44,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 17:15:44,241 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 17:15:44,397 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 17:15:44,404 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 17:15:44,459 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 17:15:44,487 INFO L195 MainTranslator]: Completed translation [2018-12-09 17:15:44,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:15:44 WrapperNode [2018-12-09 17:15:44,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 17:15:44,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 17:15:44,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 17:15:44,488 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 17:15:44,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:15:44" (1/1) ... [2018-12-09 17:15:44,505 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:15:44" (1/1) ... [2018-12-09 17:15:44,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 17:15:44,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 17:15:44,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 17:15:44,512 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 17:15:44,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:15:44" (1/1) ... [2018-12-09 17:15:44,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:15:44" (1/1) ... [2018-12-09 17:15:44,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:15:44" (1/1) ... [2018-12-09 17:15:44,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:15:44" (1/1) ... [2018-12-09 17:15:44,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:15:44" (1/1) ... [2018-12-09 17:15:44,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:15:44" (1/1) ... [2018-12-09 17:15:44,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:15:44" (1/1) ... [2018-12-09 17:15:44,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 17:15:44,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 17:15:44,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 17:15:44,530 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 17:15:44,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:15:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3974288-019c-4058-b127-1024c8c5fb9f/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 17:15:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 17:15:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 17:15:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-12-09 17:15:44,563 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-12-09 17:15:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 17:15:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 17:15:44,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 17:15:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 17:15:44,563 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 17:15:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 17:15:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 17:15:44,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 17:15:44,733 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 17:15:44,733 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 17:15:44,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:15:44 BoogieIcfgContainer [2018-12-09 17:15:44,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 17:15:44,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 17:15:44,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 17:15:44,736 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 17:15:44,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:15:44" (1/3) ... [2018-12-09 17:15:44,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0e318c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:15:44, skipping insertion in model container [2018-12-09 17:15:44,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:15:44" (2/3) ... [2018-12-09 17:15:44,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0e318c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:15:44, skipping insertion in model container [2018-12-09 17:15:44,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:15:44" (3/3) ... [2018-12-09 17:15:44,738 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-12-09 17:15:44,745 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 17:15:44,751 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-09 17:15:44,761 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-09 17:15:44,777 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 17:15:44,777 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 17:15:44,777 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 17:15:44,777 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 17:15:44,777 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 17:15:44,777 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 17:15:44,777 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 17:15:44,777 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 17:15:44,786 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-12-09 17:15:44,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 17:15:44,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:15:44,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:15:44,796 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 17:15:44,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:15:44,800 INFO L82 PathProgramCache]: Analyzing trace with hash -923736369, now seen corresponding path program 1 times [2018-12-09 17:15:44,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:15:44,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:44,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:15:44,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:44,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:15:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:15:44,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:15:44,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:15:44,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 17:15:44,904 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:15:44,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:15:44,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:15:44,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:15:44,916 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2018-12-09 17:15:44,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:15:44,962 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-12-09 17:15:44,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:15:44,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 17:15:44,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:15:44,968 INFO L225 Difference]: With dead ends: 47 [2018-12-09 17:15:44,968 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 17:15:44,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:15:44,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 17:15:44,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 17:15:44,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 17:15:44,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-12-09 17:15:44,993 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 10 [2018-12-09 17:15:44,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:15:44,993 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-12-09 17:15:44,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:15:44,993 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-12-09 17:15:44,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 17:15:44,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:15:44,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:15:44,994 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 17:15:44,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:15:44,994 INFO L82 PathProgramCache]: Analyzing trace with hash -923736368, now seen corresponding path program 1 times [2018-12-09 17:15:44,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:15:44,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:44,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:15:44,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:44,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:15:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:15:45,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:15:45,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:15:45,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:15:45,038 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:15:45,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:15:45,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:15:45,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:15:45,040 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 4 states. [2018-12-09 17:15:45,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:15:45,057 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-12-09 17:15:45,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 17:15:45,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 17:15:45,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:15:45,058 INFO L225 Difference]: With dead ends: 43 [2018-12-09 17:15:45,059 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 17:15:45,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:15:45,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 17:15:45,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 17:15:45,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 17:15:45,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-12-09 17:15:45,063 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 10 [2018-12-09 17:15:45,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:15:45,063 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-12-09 17:15:45,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:15:45,064 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-12-09 17:15:45,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 17:15:45,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:15:45,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:15:45,064 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 17:15:45,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:15:45,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1428943671, now seen corresponding path program 1 times [2018-12-09 17:15:45,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:15:45,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:45,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:15:45,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:45,066 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:15:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:15:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:15:45,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:15:45,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 17:15:45,089 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:15:45,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:15:45,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:15:45,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:15:45,090 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 3 states. [2018-12-09 17:15:45,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:15:45,111 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-12-09 17:15:45,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:15:45,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 17:15:45,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:15:45,112 INFO L225 Difference]: With dead ends: 42 [2018-12-09 17:15:45,112 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 17:15:45,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:15:45,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 17:15:45,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 17:15:45,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 17:15:45,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-12-09 17:15:45,116 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 11 [2018-12-09 17:15:45,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:15:45,116 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-12-09 17:15:45,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:15:45,116 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-12-09 17:15:45,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 17:15:45,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:15:45,117 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:15:45,117 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 17:15:45,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:15:45,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1428943672, now seen corresponding path program 1 times [2018-12-09 17:15:45,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:15:45,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:45,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:15:45,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:45,118 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:15:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:15:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:15:45,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:15:45,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:15:45,146 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:15:45,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:15:45,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:15:45,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:15:45,147 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 4 states. [2018-12-09 17:15:45,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:15:45,156 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-12-09 17:15:45,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 17:15:45,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-09 17:15:45,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:15:45,157 INFO L225 Difference]: With dead ends: 41 [2018-12-09 17:15:45,157 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 17:15:45,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:15:45,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 17:15:45,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-09 17:15:45,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 17:15:45,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-12-09 17:15:45,159 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 11 [2018-12-09 17:15:45,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:15:45,160 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-12-09 17:15:45,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:15:45,160 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-12-09 17:15:45,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 17:15:45,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:15:45,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:15:45,160 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 17:15:45,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:15:45,160 INFO L82 PathProgramCache]: Analyzing trace with hash -2054888993, now seen corresponding path program 1 times [2018-12-09 17:15:45,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:15:45,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:45,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:15:45,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:45,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:15:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:15:45,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:15:45,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:15:45,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:15:45,186 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:15:45,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:15:45,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:15:45,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:15:45,186 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2018-12-09 17:15:45,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:15:45,236 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-12-09 17:15:45,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:15:45,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-09 17:15:45,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:15:45,237 INFO L225 Difference]: With dead ends: 38 [2018-12-09 17:15:45,237 INFO L226 Difference]: Without dead ends: 38 [2018-12-09 17:15:45,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:15:45,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-09 17:15:45,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-09 17:15:45,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-09 17:15:45,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-12-09 17:15:45,239 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 14 [2018-12-09 17:15:45,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:15:45,239 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-12-09 17:15:45,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:15:45,239 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-12-09 17:15:45,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 17:15:45,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:15:45,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:15:45,240 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 17:15:45,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:15:45,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2054888992, now seen corresponding path program 1 times [2018-12-09 17:15:45,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:15:45,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:45,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:15:45,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:45,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:15:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:15:45,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:15:45,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:15:45,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:15:45,284 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:15:45,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 17:15:45,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 17:15:45,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:15:45,285 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 7 states. [2018-12-09 17:15:45,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:15:45,348 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-12-09 17:15:45,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 17:15:45,349 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-12-09 17:15:45,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:15:45,351 INFO L225 Difference]: With dead ends: 57 [2018-12-09 17:15:45,351 INFO L226 Difference]: Without dead ends: 57 [2018-12-09 17:15:45,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 17:15:45,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-09 17:15:45,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2018-12-09 17:15:45,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 17:15:45,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-12-09 17:15:45,355 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 14 [2018-12-09 17:15:45,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:15:45,355 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-12-09 17:15:45,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 17:15:45,355 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-12-09 17:15:45,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 17:15:45,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:15:45,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:15:45,356 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 17:15:45,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:15:45,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1838570345, now seen corresponding path program 1 times [2018-12-09 17:15:45,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:15:45,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:45,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:15:45,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:45,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:15:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:15:45,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:15:45,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:15:45,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:15:45,377 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:15:45,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:15:45,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:15:45,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:15:45,378 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 3 states. [2018-12-09 17:15:45,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:15:45,384 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-12-09 17:15:45,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:15:45,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-09 17:15:45,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:15:45,385 INFO L225 Difference]: With dead ends: 48 [2018-12-09 17:15:45,385 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 17:15:45,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:15:45,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 17:15:45,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-09 17:15:45,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-09 17:15:45,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-12-09 17:15:45,389 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 18 [2018-12-09 17:15:45,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:15:45,389 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-12-09 17:15:45,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:15:45,389 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-12-09 17:15:45,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 17:15:45,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:15:45,390 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:15:45,390 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 17:15:45,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:15:45,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1838579419, now seen corresponding path program 1 times [2018-12-09 17:15:45,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:15:45,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:45,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:15:45,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:45,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:15:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:15:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:15:45,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:15:45,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:15:45,419 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:15:45,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:15:45,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:15:45,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:15:45,420 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 5 states. [2018-12-09 17:15:45,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:15:45,448 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-12-09 17:15:45,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:15:45,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-09 17:15:45,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:15:45,449 INFO L225 Difference]: With dead ends: 46 [2018-12-09 17:15:45,449 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 17:15:45,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:15:45,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 17:15:45,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-09 17:15:45,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 17:15:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-12-09 17:15:45,452 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 18 [2018-12-09 17:15:45,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:15:45,452 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-12-09 17:15:45,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:15:45,452 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-12-09 17:15:45,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 17:15:45,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:15:45,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:15:45,453 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 17:15:45,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:15:45,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1838579418, now seen corresponding path program 1 times [2018-12-09 17:15:45,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:15:45,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:45,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:15:45,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:45,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:15:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:15:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:15:45,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:15:45,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:15:45,533 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:15:45,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 17:15:45,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 17:15:45,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:15:45,533 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 7 states. [2018-12-09 17:15:45,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:15:45,580 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-12-09 17:15:45,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 17:15:45,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-12-09 17:15:45,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:15:45,581 INFO L225 Difference]: With dead ends: 53 [2018-12-09 17:15:45,581 INFO L226 Difference]: Without dead ends: 53 [2018-12-09 17:15:45,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 17:15:45,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-09 17:15:45,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-12-09 17:15:45,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-09 17:15:45,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-12-09 17:15:45,584 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 18 [2018-12-09 17:15:45,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:15:45,585 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-12-09 17:15:45,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 17:15:45,585 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-12-09 17:15:45,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 17:15:45,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:15:45,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:15:45,586 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 17:15:45,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:15:45,586 INFO L82 PathProgramCache]: Analyzing trace with hash 598444765, now seen corresponding path program 1 times [2018-12-09 17:15:45,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:15:45,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:45,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:15:45,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:45,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:15:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:15:45,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:15:45,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:15:45,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 17:15:45,678 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:15:45,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 17:15:45,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 17:15:45,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 17:15:45,678 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 9 states. [2018-12-09 17:15:45,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:15:45,772 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-12-09 17:15:45,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 17:15:45,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-12-09 17:15:45,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:15:45,773 INFO L225 Difference]: With dead ends: 69 [2018-12-09 17:15:45,773 INFO L226 Difference]: Without dead ends: 69 [2018-12-09 17:15:45,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-12-09 17:15:45,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-09 17:15:45,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-12-09 17:15:45,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-09 17:15:45,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2018-12-09 17:15:45,777 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 21 [2018-12-09 17:15:45,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:15:45,777 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2018-12-09 17:15:45,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 17:15:45,778 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-12-09 17:15:45,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 17:15:45,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:15:45,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:15:45,778 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 17:15:45,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:15:45,779 INFO L82 PathProgramCache]: Analyzing trace with hash -681418913, now seen corresponding path program 1 times [2018-12-09 17:15:45,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:15:45,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:45,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:15:45,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:45,780 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:15:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:15:45,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:15:45,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:15:45,936 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 17:15:45,936 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-09 17:15:45,937 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [7], [9], [10], [13], [14], [17], [20], [28], [51], [56], [60], [64], [65], [68], [75], [76], [77], [79] [2018-12-09 17:15:45,957 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 17:15:45,957 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 17:15:46,062 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 17:15:46,063 INFO L272 AbstractInterpreter]: Visited 21 different actions 21 times. Never merged. Never widened. Performed 172 root evaluator evaluations with a maximum evaluation depth of 3. Performed 172 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-12-09 17:15:46,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:15:46,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 17:15:46,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:15:46,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3974288-019c-4058-b127-1024c8c5fb9f/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-12-09 17:15:46,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:15:46,075 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 17:15:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:15:46,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:15:46,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 11 treesize of output 8 [2018-12-09 17:15:46,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 17:15:46,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:15:46,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:15:46,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:15:46,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-09 17:15:46,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-12-09 17:15:46,258 INFO L478 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 26 treesize of output 19 [2018-12-09 17:15:46,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:15:46,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 19 treesize of output 12 [2018-12-09 17:15:46,269 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:15:46,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 22 treesize of output 12 [2018-12-09 17:15:46,279 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:15:46,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:15:46,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:15:46,309 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:30, output treesize:8 [2018-12-09 17:15:46,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:15:46,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 17:15:46,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 13 treesize of output 11 [2018-12-09 17:15:46,444 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 17:15:46,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:15:46,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:15:46,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:15:46,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-12-09 17:15:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:15:46,464 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 17:15:46,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [10] total 26 [2018-12-09 17:15:46,464 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:15:46,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 17:15:46,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 17:15:46,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2018-12-09 17:15:46,465 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 12 states. [2018-12-09 17:15:46,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:15:46,777 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2018-12-09 17:15:46,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 17:15:46,777 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-12-09 17:15:46,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:15:46,778 INFO L225 Difference]: With dead ends: 115 [2018-12-09 17:15:46,778 INFO L226 Difference]: Without dead ends: 115 [2018-12-09 17:15:46,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=1079, Unknown=0, NotChecked=0, Total=1260 [2018-12-09 17:15:46,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-09 17:15:46,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 86. [2018-12-09 17:15:46,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-09 17:15:46,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-12-09 17:15:46,782 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 21 [2018-12-09 17:15:46,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:15:46,782 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-12-09 17:15:46,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 17:15:46,782 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-12-09 17:15:46,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 17:15:46,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:15:46,782 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:15:46,783 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 17:15:46,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:15:46,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1692536163, now seen corresponding path program 1 times [2018-12-09 17:15:46,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:15:46,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:46,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:15:46,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:46,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:15:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:15:46,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:15:46,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:15:46,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 17:15:46,902 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-09 17:15:46,903 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [7], [9], [10], [13], [14], [17], [20], [28], [51], [56], [62], [64], [65], [68], [75], [76], [77], [79] [2018-12-09 17:15:46,904 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 17:15:46,904 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 17:15:46,939 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 17:15:46,940 INFO L272 AbstractInterpreter]: Visited 21 different actions 21 times. Never merged. Never widened. Performed 170 root evaluator evaluations with a maximum evaluation depth of 3. Performed 170 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-12-09 17:15:46,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:15:46,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 17:15:46,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:15:46,941 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3974288-019c-4058-b127-1024c8c5fb9f/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-12-09 17:15:46,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:15:46,948 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 17:15:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:15:46,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:15:46,976 INFO L478 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-12-09 17:15:46,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:15:46,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:15:46,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-09 17:15:46,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 14 treesize of output 11 [2018-12-09 17:15:46,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 17:15:46,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:15:46,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:15:47,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:15:47,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-09 17:15:47,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-09 17:15:47,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 17:15:47,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:15:47,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:15:47,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-09 17:15:47,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-09 17:15:47,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-09 17:15:47,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 8 treesize of output 1 [2018-12-09 17:15:47,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:15:47,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 17:15:47,144 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 17:15:47,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:15:47,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:15:47,158 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-12-09 17:15:47,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:15:47,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 17:15:47,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 16 treesize of output 12 [2018-12-09 17:15:47,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:15:47,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 13 treesize of output 11 [2018-12-09 17:15:47,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 17:15:47,415 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:15:47,416 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:15:47,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:15:47,420 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-12-09 17:15:47,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:15:47,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 17:15:47,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 25 [2018-12-09 17:15:47,445 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 17:15:47,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 17:15:47,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 17:15:47,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2018-12-09 17:15:47,446 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 19 states. [2018-12-09 17:15:48,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:15:48,108 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2018-12-09 17:15:48,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 17:15:48,109 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-12-09 17:15:48,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:15:48,109 INFO L225 Difference]: With dead ends: 126 [2018-12-09 17:15:48,110 INFO L226 Difference]: Without dead ends: 126 [2018-12-09 17:15:48,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 17:15:48,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-09 17:15:48,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 95. [2018-12-09 17:15:48,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-09 17:15:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2018-12-09 17:15:48,116 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 21 [2018-12-09 17:15:48,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:15:48,116 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2018-12-09 17:15:48,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 17:15:48,117 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2018-12-09 17:15:48,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 17:15:48,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:15:48,117 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:15:48,118 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 17:15:48,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:15:48,118 INFO L82 PathProgramCache]: Analyzing trace with hash 526510947, now seen corresponding path program 1 times [2018-12-09 17:15:48,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:15:48,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:48,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:15:48,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:48,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:15:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:15:48,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:15:48,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:15:48,289 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 17:15:48,289 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-12-09 17:15:48,289 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [7], [10], [13], [14], [17], [19], [20], [28], [51], [56], [62], [64], [65], [68], [75], [76], [77], [79] [2018-12-09 17:15:48,290 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 17:15:48,291 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 17:15:48,319 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 17:15:48,320 INFO L272 AbstractInterpreter]: Visited 21 different actions 21 times. Never merged. Never widened. Performed 170 root evaluator evaluations with a maximum evaluation depth of 3. Performed 170 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-12-09 17:15:48,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:15:48,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 17:15:48,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:15:48,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3974288-019c-4058-b127-1024c8c5fb9f/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-12-09 17:15:48,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:15:48,328 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 17:15:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:15:48,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:15:48,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 14 treesize of output 11 [2018-12-09 17:15:48,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 17:15:48,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:15:48,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:15:48,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:15:48,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 17:15:48,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-12-09 17:15:48,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2018-12-09 17:15:48,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 17:15:48,592 INFO L478 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 23 treesize of output 16 [2018-12-09 17:15:48,593 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:15:48,594 INFO L478 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 19 treesize of output 12 [2018-12-09 17:15:48,594 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:15:48,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2018-12-09 17:15:48,615 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-12-09 17:15:48,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-09 17:15:48,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:15:48,671 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:49, output treesize:66 [2018-12-09 17:15:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:15:48,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 17:15:49,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 11 [2018-12-09 17:15:49,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:15:49,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-12-09 17:15:49,209 INFO L478 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 24 treesize of output 16 [2018-12-09 17:15:49,209 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:15:49,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-09 17:15:49,221 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:15:49,225 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:15:49,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:15:49,232 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:69, output treesize:7 [2018-12-09 17:15:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:15:49,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 17:15:49,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2018-12-09 17:15:49,251 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 17:15:49,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 17:15:49,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 17:15:49,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=950, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 17:15:49,251 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand 23 states. [2018-12-09 17:15:49,865 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2018-12-09 17:15:50,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:15:50,508 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2018-12-09 17:15:50,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 17:15:50,508 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2018-12-09 17:15:50,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:15:50,509 INFO L225 Difference]: With dead ends: 124 [2018-12-09 17:15:50,509 INFO L226 Difference]: Without dead ends: 124 [2018-12-09 17:15:50,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=330, Invalid=1740, Unknown=0, NotChecked=0, Total=2070 [2018-12-09 17:15:50,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-09 17:15:50,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 93. [2018-12-09 17:15:50,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-09 17:15:50,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2018-12-09 17:15:50,513 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 25 [2018-12-09 17:15:50,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:15:50,514 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2018-12-09 17:15:50,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 17:15:50,514 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2018-12-09 17:15:50,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 17:15:50,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:15:50,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:15:50,515 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 17:15:50,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:15:50,515 INFO L82 PathProgramCache]: Analyzing trace with hash 984822525, now seen corresponding path program 1 times [2018-12-09 17:15:50,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:15:50,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:50,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:15:50,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:50,516 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:15:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:15:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:15:50,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:15:50,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:15:50,550 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:15:50,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:15:50,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:15:50,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:15:50,550 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 4 states. [2018-12-09 17:15:50,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:15:50,579 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2018-12-09 17:15:50,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 17:15:50,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-12-09 17:15:50,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:15:50,580 INFO L225 Difference]: With dead ends: 92 [2018-12-09 17:15:50,580 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 17:15:50,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:15:50,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 17:15:50,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 17:15:50,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 17:15:50,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-09 17:15:50,582 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 27 [2018-12-09 17:15:50,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:15:50,582 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-09 17:15:50,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:15:50,582 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-09 17:15:50,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 17:15:50,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:15:50,582 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:15:50,582 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 17:15:50,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:15:50,582 INFO L82 PathProgramCache]: Analyzing trace with hash 67017600, now seen corresponding path program 2 times [2018-12-09 17:15:50,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:15:50,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:50,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:15:50,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:15:50,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:15:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:15:50,753 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:15:50,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:15:50,753 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 17:15:50,753 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 17:15:50,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 17:15:50,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:15:50,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3974288-019c-4058-b127-1024c8c5fb9f/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-12-09 17:15:50,760 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 17:15:50,760 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 17:15:50,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 17:15:50,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 17:15:50,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:15:50,789 INFO L478 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-12-09 17:15:50,792 INFO L478 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-12-09 17:15:50,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:15:50,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:15:50,803 INFO L478 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-12-09 17:15:50,804 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:15:50,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:15:50,809 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-09 17:15:50,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 15 treesize of output 12 [2018-12-09 17:15:50,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 17:15:50,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:15:50,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:15:50,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:15:50,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-09 17:15:50,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-09 17:15:50,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-09 17:15:50,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:15:50,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:15:50,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 17:15:50,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-12-09 17:15:50,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-12-09 17:15:50,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 10 treesize of output 1 [2018-12-09 17:15:50,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:15:50,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 17:15:50,945 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 17:15:50,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:15:50,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:15:50,952 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:12 [2018-12-09 17:15:51,037 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 17:15:51,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 17:15:51,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 13 treesize of output 11 [2018-12-09 17:15:51,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 17:15:51,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:15:51,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:15:51,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:15:51,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:44 [2018-12-09 17:15:51,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 17:15:51,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 17:15:51,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 29 [2018-12-09 17:15:51,313 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 17:15:51,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 17:15:51,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 17:15:51,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2018-12-09 17:15:51,313 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 21 states. [2018-12-09 17:15:51,559 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 32 [2018-12-09 17:15:54,250 WARN L180 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2018-12-09 17:15:57,084 WARN L180 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 53 DAG size of output: 37 [2018-12-09 17:15:59,173 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2018-12-09 17:15:59,375 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2018-12-09 17:15:59,958 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2018-12-09 17:16:00,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:16:00,003 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-09 17:16:00,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 17:16:00,004 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-12-09 17:16:00,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:16:00,004 INFO L225 Difference]: With dead ends: 44 [2018-12-09 17:16:00,004 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 17:16:00,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=348, Invalid=1722, Unknown=0, NotChecked=0, Total=2070 [2018-12-09 17:16:00,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 17:16:00,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-12-09 17:16:00,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 17:16:00,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-12-09 17:16:00,006 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 28 [2018-12-09 17:16:00,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:16:00,006 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-12-09 17:16:00,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 17:16:00,007 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-12-09 17:16:00,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 17:16:00,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:16:00,007 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:16:00,007 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-12-09 17:16:00,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:16:00,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1680698054, now seen corresponding path program 2 times [2018-12-09 17:16:00,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:16:00,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:16:00,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 17:16:00,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:16:00,008 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:16:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:16:00,257 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:16:00,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:16:00,258 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 17:16:00,258 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 17:16:00,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 17:16:00,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:16:00,258 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3974288-019c-4058-b127-1024c8c5fb9f/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-12-09 17:16:00,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 17:16:00,264 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 17:16:00,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 17:16:00,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 17:16:00,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:16:00,283 INFO L478 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-12-09 17:16:00,296 INFO L478 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 17:16:00,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 17:16:00,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:16:00,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:16:00,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-09 17:16:00,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 15 treesize of output 12 [2018-12-09 17:16:00,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 17:16:00,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:16:00,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:16:00,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:16:00,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-09 17:16:00,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-12-09 17:16:00,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2018-12-09 17:16:00,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 17:16:00,455 INFO L478 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 19 treesize of output 12 [2018-12-09 17:16:00,456 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:16:00,457 INFO L478 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 24 treesize of output 17 [2018-12-09 17:16:00,457 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:16:00,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2018-12-09 17:16:00,477 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-12-09 17:16:00,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-09 17:16:00,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:16:00,523 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:44, output treesize:68 [2018-12-09 17:16:00,601 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 17:16:00,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 17:16:00,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-12-09 17:16:00,970 INFO L478 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 24 treesize of output 16 [2018-12-09 17:16:00,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:16:00,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-09 17:16:00,980 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:16:00,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:16:00,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:16:00,991 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:65, output treesize:35 [2018-12-09 17:16:01,027 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 17:16:01,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 17:16:01,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2018-12-09 17:16:01,043 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 17:16:01,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-09 17:16:01,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-09 17:16:01,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2018-12-09 17:16:01,043 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 25 states. [2018-12-09 17:16:02,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:16:02,463 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-09 17:16:02,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 17:16:02,463 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 32 [2018-12-09 17:16:02,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:16:02,464 INFO L225 Difference]: With dead ends: 41 [2018-12-09 17:16:02,464 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 17:16:02,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=569, Invalid=3091, Unknown=0, NotChecked=0, Total=3660 [2018-12-09 17:16:02,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 17:16:02,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 17:16:02,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 17:16:02,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 17:16:02,465 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-12-09 17:16:02,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:16:02,465 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 17:16:02,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-09 17:16:02,465 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 17:16:02,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 17:16:02,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:16:02 BoogieIcfgContainer [2018-12-09 17:16:02,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 17:16:02,468 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 17:16:02,468 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 17:16:02,468 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 17:16:02,468 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:15:44" (3/4) ... [2018-12-09 17:16:02,470 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 17:16:02,473 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 17:16:02,473 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcmp [2018-12-09 17:16:02,474 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 17:16:02,476 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-12-09 17:16:02,476 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-09 17:16:02,476 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 17:16:02,501 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a3974288-019c-4058-b127-1024c8c5fb9f/bin-2019/utaipan/witness.graphml [2018-12-09 17:16:02,501 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 17:16:02,501 INFO L168 Benchmark]: Toolchain (without parser) took 18293.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.2 MB). Free memory was 945.9 MB in the beginning and 867.1 MB in the end (delta: 78.8 MB). Peak memory consumption was 396.0 MB. Max. memory is 11.5 GB. [2018-12-09 17:16:02,502 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 17:16:02,502 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-09 17:16:02,502 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.86 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 17:16:02,502 INFO L168 Benchmark]: Boogie Preprocessor took 18.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 17:16:02,502 INFO L168 Benchmark]: RCFGBuilder took 203.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-12-09 17:16:02,502 INFO L168 Benchmark]: TraceAbstraction took 17733.82 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 200.3 MB). Free memory was 1.1 GB in the beginning and 878.0 MB in the end (delta: 196.1 MB). Peak memory consumption was 396.4 MB. Max. memory is 11.5 GB. [2018-12-09 17:16:02,502 INFO L168 Benchmark]: Witness Printer took 32.99 ms. Allocated memory is still 1.3 GB. Free memory was 878.0 MB in the beginning and 867.1 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-12-09 17:16:02,503 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 278.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.86 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 203.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17733.82 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 200.3 MB). Free memory was 1.1 GB in the beginning and 878.0 MB in the end (delta: 196.1 MB). Peak memory consumption was 396.4 MB. Max. memory is 11.5 GB. * Witness Printer took 32.99 ms. Allocated memory is still 1.3 GB. Free memory was 878.0 MB in the beginning and 867.1 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 562]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 562]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 48 locations, 15 error locations. SAFE Result, 17.6s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 12.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 508 SDtfs, 1047 SDslu, 1903 SDs, 0 SdLazy, 2072 SolverSat, 199 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 441 GetRequests, 176 SyntacticMatches, 10 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1443 ImplicationChecksByTransitivity, 14.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 114 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 426 NumberOfCodeBlocks, 426 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 527 ConstructedInterpolants, 54 QuantifiedInterpolants, 137471 SizeOfPredicates, 92 NumberOfNonLiveVariables, 670 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 26 InterpolantComputations, 13 PerfectInterpolantSequences, 12/101 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...