./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/subseq-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_7a62e80e-4286-412c-97ae-74aa1e37a594/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7a62e80e-4286-412c-97ae-74aa1e37a594/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7a62e80e-4286-412c-97ae-74aa1e37a594/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7a62e80e-4286-412c-97ae-74aa1e37a594/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7a62e80e-4286-412c-97ae-74aa1e37a594/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7a62e80e-4286-412c-97ae-74aa1e37a594/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 1ed241b7ea3188deab01745f11227ce75decf7bc .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 03:37:09,585 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 03:37:09,586 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 03:37:09,593 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 03:37:09,593 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 03:37:09,593 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 03:37:09,594 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 03:37:09,595 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 03:37:09,596 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 03:37:09,596 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 03:37:09,597 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 03:37:09,597 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 03:37:09,598 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 03:37:09,599 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 03:37:09,599 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 03:37:09,600 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 03:37:09,600 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 03:37:09,602 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 03:37:09,603 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 03:37:09,604 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 03:37:09,605 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 03:37:09,606 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 03:37:09,607 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 03:37:09,607 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 03:37:09,607 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 03:37:09,608 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 03:37:09,609 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 03:37:09,609 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 03:37:09,610 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 03:37:09,611 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 03:37:09,611 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 03:37:09,611 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 03:37:09,611 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 03:37:09,611 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 03:37:09,612 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 03:37:09,612 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 03:37:09,612 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7a62e80e-4286-412c-97ae-74aa1e37a594/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 03:37:09,620 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 03:37:09,620 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 03:37:09,620 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 03:37:09,621 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 03:37:09,621 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 03:37:09,621 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 03:37:09,621 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 03:37:09,621 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 03:37:09,621 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 03:37:09,621 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 03:37:09,622 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 03:37:09,622 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 03:37:09,622 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 03:37:09,622 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 03:37:09,623 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 03:37:09,623 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 03:37:09,623 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 03:37:09,623 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 03:37:09,623 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 03:37:09,623 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 03:37:09,623 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 03:37:09,623 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 03:37:09,624 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 03:37:09,624 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 03:37:09,624 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 03:37:09,624 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 03:37:09,624 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 03:37:09,624 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 03:37:09,624 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 03:37:09,625 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 03:37:09,625 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 03:37:09,625 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 03:37:09,625 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 03:37:09,625 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 03:37:09,625 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 03:37:09,625 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 03:37:09,625 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_7a62e80e-4286-412c-97ae-74aa1e37a594/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 -> 1ed241b7ea3188deab01745f11227ce75decf7bc [2018-12-02 03:37:09,648 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 03:37:09,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 03:37:09,657 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 03:37:09,658 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 03:37:09,658 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 03:37:09,659 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7a62e80e-4286-412c-97ae-74aa1e37a594/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i [2018-12-02 03:37:09,695 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7a62e80e-4286-412c-97ae-74aa1e37a594/bin-2019/utaipan/data/d45c5f769/628bfa2c80604f5dbcd4e31c7a92bd88/FLAG1db2a7722 [2018-12-02 03:37:10,032 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 03:37:10,032 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7a62e80e-4286-412c-97ae-74aa1e37a594/sv-benchmarks/c/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i [2018-12-02 03:37:10,039 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7a62e80e-4286-412c-97ae-74aa1e37a594/bin-2019/utaipan/data/d45c5f769/628bfa2c80604f5dbcd4e31c7a92bd88/FLAG1db2a7722 [2018-12-02 03:37:10,047 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7a62e80e-4286-412c-97ae-74aa1e37a594/bin-2019/utaipan/data/d45c5f769/628bfa2c80604f5dbcd4e31c7a92bd88 [2018-12-02 03:37:10,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 03:37:10,049 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 03:37:10,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 03:37:10,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 03:37:10,052 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 03:37:10,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:37:10" (1/1) ... [2018-12-02 03:37:10,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c3ff299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:10, skipping insertion in model container [2018-12-02 03:37:10,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:37:10" (1/1) ... [2018-12-02 03:37:10,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 03:37:10,076 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 03:37:10,216 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:37:10,223 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 03:37:10,291 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:37:10,310 INFO L195 MainTranslator]: Completed translation [2018-12-02 03:37:10,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:10 WrapperNode [2018-12-02 03:37:10,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 03:37:10,311 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 03:37:10,311 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 03:37:10,311 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 03:37:10,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:10" (1/1) ... [2018-12-02 03:37:10,324 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:10" (1/1) ... [2018-12-02 03:37:10,328 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 03:37:10,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 03:37:10,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 03:37:10,328 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 03:37:10,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:10" (1/1) ... [2018-12-02 03:37:10,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:10" (1/1) ... [2018-12-02 03:37:10,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:10" (1/1) ... [2018-12-02 03:37:10,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:10" (1/1) ... [2018-12-02 03:37:10,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:10" (1/1) ... [2018-12-02 03:37:10,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:10" (1/1) ... [2018-12-02 03:37:10,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:10" (1/1) ... [2018-12-02 03:37:10,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 03:37:10,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 03:37:10,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 03:37:10,344 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 03:37:10,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a62e80e-4286-412c-97ae-74aa1e37a594/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-02 03:37:10,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 03:37:10,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 03:37:10,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 03:37:10,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 03:37:10,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 03:37:10,375 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 03:37:10,375 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 03:37:10,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 03:37:10,375 INFO L130 BoogieDeclarations]: Found specification of procedure subseq [2018-12-02 03:37:10,375 INFO L138 BoogieDeclarations]: Found implementation of procedure subseq [2018-12-02 03:37:10,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 03:37:10,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 03:37:10,544 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 03:37:10,544 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 03:37:10,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:37:10 BoogieIcfgContainer [2018-12-02 03:37:10,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 03:37:10,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 03:37:10,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 03:37:10,547 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 03:37:10,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:37:10" (1/3) ... [2018-12-02 03:37:10,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a74247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:37:10, skipping insertion in model container [2018-12-02 03:37:10,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:37:10" (2/3) ... [2018-12-02 03:37:10,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a74247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:37:10, skipping insertion in model container [2018-12-02 03:37:10,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:37:10" (3/3) ... [2018-12-02 03:37:10,549 INFO L112 eAbstractionObserver]: Analyzing ICFG subseq-alloca_true-valid-memsafety_true-termination.i [2018-12-02 03:37:10,555 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 03:37:10,559 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-02 03:37:10,569 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-02 03:37:10,584 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 03:37:10,584 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 03:37:10,584 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 03:37:10,584 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 03:37:10,584 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 03:37:10,584 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 03:37:10,584 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 03:37:10,584 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 03:37:10,593 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-12-02 03:37:10,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 03:37:10,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:37:10,598 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:37:10,599 INFO L423 AbstractCegarLoop]: === Iteration 1 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-02 03:37:10,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:37:10,603 INFO L82 PathProgramCache]: Analyzing trace with hash 517412817, now seen corresponding path program 1 times [2018-12-02 03:37:10,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:37:10,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:10,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:37:10,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:10,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:37:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:37:10,701 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-02 03:37:10,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:37:10,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 03:37:10,703 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:37:10,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:37:10,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:37:10,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:37:10,715 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2018-12-02 03:37:10,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:37:10,757 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-12-02 03:37:10,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:37:10,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 03:37:10,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:37:10,763 INFO L225 Difference]: With dead ends: 46 [2018-12-02 03:37:10,763 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 03:37:10,764 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-02 03:37:10,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 03:37:10,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-02 03:37:10,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 03:37:10,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-02 03:37:10,785 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 10 [2018-12-02 03:37:10,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:37:10,785 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-02 03:37:10,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:37:10,786 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-02 03:37:10,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 03:37:10,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:37:10,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:37:10,786 INFO L423 AbstractCegarLoop]: === Iteration 2 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-02 03:37:10,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:37:10,786 INFO L82 PathProgramCache]: Analyzing trace with hash 517412818, now seen corresponding path program 1 times [2018-12-02 03:37:10,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:37:10,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:10,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:37:10,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:10,787 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:37:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:37:10,825 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-02 03:37:10,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:37:10,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:37:10,826 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:37:10,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:37:10,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:37:10,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:37:10,828 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-12-02 03:37:10,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:37:10,844 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-12-02 03:37:10,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:37:10,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-02 03:37:10,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:37:10,845 INFO L225 Difference]: With dead ends: 42 [2018-12-02 03:37:10,845 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 03:37:10,846 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-02 03:37:10,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 03:37:10,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-02 03:37:10,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 03:37:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-12-02 03:37:10,849 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 10 [2018-12-02 03:37:10,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:37:10,850 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-12-02 03:37:10,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:37:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-12-02 03:37:10,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 03:37:10,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:37:10,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:37:10,850 INFO L423 AbstractCegarLoop]: === Iteration 3 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-02 03:37:10,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:37:10,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1140071817, now seen corresponding path program 1 times [2018-12-02 03:37:10,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:37:10,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:10,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:37:10,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:10,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:37:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:37:10,870 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-02 03:37:10,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:37:10,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 03:37:10,871 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:37:10,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:37:10,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:37:10,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:37:10,871 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 3 states. [2018-12-02 03:37:10,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:37:10,890 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-12-02 03:37:10,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:37:10,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-02 03:37:10,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:37:10,891 INFO L225 Difference]: With dead ends: 41 [2018-12-02 03:37:10,891 INFO L226 Difference]: Without dead ends: 41 [2018-12-02 03:37:10,892 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-02 03:37:10,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-02 03:37:10,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-02 03:37:10,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 03:37:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-12-02 03:37:10,895 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 11 [2018-12-02 03:37:10,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:37:10,895 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-12-02 03:37:10,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:37:10,896 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-12-02 03:37:10,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 03:37:10,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:37:10,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:37:10,896 INFO L423 AbstractCegarLoop]: === Iteration 4 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-02 03:37:10,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:37:10,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1140071816, now seen corresponding path program 1 times [2018-12-02 03:37:10,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:37:10,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:10,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:37:10,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:10,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:37:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:37:10,932 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-02 03:37:10,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:37:10,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:37:10,932 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:37:10,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:37:10,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:37:10,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:37:10,933 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 4 states. [2018-12-02 03:37:10,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:37:10,943 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-12-02 03:37:10,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:37:10,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-02 03:37:10,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:37:10,944 INFO L225 Difference]: With dead ends: 40 [2018-12-02 03:37:10,944 INFO L226 Difference]: Without dead ends: 40 [2018-12-02 03:37:10,944 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-02 03:37:10,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-02 03:37:10,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-02 03:37:10,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 03:37:10,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-02 03:37:10,947 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 11 [2018-12-02 03:37:10,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:37:10,947 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-02 03:37:10,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:37:10,947 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-12-02 03:37:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 03:37:10,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:37:10,947 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:37:10,947 INFO L423 AbstractCegarLoop]: === Iteration 5 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-02 03:37:10,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:37:10,947 INFO L82 PathProgramCache]: Analyzing trace with hash 721924641, now seen corresponding path program 1 times [2018-12-02 03:37:10,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:37:10,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:10,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:37:10,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:10,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:37:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:37:10,975 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-02 03:37:10,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:37:10,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:37:10,975 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:37:10,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:37:10,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:37:10,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:37:10,976 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 5 states. [2018-12-02 03:37:11,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:37:11,014 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-12-02 03:37:11,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:37:11,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-02 03:37:11,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:37:11,015 INFO L225 Difference]: With dead ends: 38 [2018-12-02 03:37:11,015 INFO L226 Difference]: Without dead ends: 38 [2018-12-02 03:37:11,015 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-02 03:37:11,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-02 03:37:11,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-02 03:37:11,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-02 03:37:11,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-12-02 03:37:11,018 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 14 [2018-12-02 03:37:11,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:37:11,018 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-02 03:37:11,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:37:11,018 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-12-02 03:37:11,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 03:37:11,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:37:11,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:37:11,019 INFO L423 AbstractCegarLoop]: === Iteration 6 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-02 03:37:11,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:37:11,019 INFO L82 PathProgramCache]: Analyzing trace with hash 721924642, now seen corresponding path program 1 times [2018-12-02 03:37:11,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:37:11,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:11,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:37:11,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:11,020 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:37:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:37:11,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-02 03:37:11,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:37:11,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:37:11,089 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:37:11,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:37:11,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:37:11,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:37:11,090 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 7 states. [2018-12-02 03:37:11,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:37:11,154 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-12-02 03:37:11,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:37:11,154 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-12-02 03:37:11,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:37:11,156 INFO L225 Difference]: With dead ends: 58 [2018-12-02 03:37:11,156 INFO L226 Difference]: Without dead ends: 58 [2018-12-02 03:37:11,157 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-02 03:37:11,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-02 03:37:11,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2018-12-02 03:37:11,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-02 03:37:11,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-12-02 03:37:11,160 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 14 [2018-12-02 03:37:11,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:37:11,160 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2018-12-02 03:37:11,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:37:11,161 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2018-12-02 03:37:11,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 03:37:11,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:37:11,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:37:11,161 INFO L423 AbstractCegarLoop]: === Iteration 7 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-02 03:37:11,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:37:11,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1955709197, now seen corresponding path program 1 times [2018-12-02 03:37:11,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:37:11,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:11,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:37:11,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:11,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:37:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:37:11,209 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-02 03:37:11,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:37:11,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:37:11,210 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:37:11,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:37:11,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:37:11,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:37:11,210 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 7 states. [2018-12-02 03:37:11,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:37:11,264 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2018-12-02 03:37:11,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:37:11,264 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-02 03:37:11,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:37:11,264 INFO L225 Difference]: With dead ends: 66 [2018-12-02 03:37:11,264 INFO L226 Difference]: Without dead ends: 66 [2018-12-02 03:37:11,265 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-02 03:37:11,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-02 03:37:11,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2018-12-02 03:37:11,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 03:37:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2018-12-02 03:37:11,268 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 17 [2018-12-02 03:37:11,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:37:11,268 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2018-12-02 03:37:11,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:37:11,268 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2018-12-02 03:37:11,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 03:37:11,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:37:11,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:37:11,268 INFO L423 AbstractCegarLoop]: === Iteration 8 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-02 03:37:11,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:37:11,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1955709196, now seen corresponding path program 1 times [2018-12-02 03:37:11,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:37:11,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:11,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:37:11,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:11,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:37:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:37:11,289 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-02 03:37:11,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:37:11,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:37:11,289 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:37:11,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:37:11,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:37:11,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:37:11,290 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand 5 states. [2018-12-02 03:37:11,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:37:11,330 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2018-12-02 03:37:11,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:37:11,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-02 03:37:11,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:37:11,331 INFO L225 Difference]: With dead ends: 54 [2018-12-02 03:37:11,331 INFO L226 Difference]: Without dead ends: 54 [2018-12-02 03:37:11,331 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-02 03:37:11,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-02 03:37:11,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-02 03:37:11,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-02 03:37:11,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2018-12-02 03:37:11,334 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 17 [2018-12-02 03:37:11,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:37:11,334 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-12-02 03:37:11,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:37:11,334 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2018-12-02 03:37:11,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 03:37:11,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:37:11,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:37:11,335 INFO L423 AbstractCegarLoop]: === Iteration 9 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-02 03:37:11,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:37:11,335 INFO L82 PathProgramCache]: Analyzing trace with hash 2043344466, now seen corresponding path program 1 times [2018-12-02 03:37:11,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:37:11,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:11,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:37:11,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:11,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:37:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:37:11,352 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-02 03:37:11,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:37:11,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:37:11,353 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:37:11,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:37:11,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:37:11,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:37:11,353 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 3 states. [2018-12-02 03:37:11,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:37:11,361 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-12-02 03:37:11,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:37:11,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 03:37:11,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:37:11,363 INFO L225 Difference]: With dead ends: 57 [2018-12-02 03:37:11,363 INFO L226 Difference]: Without dead ends: 57 [2018-12-02 03:37:11,363 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-02 03:37:11,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-02 03:37:11,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-12-02 03:37:11,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-02 03:37:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2018-12-02 03:37:11,368 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 22 [2018-12-02 03:37:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:37:11,368 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2018-12-02 03:37:11,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:37:11,368 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2018-12-02 03:37:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 03:37:11,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:37:11,369 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] [2018-12-02 03:37:11,369 INFO L423 AbstractCegarLoop]: === Iteration 10 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-02 03:37:11,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:37:11,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1915233495, now seen corresponding path program 1 times [2018-12-02 03:37:11,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:37:11,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:11,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:37:11,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:11,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:37:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:37:11,411 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-02 03:37:11,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:37:11,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:37:11,412 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:37:11,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:37:11,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:37:11,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:37:11,413 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 4 states. [2018-12-02 03:37:11,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:37:11,452 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2018-12-02 03:37:11,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:37:11,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-12-02 03:37:11,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:37:11,453 INFO L225 Difference]: With dead ends: 55 [2018-12-02 03:37:11,453 INFO L226 Difference]: Without dead ends: 48 [2018-12-02 03:37:11,453 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-02 03:37:11,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-02 03:37:11,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-02 03:37:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-02 03:37:11,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2018-12-02 03:37:11,456 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 23 [2018-12-02 03:37:11,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:37:11,456 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2018-12-02 03:37:11,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:37:11,457 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-12-02 03:37:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 03:37:11,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:37:11,457 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] [2018-12-02 03:37:11,457 INFO L423 AbstractCegarLoop]: === Iteration 11 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-02 03:37:11,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:37:11,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1597979023, now seen corresponding path program 1 times [2018-12-02 03:37:11,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:37:11,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:11,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:37:11,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:11,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:37:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:37:11,554 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-02 03:37:11,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:37:11,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 03:37:11,555 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:37:11,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 03:37:11,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 03:37:11,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:37:11,555 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 9 states. [2018-12-02 03:37:11,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:37:11,647 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-12-02 03:37:11,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 03:37:11,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-12-02 03:37:11,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:37:11,648 INFO L225 Difference]: With dead ends: 57 [2018-12-02 03:37:11,648 INFO L226 Difference]: Without dead ends: 48 [2018-12-02 03:37:11,648 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-02 03:37:11,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-02 03:37:11,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-02 03:37:11,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-02 03:37:11,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-12-02 03:37:11,651 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 24 [2018-12-02 03:37:11,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:37:11,652 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-12-02 03:37:11,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 03:37:11,652 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-12-02 03:37:11,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 03:37:11,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:37:11,652 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] [2018-12-02 03:37:11,653 INFO L423 AbstractCegarLoop]: === Iteration 12 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-02 03:37:11,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:37:11,653 INFO L82 PathProgramCache]: Analyzing trace with hash -396165683, now seen corresponding path program 1 times [2018-12-02 03:37:11,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:37:11,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:11,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:37:11,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:11,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:37:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:37:11,797 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-02 03:37:11,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:37:11,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:37:11,797 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-02 03:37:11,799 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [7], [9], [10], [13], [14], [17], [25], [26], [29], [34], [38], [53], [58], [64], [66], [67], [70], [77], [78], [79], [81] [2018-12-02 03:37:11,820 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:37:11,820 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:37:11,993 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:37:11,994 INFO L272 AbstractInterpreter]: Visited 24 different actions 56 times. Merged at 11 different actions 32 times. Widened at 1 different actions 1 times. Performed 506 root evaluator evaluations with a maximum evaluation depth of 3. Performed 506 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-12-02 03:37:12,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:37:12,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:37:12,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:37:12,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a62e80e-4286-412c-97ae-74aa1e37a594/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-02 03:37:12,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:37:12,010 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:37:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:37:12,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:37:12,067 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-02 03:37:12,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:37:12,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:37:12,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-02 03:37:12,086 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-02 03:37:12,088 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-02 03:37:12,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:37:12,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:37:12,094 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-02 03:37:12,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-02 03:37:12,125 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-02 03:37:12,127 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-02 03:37:12,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:37:12,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:37:12,141 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-02 03:37:12,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-02 03:37:13,519 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 43 [2018-12-02 03:37:13,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2018-12-02 03:37:13,606 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 41 treesize of output 33 [2018-12-02 03:37:13,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:37:13,645 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 41 treesize of output 39 [2018-12-02 03:37:13,645 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 03:37:13,680 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 31 treesize of output 23 [2018-12-02 03:37:13,681 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 03:37:13,682 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 35 treesize of output 27 [2018-12-02 03:37:13,682 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 03:37:13,727 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 29 treesize of output 35 [2018-12-02 03:37:13,728 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-12-02 03:37:13,780 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-02 03:37:13,780 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 03:37:13,782 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 27 treesize of output 20 [2018-12-02 03:37:13,783 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 03:37:13,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2018-12-02 03:37:13,841 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-12-02 03:37:13,902 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 37 treesize of output 29 [2018-12-02 03:37:13,902 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 03:37:13,963 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-02 03:37:13,964 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-12-02 03:37:14,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-02 03:37:14,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 03:37:14,051 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-12-02 03:37:14,103 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-02 03:37:14,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:37:14,499 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-02 03:37:14,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:37:14,515 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-02 03:37:14,546 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-02 03:37:14,546 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 03:37:14,557 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 16 treesize of output 14 [2018-12-02 03:37:14,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 03:37:14,567 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-02 03:37:14,568 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 03:37:14,571 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:37:14,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:37:14,579 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:69, output treesize:7 [2018-12-02 03:37:14,591 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-02 03:37:14,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 03:37:14,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 12] total 31 [2018-12-02 03:37:14,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 03:37:14,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 03:37:14,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 03:37:14,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2018-12-02 03:37:14,607 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 22 states. [2018-12-02 03:37:17,067 WARN L180 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-12-02 03:37:17,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:37:17,295 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-12-02 03:37:17,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 03:37:17,295 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2018-12-02 03:37:17,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:37:17,296 INFO L225 Difference]: With dead ends: 51 [2018-12-02 03:37:17,296 INFO L226 Difference]: Without dead ends: 51 [2018-12-02 03:37:17,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=451, Invalid=1999, Unknown=0, NotChecked=0, Total=2450 [2018-12-02 03:37:17,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-02 03:37:17,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2018-12-02 03:37:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-02 03:37:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-12-02 03:37:17,300 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 24 [2018-12-02 03:37:17,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:37:17,300 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-12-02 03:37:17,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 03:37:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-12-02 03:37:17,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 03:37:17,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:37:17,301 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:37:17,301 INFO L423 AbstractCegarLoop]: === Iteration 13 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-02 03:37:17,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:37:17,302 INFO L82 PathProgramCache]: Analyzing trace with hash 398217602, now seen corresponding path program 1 times [2018-12-02 03:37:17,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:37:17,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:17,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:37:17,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:17,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:37:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:37:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:37:17,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:37:17,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:37:17,475 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-12-02 03:37:17,475 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [7], [10], [13], [14], [16], [17], [25], [26], [29], [34], [38], [53], [58], [64], [66], [67], [70], [77], [78], [79], [81] [2018-12-02 03:37:17,476 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:37:17,476 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:37:17,536 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:37:17,537 INFO L272 AbstractInterpreter]: Visited 24 different actions 67 times. Merged at 11 different actions 43 times. Never widened. Performed 641 root evaluator evaluations with a maximum evaluation depth of 3. Performed 641 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-12-02 03:37:17,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:37:17,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:37:17,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:37:17,538 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a62e80e-4286-412c-97ae-74aa1e37a594/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-02 03:37:17,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:37:17,545 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:37:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:37:17,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:37:17,566 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-02 03:37:17,568 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-02 03:37:17,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:37:17,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:37:17,574 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-02 03:37:17,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-02 03:37:17,630 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 18 treesize of output 14 [2018-12-02 03:37:17,635 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-02 03:37:17,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 03:37:17,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 03:37:17,645 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-02 03:37:17,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-12-02 03:37:17,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:37:17,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:37:17,859 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-02 03:37:17,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:37:17,865 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-02 03:37:17,871 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-02 03:37:17,872 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 03:37:17,872 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:37:17,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:37:17,876 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-12-02 03:37:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:37:17,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 03:37:17,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 26 [2018-12-02 03:37:17,895 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 03:37:17,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 03:37:17,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 03:37:17,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2018-12-02 03:37:17,896 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 20 states. [2018-12-02 03:37:19,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:37:19,398 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-12-02 03:37:19,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 03:37:19,398 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2018-12-02 03:37:19,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:37:19,399 INFO L225 Difference]: With dead ends: 50 [2018-12-02 03:37:19,399 INFO L226 Difference]: Without dead ends: 48 [2018-12-02 03:37:19,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=242, Invalid=1164, Unknown=0, NotChecked=0, Total=1406 [2018-12-02 03:37:19,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-02 03:37:19,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-12-02 03:37:19,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 03:37:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-12-02 03:37:19,401 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 27 [2018-12-02 03:37:19,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:37:19,401 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-12-02 03:37:19,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 03:37:19,401 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-12-02 03:37:19,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 03:37:19,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:37:19,402 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:37:19,402 INFO L423 AbstractCegarLoop]: === Iteration 14 === [subseqErr3REQUIRES_VIOLATION, subseqErr8REQUIRES_VIOLATION, subseqErr2REQUIRES_VIOLATION, subseqErr7REQUIRES_VIOLATION, subseqErr1REQUIRES_VIOLATION, subseqErr6REQUIRES_VIOLATION, subseqErr0REQUIRES_VIOLATION, subseqErr5REQUIRES_VIOLATION, subseqErr4REQUIRES_VIOLATION, subseqErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-02 03:37:19,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:37:19,402 INFO L82 PathProgramCache]: Analyzing trace with hash -431576907, now seen corresponding path program 2 times [2018-12-02 03:37:19,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:37:19,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:19,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:37:19,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:37:19,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:37:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:37:19,800 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:37:19,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:37:19,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:37:19,801 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 03:37:19,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 03:37:19,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:37:19,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a62e80e-4286-412c-97ae-74aa1e37a594/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-02 03:37:19,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 03:37:19,813 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 03:37:19,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 03:37:19,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 03:37:19,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:37:19,856 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-02 03:37:19,868 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-02 03:37:19,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 03:37:19,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 03:37:19,890 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-02 03:37:19,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-02 03:37:19,907 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-02 03:37:19,908 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-02 03:37:19,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:37:19,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:37:19,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:37:19,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-02 03:37:19,946 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 19 treesize of output 15 [2018-12-02 03:37:19,951 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-02 03:37:19,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 03:37:19,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 03:37:19,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 03:37:19,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-12-02 03:37:20,035 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 03:37:20,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:37:20,230 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-02 03:37:20,238 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-02 03:37:20,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:37:20,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:37:20,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 03:37:20,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-12-02 03:37:20,293 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 03:37:20,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 03:37:20,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 30 [2018-12-02 03:37:20,308 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 03:37:20,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-02 03:37:20,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-02 03:37:20,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=0, NotChecked=0, Total=930 [2018-12-02 03:37:20,309 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 23 states. [2018-12-02 03:37:21,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:37:21,067 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-12-02 03:37:21,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 03:37:21,068 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 37 [2018-12-02 03:37:21,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:37:21,068 INFO L225 Difference]: With dead ends: 45 [2018-12-02 03:37:21,068 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 03:37:21,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=393, Invalid=1959, Unknown=0, NotChecked=0, Total=2352 [2018-12-02 03:37:21,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 03:37:21,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 03:37:21,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 03:37:21,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 03:37:21,069 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-12-02 03:37:21,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:37:21,069 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 03:37:21,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-02 03:37:21,069 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 03:37:21,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 03:37:21,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:37:21 BoogieIcfgContainer [2018-12-02 03:37:21,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 03:37:21,072 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 03:37:21,072 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 03:37:21,072 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 03:37:21,073 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:37:10" (3/4) ... [2018-12-02 03:37:21,075 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 03:37:21,078 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 03:37:21,078 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure subseq [2018-12-02 03:37:21,079 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 03:37:21,081 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-12-02 03:37:21,081 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-02 03:37:21,081 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 03:37:21,108 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7a62e80e-4286-412c-97ae-74aa1e37a594/bin-2019/utaipan/witness.graphml [2018-12-02 03:37:21,108 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 03:37:21,108 INFO L168 Benchmark]: Toolchain (without parser) took 11059.53 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.0 MB). Free memory was 948.1 MB in the beginning and 976.6 MB in the end (delta: -28.5 MB). Peak memory consumption was 285.5 MB. Max. memory is 11.5 GB. [2018-12-02 03:37:21,109 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:37:21,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-02 03:37:21,109 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-02 03:37:21,110 INFO L168 Benchmark]: Boogie Preprocessor took 15.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:37:21,110 INFO L168 Benchmark]: RCFGBuilder took 200.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-12-02 03:37:21,110 INFO L168 Benchmark]: TraceAbstraction took 10526.61 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 976.6 MB in the end (delta: 127.4 MB). Peak memory consumption was 298.3 MB. Max. memory is 11.5 GB. [2018-12-02 03:37:21,110 INFO L168 Benchmark]: Witness Printer took 35.79 ms. Allocated memory is still 1.3 GB. Free memory is still 976.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:37:21,111 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 200.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10526.61 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 976.6 MB in the end (delta: 127.4 MB). Peak memory consumption was 298.3 MB. Max. memory is 11.5 GB. * Witness Printer took 35.79 ms. Allocated memory is still 1.3 GB. Free memory is still 976.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 565]: 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, 47 locations, 15 error locations. SAFE Result, 10.4s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 430 SDtfs, 716 SDslu, 1131 SDs, 0 SdLazy, 1365 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 138 SyntacticMatches, 6 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 37 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 349 NumberOfCodeBlocks, 349 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 417 ConstructedInterpolants, 42 QuantifiedInterpolants, 121773 SizeOfPredicates, 50 NumberOfNonLiveVariables, 450 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 20 InterpolantComputations, 11 PerfectInterpolantSequences, 10/71 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...