./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrpbrk-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_5ee721ab-32f1-46ac-85ed-1cae6b3748c0/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5ee721ab-32f1-46ac-85ed-1cae6b3748c0/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5ee721ab-32f1-46ac-85ed-1cae6b3748c0/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5ee721ab-32f1-46ac-85ed-1cae6b3748c0/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5ee721ab-32f1-46ac-85ed-1cae6b3748c0/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5ee721ab-32f1-46ac-85ed-1cae6b3748c0/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 61682d2c31dd7110d61be8ccb8e4bbb3882eca20 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 16:57:16,414 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 16:57:16,415 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 16:57:16,421 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 16:57:16,421 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 16:57:16,422 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 16:57:16,422 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 16:57:16,423 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 16:57:16,424 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 16:57:16,425 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 16:57:16,425 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 16:57:16,425 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 16:57:16,426 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 16:57:16,426 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 16:57:16,427 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 16:57:16,427 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 16:57:16,428 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 16:57:16,429 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 16:57:16,430 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 16:57:16,430 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 16:57:16,431 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 16:57:16,432 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 16:57:16,433 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 16:57:16,433 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 16:57:16,433 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 16:57:16,434 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 16:57:16,434 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 16:57:16,435 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 16:57:16,435 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 16:57:16,435 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 16:57:16,436 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 16:57:16,436 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 16:57:16,436 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 16:57:16,436 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 16:57:16,437 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 16:57:16,437 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 16:57:16,437 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5ee721ab-32f1-46ac-85ed-1cae6b3748c0/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 16:57:16,445 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 16:57:16,445 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 16:57:16,446 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 16:57:16,446 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 16:57:16,446 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 16:57:16,446 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 16:57:16,446 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 16:57:16,446 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 16:57:16,446 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 16:57:16,446 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 16:57:16,446 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 16:57:16,446 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 16:57:16,447 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 16:57:16,447 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 16:57:16,447 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 16:57:16,447 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 16:57:16,447 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 16:57:16,447 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 16:57:16,447 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 16:57:16,447 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 16:57:16,448 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 16:57:16,448 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 16:57:16,448 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 16:57:16,448 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 16:57:16,448 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 16:57:16,448 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 16:57:16,448 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 16:57:16,448 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 16:57:16,448 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 16:57:16,448 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 16:57:16,449 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 16:57:16,449 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 16:57:16,449 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 16:57:16,449 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 16:57:16,449 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 16:57:16,449 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 16:57:16,449 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_5ee721ab-32f1-46ac-85ed-1cae6b3748c0/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 -> 61682d2c31dd7110d61be8ccb8e4bbb3882eca20 [2018-12-09 16:57:16,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 16:57:16,474 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 16:57:16,476 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 16:57:16,476 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 16:57:16,477 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 16:57:16,477 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5ee721ab-32f1-46ac-85ed-1cae6b3748c0/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-12-09 16:57:16,512 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5ee721ab-32f1-46ac-85ed-1cae6b3748c0/bin-2019/utaipan/data/635eea00e/4bc0e36f3a354dd28fe84d52ae9a4f13/FLAG23e54c43a [2018-12-09 16:57:16,968 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 16:57:16,969 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5ee721ab-32f1-46ac-85ed-1cae6b3748c0/sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-12-09 16:57:16,977 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5ee721ab-32f1-46ac-85ed-1cae6b3748c0/bin-2019/utaipan/data/635eea00e/4bc0e36f3a354dd28fe84d52ae9a4f13/FLAG23e54c43a [2018-12-09 16:57:16,988 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5ee721ab-32f1-46ac-85ed-1cae6b3748c0/bin-2019/utaipan/data/635eea00e/4bc0e36f3a354dd28fe84d52ae9a4f13 [2018-12-09 16:57:16,990 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 16:57:16,991 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 16:57:16,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 16:57:16,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 16:57:16,994 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 16:57:16,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:57:16" (1/1) ... [2018-12-09 16:57:16,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23ef7631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:16, skipping insertion in model container [2018-12-09 16:57:16,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:57:16" (1/1) ... [2018-12-09 16:57:17,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 16:57:17,017 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 16:57:17,161 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:57:17,167 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 16:57:17,220 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:57:17,239 INFO L195 MainTranslator]: Completed translation [2018-12-09 16:57:17,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:17 WrapperNode [2018-12-09 16:57:17,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 16:57:17,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 16:57:17,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 16:57:17,240 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 16:57:17,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:17" (1/1) ... [2018-12-09 16:57:17,253 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:17" (1/1) ... [2018-12-09 16:57:17,258 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 16:57:17,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 16:57:17,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 16:57:17,258 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 16:57:17,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:17" (1/1) ... [2018-12-09 16:57:17,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:17" (1/1) ... [2018-12-09 16:57:17,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:17" (1/1) ... [2018-12-09 16:57:17,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:17" (1/1) ... [2018-12-09 16:57:17,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:17" (1/1) ... [2018-12-09 16:57:17,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:17" (1/1) ... [2018-12-09 16:57:17,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:17" (1/1) ... [2018-12-09 16:57:17,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 16:57:17,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 16:57:17,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 16:57:17,275 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 16:57:17,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5ee721ab-32f1-46ac-85ed-1cae6b3748c0/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 16:57:17,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 16:57:17,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 16:57:17,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 16:57:17,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 16:57:17,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 16:57:17,307 INFO L130 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-12-09 16:57:17,307 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-12-09 16:57:17,307 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 16:57:17,307 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 16:57:17,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 16:57:17,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 16:57:17,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 16:57:17,463 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 16:57:17,463 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 16:57:17,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:57:17 BoogieIcfgContainer [2018-12-09 16:57:17,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 16:57:17,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 16:57:17,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 16:57:17,465 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 16:57:17,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:57:16" (1/3) ... [2018-12-09 16:57:17,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c335f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:57:17, skipping insertion in model container [2018-12-09 16:57:17,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:17" (2/3) ... [2018-12-09 16:57:17,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c335f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:57:17, skipping insertion in model container [2018-12-09 16:57:17,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:57:17" (3/3) ... [2018-12-09 16:57:17,467 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-12-09 16:57:17,473 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 16:57:17,478 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-09 16:57:17,486 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-09 16:57:17,501 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 16:57:17,501 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 16:57:17,501 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 16:57:17,501 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 16:57:17,501 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 16:57:17,501 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 16:57:17,501 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 16:57:17,501 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 16:57:17,510 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-12-09 16:57:17,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 16:57:17,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:57:17,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:57:17,517 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 16:57:17,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:57:17,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1987032655, now seen corresponding path program 1 times [2018-12-09 16:57:17,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:57:17,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:17,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:57:17,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:17,556 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:57:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:57:17,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:57:17,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:57:17,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:57:17,645 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:57:17,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:57:17,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:57:17,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:57:17,657 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2018-12-09 16:57:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:57:17,694 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-12-09 16:57:17,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:57:17,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 16:57:17,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:57:17,701 INFO L225 Difference]: With dead ends: 48 [2018-12-09 16:57:17,701 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 16:57:17,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:57:17,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 16:57:17,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-09 16:57:17,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 16:57:17,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-12-09 16:57:17,722 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 10 [2018-12-09 16:57:17,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:57:17,722 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-12-09 16:57:17,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:57:17,723 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-12-09 16:57:17,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 16:57:17,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:57:17,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:57:17,724 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 16:57:17,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:57:17,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1987032656, now seen corresponding path program 1 times [2018-12-09 16:57:17,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:57:17,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:17,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:57:17,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:17,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:57:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:57:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:57:17,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:57:17,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:57:17,775 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:57:17,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:57:17,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:57:17,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:57:17,777 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 4 states. [2018-12-09 16:57:17,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:57:17,796 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-12-09 16:57:17,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 16:57:17,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 16:57:17,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:57:17,797 INFO L225 Difference]: With dead ends: 44 [2018-12-09 16:57:17,798 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 16:57:17,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:57:17,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 16:57:17,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 16:57:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 16:57:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-09 16:57:17,802 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 10 [2018-12-09 16:57:17,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:57:17,802 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-09 16:57:17,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:57:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-09 16:57:17,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 16:57:17,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:57:17,802 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:57:17,803 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 16:57:17,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:57:17,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1468470210, now seen corresponding path program 1 times [2018-12-09 16:57:17,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:57:17,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:17,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:57:17,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:17,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:57:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:57:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:57:17,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:57:17,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:57:17,852 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:57:17,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:57:17,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:57:17,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:57:17,853 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 4 states. [2018-12-09 16:57:17,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:57:17,866 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-12-09 16:57:17,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 16:57:17,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-09 16:57:17,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:57:17,867 INFO L225 Difference]: With dead ends: 43 [2018-12-09 16:57:17,867 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 16:57:17,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:57:17,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 16:57:17,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 16:57:17,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 16:57:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-09 16:57:17,871 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2018-12-09 16:57:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:57:17,872 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-09 16:57:17,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:57:17,872 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-09 16:57:17,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 16:57:17,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:57:17,872 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:57:17,873 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 16:57:17,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:57:17,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1468470209, now seen corresponding path program 1 times [2018-12-09 16:57:17,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:57:17,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:17,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:57:17,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:17,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:57:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:57:17,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:57:17,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:57:17,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:57:17,894 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:57:17,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:57:17,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:57:17,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:57:17,895 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 3 states. [2018-12-09 16:57:17,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:57:17,912 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-12-09 16:57:17,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:57:17,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 16:57:17,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:57:17,913 INFO L225 Difference]: With dead ends: 42 [2018-12-09 16:57:17,913 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 16:57:17,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:57:17,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 16:57:17,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 16:57:17,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 16:57:17,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-12-09 16:57:17,915 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 11 [2018-12-09 16:57:17,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:57:17,915 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-12-09 16:57:17,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:57:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-12-09 16:57:17,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 16:57:17,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:57:17,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:57:17,916 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 16:57:17,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:57:17,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1340824930, now seen corresponding path program 1 times [2018-12-09 16:57:17,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:57:17,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:17,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:57:17,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:17,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:57:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:57:17,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:57:17,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:57:17,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:57:17,952 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:57:17,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:57:17,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:57:17,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:57:17,952 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2018-12-09 16:57:17,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:57:17,987 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-12-09 16:57:17,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:57:17,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-09 16:57:17,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:57:17,988 INFO L225 Difference]: With dead ends: 40 [2018-12-09 16:57:17,988 INFO L226 Difference]: Without dead ends: 40 [2018-12-09 16:57:17,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:57:17,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-09 16:57:17,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-09 16:57:17,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 16:57:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-09 16:57:17,990 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 14 [2018-12-09 16:57:17,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:57:17,990 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-09 16:57:17,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:57:17,990 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-12-09 16:57:17,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 16:57:17,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:57:17,990 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:57:17,991 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 16:57:17,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:57:17,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1340824929, now seen corresponding path program 1 times [2018-12-09 16:57:17,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:57:17,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:17,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:57:17,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:17,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:57:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:57:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:57:18,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:57:18,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 16:57:18,034 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:57:18,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 16:57:18,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 16:57:18,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:57:18,035 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 7 states. [2018-12-09 16:57:18,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:57:18,107 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-12-09 16:57:18,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:57:18,107 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-12-09 16:57:18,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:57:18,109 INFO L225 Difference]: With dead ends: 62 [2018-12-09 16:57:18,109 INFO L226 Difference]: Without dead ends: 62 [2018-12-09 16:57:18,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 16:57:18,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-09 16:57:18,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-12-09 16:57:18,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 16:57:18,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-12-09 16:57:18,113 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 14 [2018-12-09 16:57:18,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:57:18,113 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-12-09 16:57:18,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 16:57:18,113 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-12-09 16:57:18,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 16:57:18,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:57:18,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:57:18,114 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 16:57:18,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:57:18,115 INFO L82 PathProgramCache]: Analyzing trace with hash 2040408996, now seen corresponding path program 1 times [2018-12-09 16:57:18,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:57:18,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:18,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:57:18,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:18,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:57:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:57:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:57:18,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:57:18,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:57:18,143 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:57:18,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:57:18,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:57:18,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:57:18,144 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 6 states. [2018-12-09 16:57:18,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:57:18,193 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-12-09 16:57:18,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:57:18,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-09 16:57:18,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:57:18,194 INFO L225 Difference]: With dead ends: 43 [2018-12-09 16:57:18,194 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 16:57:18,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 16:57:18,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 16:57:18,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-12-09 16:57:18,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 16:57:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-12-09 16:57:18,196 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 18 [2018-12-09 16:57:18,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:57:18,196 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-09 16:57:18,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:57:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-12-09 16:57:18,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 16:57:18,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:57:18,197 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:57:18,197 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 16:57:18,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:57:18,197 INFO L82 PathProgramCache]: Analyzing trace with hash 2040408997, now seen corresponding path program 1 times [2018-12-09 16:57:18,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:57:18,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:18,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:57:18,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:18,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:57:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:57:18,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:57:18,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:57:18,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 16:57:18,276 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:57:18,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 16:57:18,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 16:57:18,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 16:57:18,277 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2018-12-09 16:57:18,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:57:18,357 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-12-09 16:57:18,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 16:57:18,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-09 16:57:18,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:57:18,358 INFO L225 Difference]: With dead ends: 55 [2018-12-09 16:57:18,358 INFO L226 Difference]: Without dead ends: 55 [2018-12-09 16:57:18,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-09 16:57:18,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-09 16:57:18,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-12-09 16:57:18,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 16:57:18,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-12-09 16:57:18,361 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 18 [2018-12-09 16:57:18,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:57:18,361 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-12-09 16:57:18,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 16:57:18,361 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-12-09 16:57:18,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 16:57:18,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:57:18,362 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] [2018-12-09 16:57:18,362 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 16:57:18,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:57:18,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1984220883, now seen corresponding path program 1 times [2018-12-09 16:57:18,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:57:18,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:18,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:57:18,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:18,363 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:57:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:57:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:57:18,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:57:18,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:57:18,398 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:57:18,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:57:18,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:57:18,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:57:18,399 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 4 states. [2018-12-09 16:57:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:57:18,432 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-12-09 16:57:18,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 16:57:18,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-09 16:57:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:57:18,433 INFO L225 Difference]: With dead ends: 46 [2018-12-09 16:57:18,433 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 16:57:18,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:57:18,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 16:57:18,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-09 16:57:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 16:57:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-12-09 16:57:18,435 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 20 [2018-12-09 16:57:18,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:57:18,436 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-12-09 16:57:18,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:57:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-12-09 16:57:18,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 16:57:18,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:57:18,436 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:57:18,437 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 16:57:18,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:57:18,437 INFO L82 PathProgramCache]: Analyzing trace with hash -510295044, now seen corresponding path program 1 times [2018-12-09 16:57:18,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:57:18,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:18,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:57:18,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:18,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:57:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:57:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:57:18,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:57:18,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:57:18,452 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:57:18,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:57:18,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:57:18,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:57:18,453 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2018-12-09 16:57:18,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:57:18,458 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-12-09 16:57:18,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:57:18,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 16:57:18,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:57:18,459 INFO L225 Difference]: With dead ends: 43 [2018-12-09 16:57:18,459 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 16:57:18,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:57:18,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 16:57:18,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 16:57:18,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 16:57:18,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-12-09 16:57:18,462 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 22 [2018-12-09 16:57:18,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:57:18,462 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-12-09 16:57:18,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:57:18,463 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-12-09 16:57:18,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 16:57:18,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:57:18,463 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-09 16:57:18,463 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 16:57:18,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:57:18,464 INFO L82 PathProgramCache]: Analyzing trace with hash -773125415, now seen corresponding path program 1 times [2018-12-09 16:57:18,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:57:18,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:18,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:57:18,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:18,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:57:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:57:18,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:57:18,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:57:18,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 16:57:18,572 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:57:18,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 16:57:18,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 16:57:18,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 16:57:18,573 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 8 states. [2018-12-09 16:57:18,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:57:18,630 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-12-09 16:57:18,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 16:57:18,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-12-09 16:57:18,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:57:18,631 INFO L225 Difference]: With dead ends: 51 [2018-12-09 16:57:18,631 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 16:57:18,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-09 16:57:18,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 16:57:18,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 16:57:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 16:57:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-09 16:57:18,633 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 24 [2018-12-09 16:57:18,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:57:18,633 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-09 16:57:18,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 16:57:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-09 16:57:18,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 16:57:18,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:57:18,634 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-09 16:57:18,634 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 16:57:18,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:57:18,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1527697175, now seen corresponding path program 1 times [2018-12-09 16:57:18,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:57:18,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:18,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:57:18,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:18,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:57:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:57:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:57:18,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:57:18,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 16:57:18,714 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:57:18,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 16:57:18,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 16:57:18,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-09 16:57:18,714 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 10 states. [2018-12-09 16:57:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:57:18,806 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-12-09 16:57:18,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 16:57:18,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-12-09 16:57:18,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:57:18,806 INFO L225 Difference]: With dead ends: 64 [2018-12-09 16:57:18,807 INFO L226 Difference]: Without dead ends: 64 [2018-12-09 16:57:18,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 16:57:18,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-09 16:57:18,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-12-09 16:57:18,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-09 16:57:18,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-12-09 16:57:18,810 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 24 [2018-12-09 16:57:18,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:57:18,810 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-12-09 16:57:18,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 16:57:18,810 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-12-09 16:57:18,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 16:57:18,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:57:18,810 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-09 16:57:18,811 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 16:57:18,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:57:18,811 INFO L82 PathProgramCache]: Analyzing trace with hash -60650727, now seen corresponding path program 1 times [2018-12-09 16:57:18,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:57:18,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:18,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:57:18,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:18,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:57:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:57:18,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:57:18,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:57:18,952 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:57:18,952 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-09 16:57:18,953 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [13], [14], [17], [22], [24], [25], [28], [29], [32], [40], [61], [66], [72], [74], [75], [78], [85], [86], [87], [89] [2018-12-09 16:57:18,973 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:57:18,974 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:57:19,134 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:57:19,135 INFO L272 AbstractInterpreter]: Visited 24 different actions 45 times. Merged at 7 different actions 21 times. Widened at 1 different actions 1 times. Performed 407 root evaluator evaluations with a maximum evaluation depth of 5. Performed 407 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-12-09 16:57:19,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:57:19,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:57:19,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:57:19,142 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5ee721ab-32f1-46ac-85ed-1cae6b3748c0/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:57:19,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:57:19,159 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:57:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:57:19,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:57:19,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 16:57:19,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 16:57:19,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:19,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:57:19,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:57:19,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 16:57:19,312 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-09 16:57:19,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 16:57:19,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 16:57:19,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:57:19,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:57:19,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-12-09 16:57:19,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:57:19,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:57:19,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-09 16:57:19,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:19,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-09 16:57:19,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 16:57:19,610 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:19,611 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:57:19,616 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-09 16:57:19,616 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-12-09 16:57:19,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:57:19,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:57:19,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2018-12-09 16:57:19,635 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:57:19,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 16:57:19,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 16:57:19,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2018-12-09 16:57:19,636 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 19 states. [2018-12-09 16:57:20,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:57:20,334 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-12-09 16:57:20,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 16:57:20,335 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-09 16:57:20,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:57:20,337 INFO L225 Difference]: With dead ends: 86 [2018-12-09 16:57:20,337 INFO L226 Difference]: Without dead ends: 86 [2018-12-09 16:57:20,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=216, Invalid=1044, Unknown=0, NotChecked=0, Total=1260 [2018-12-09 16:57:20,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-09 16:57:20,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2018-12-09 16:57:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 16:57:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2018-12-09 16:57:20,343 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 24 [2018-12-09 16:57:20,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:57:20,343 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-12-09 16:57:20,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 16:57:20,344 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2018-12-09 16:57:20,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 16:57:20,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:57:20,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:57:20,345 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 16:57:20,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:57:20,346 INFO L82 PathProgramCache]: Analyzing trace with hash 294426742, now seen corresponding path program 1 times [2018-12-09 16:57:20,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:57:20,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:20,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:57:20,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:20,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:57:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:57:20,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:57:20,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:57:20,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 16:57:20,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:57:20,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 16:57:20,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 16:57:20,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 16:57:20,404 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 10 states. [2018-12-09 16:57:20,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:57:20,504 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-12-09 16:57:20,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 16:57:20,504 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-12-09 16:57:20,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:57:20,504 INFO L225 Difference]: With dead ends: 69 [2018-12-09 16:57:20,504 INFO L226 Difference]: Without dead ends: 51 [2018-12-09 16:57:20,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-12-09 16:57:20,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-09 16:57:20,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-12-09 16:57:20,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-09 16:57:20,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-12-09 16:57:20,506 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 25 [2018-12-09 16:57:20,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:57:20,506 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-12-09 16:57:20,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 16:57:20,507 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-12-09 16:57:20,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 16:57:20,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:57:20,507 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:57:20,507 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 16:57:20,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:57:20,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1334222007, now seen corresponding path program 1 times [2018-12-09 16:57:20,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:57:20,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:20,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:57:20,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:20,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:57:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:57:20,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:57:20,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:57:20,703 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:57:20,703 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-12-09 16:57:20,703 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [13], [14], [17], [22], [25], [28], [29], [32], [38], [44], [50], [52], [61], [66], [72], [74], [75], [78], [85], [86], [87], [89] [2018-12-09 16:57:20,704 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:57:20,704 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:57:20,809 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:57:20,809 INFO L272 AbstractInterpreter]: Visited 27 different actions 69 times. Merged at 14 different actions 42 times. Widened at 1 different actions 1 times. Performed 582 root evaluator evaluations with a maximum evaluation depth of 5. Performed 582 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-12-09 16:57:20,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:57:20,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:57:20,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:57:20,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5ee721ab-32f1-46ac-85ed-1cae6b3748c0/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:57:20,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:57:20,817 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:57:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:57:20,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:57:20,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 16:57:20,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:20,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:57:20,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-09 16:57:20,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 16:57:20,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 16:57:20,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:20,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:57:20,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:57:20,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-09 16:57:20,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-09 16:57:20,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 16:57:20,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:20,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:57:20,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-09 16:57:20,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-09 16:57:22,413 WARN L180 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-09 16:57:22,475 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-09 16:57:22,487 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 45 treesize of output 43 [2018-12-09 16:57:22,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 16:57:22,555 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-09 16:57:22,556 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-12-09 16:57:22,616 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 31 treesize of output 24 [2018-12-09 16:57:22,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:22,618 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 35 treesize of output 28 [2018-12-09 16:57:22,619 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:22,688 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 37 treesize of output 43 [2018-12-09 16:57:22,689 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-12-09 16:57:22,759 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 34 treesize of output 26 [2018-12-09 16:57:22,759 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:22,760 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-09 16:57:22,761 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:22,762 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-09 16:57:22,762 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:22,827 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 28 treesize of output 20 [2018-12-09 16:57:22,827 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:22,828 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 24 treesize of output 16 [2018-12-09 16:57:22,828 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:22,892 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 37 treesize of output 35 [2018-12-09 16:57:22,893 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-09 16:57:22,958 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 31 treesize of output 23 [2018-12-09 16:57:22,958 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:22,959 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 27 treesize of output 19 [2018-12-09 16:57:22,960 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:23,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-09 16:57:23,047 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-09 16:57:23,047 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-12-09 16:57:23,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:57:23,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:57:23,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 16:57:23,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:23,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-12-09 16:57:23,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-12-09 16:57:23,761 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:23,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-12-09 16:57:23,769 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:23,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-09 16:57:23,779 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:23,781 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:57:23,788 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-09 16:57:23,788 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:69, output treesize:7 [2018-12-09 16:57:23,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:57:23,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:57:23,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 39 [2018-12-09 16:57:23,810 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:57:23,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-09 16:57:23,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-09 16:57:23,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1376, Unknown=0, NotChecked=0, Total=1560 [2018-12-09 16:57:23,811 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 28 states. [2018-12-09 16:57:25,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:57:25,365 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2018-12-09 16:57:25,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 16:57:25,365 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-12-09 16:57:25,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:57:25,366 INFO L225 Difference]: With dead ends: 109 [2018-12-09 16:57:25,366 INFO L226 Difference]: Without dead ends: 109 [2018-12-09 16:57:25,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=442, Invalid=2420, Unknown=0, NotChecked=0, Total=2862 [2018-12-09 16:57:25,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-09 16:57:25,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2018-12-09 16:57:25,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 16:57:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2018-12-09 16:57:25,369 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 27 [2018-12-09 16:57:25,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:57:25,369 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2018-12-09 16:57:25,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-09 16:57:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2018-12-09 16:57:25,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 16:57:25,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:57:25,369 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:57:25,369 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 16:57:25,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:57:25,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1711340723, now seen corresponding path program 2 times [2018-12-09 16:57:25,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:57:25,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:25,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:57:25,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:25,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:57:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:57:25,524 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:57:25,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:57:25,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:57:25,525 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 16:57:25,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 16:57:25,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:57:25,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5ee721ab-32f1-46ac-85ed-1cae6b3748c0/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:57:25,533 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 16:57:25,533 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 16:57:25,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 16:57:25,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:57:25,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:57:25,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 16:57:25,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:57:25,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 16:57:25,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:57:25,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:57:25,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-09 16:57:25,592 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 16 treesize of output 13 [2018-12-09 16:57:25,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-09 16:57:25,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:25,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:57:25,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:57:25,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-12-09 16:57:25,751 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 21 treesize of output 17 [2018-12-09 16:57:25,753 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-12-09 16:57:25,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:25,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:57:25,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:57:25,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:24 [2018-12-09 16:57:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:57:25,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:57:26,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-09 16:57:26,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 16:57:26,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:26,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:57:26,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:57:26,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:44 [2018-12-09 16:57:26,146 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:57:26,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:57:26,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2018-12-09 16:57:26,172 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:57:26,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-09 16:57:26,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 16:57:26,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2018-12-09 16:57:26,173 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 22 states. [2018-12-09 16:57:27,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:57:27,608 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2018-12-09 16:57:27,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 16:57:27,608 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2018-12-09 16:57:27,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:57:27,609 INFO L225 Difference]: With dead ends: 92 [2018-12-09 16:57:27,609 INFO L226 Difference]: Without dead ends: 90 [2018-12-09 16:57:27,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=543, Invalid=2427, Unknown=0, NotChecked=0, Total=2970 [2018-12-09 16:57:27,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-09 16:57:27,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 44. [2018-12-09 16:57:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 16:57:27,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-12-09 16:57:27,614 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 30 [2018-12-09 16:57:27,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:57:27,614 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-12-09 16:57:27,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-09 16:57:27,615 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-12-09 16:57:27,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 16:57:27,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:57:27,616 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:57:27,616 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 16:57:27,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:57:27,617 INFO L82 PathProgramCache]: Analyzing trace with hash -353357345, now seen corresponding path program 2 times [2018-12-09 16:57:27,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:57:27,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:27,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:57:27,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:57:27,619 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:57:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:57:27,788 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:57:27,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:57:27,788 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:57:27,788 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 16:57:27,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 16:57:27,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:57:27,789 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5ee721ab-32f1-46ac-85ed-1cae6b3748c0/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:57:27,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 16:57:27,795 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 16:57:27,812 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 16:57:27,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:57:27,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:57:27,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 16:57:27,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:57:27,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 16:57:27,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:57:27,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:57:27,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:33 [2018-12-09 16:57:27,859 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 24 treesize of output 21 [2018-12-09 16:57:27,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 16:57:27,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:27,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:57:27,876 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 25 treesize of output 22 [2018-12-09 16:57:27,877 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 10 treesize of output 9 [2018-12-09 16:57:27,878 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:27,885 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:57:27,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 16:57:27,894 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2018-12-09 16:57:27,921 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 32 treesize of output 27 [2018-12-09 16:57:27,923 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 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-09 16:57:27,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:27,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:57:27,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 42 [2018-12-09 16:57:27,952 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 35 treesize of output 34 [2018-12-09 16:57:27,953 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:27,965 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:57:27,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-09 16:57:27,977 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:67, output treesize:59 [2018-12-09 16:57:28,185 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 35 treesize of output 35 [2018-12-09 16:57:28,187 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 31 treesize of output 24 [2018-12-09 16:57:28,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:28,203 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 24 treesize of output 22 [2018-12-09 16:57:28,203 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 16:57:28,223 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 27 treesize of output 35 [2018-12-09 16:57:28,224 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-12-09 16:57:28,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-09 16:57:28,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 16:57:28,272 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:78 [2018-12-09 16:57:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 16:57:28,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:57:28,748 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 65 [2018-12-09 16:57:28,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 16:57:28,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:28,823 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 38 treesize of output 38 [2018-12-09 16:57:28,826 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:57:28,826 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:57:28,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-12-09 16:57:28,827 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:28,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-09 16:57:28,843 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:28,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-12-09 16:57:28,858 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:28,870 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:57:28,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-12-09 16:57:28,880 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 29 treesize of output 21 [2018-12-09 16:57:28,881 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:28,895 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-09 16:57:28,895 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:28,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2018-12-09 16:57:28,909 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 16:57:28,920 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:57:28,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-12-09 16:57:28,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:57:28,977 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:143, output treesize:184 [2018-12-09 16:57:29,072 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 16:57:29,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:57:29,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 35 [2018-12-09 16:57:29,087 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:57:29,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 16:57:29,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 16:57:29,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1121, Unknown=0, NotChecked=0, Total=1260 [2018-12-09 16:57:29,088 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 23 states. [2018-12-09 16:57:31,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:57:31,289 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-12-09 16:57:31,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-09 16:57:31,290 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2018-12-09 16:57:31,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:57:31,290 INFO L225 Difference]: With dead ends: 52 [2018-12-09 16:57:31,290 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 16:57:31,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=805, Invalid=4025, Unknown=0, NotChecked=0, Total=4830 [2018-12-09 16:57:31,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 16:57:31,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 16:57:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 16:57:31,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 16:57:31,293 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-12-09 16:57:31,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:57:31,293 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 16:57:31,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 16:57:31,294 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 16:57:31,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 16:57:31,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:57:31 BoogieIcfgContainer [2018-12-09 16:57:31,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 16:57:31,302 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 16:57:31,302 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 16:57:31,302 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 16:57:31,303 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:57:17" (3/4) ... [2018-12-09 16:57:31,308 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 16:57:31,314 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 16:57:31,314 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrpbrk [2018-12-09 16:57:31,315 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 16:57:31,318 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-12-09 16:57:31,318 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-09 16:57:31,318 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 16:57:31,347 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5ee721ab-32f1-46ac-85ed-1cae6b3748c0/bin-2019/utaipan/witness.graphml [2018-12-09 16:57:31,347 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 16:57:31,348 INFO L168 Benchmark]: Toolchain (without parser) took 14357.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 304.6 MB). Free memory was 953.5 MB in the beginning and 956.5 MB in the end (delta: -3.0 MB). Peak memory consumption was 301.6 MB. Max. memory is 11.5 GB. [2018-12-09 16:57:31,348 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:57:31,348 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -112.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-09 16:57:31,349 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-12-09 16:57:31,349 INFO L168 Benchmark]: Boogie Preprocessor took 16.41 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:57:31,349 INFO L168 Benchmark]: RCFGBuilder took 188.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2018-12-09 16:57:31,349 INFO L168 Benchmark]: TraceAbstraction took 13837.53 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 225.4 MB). Free memory was 1.0 GB in the beginning and 956.5 MB in the end (delta: 82.7 MB). Peak memory consumption was 308.2 MB. Max. memory is 11.5 GB. [2018-12-09 16:57:31,349 INFO L168 Benchmark]: Witness Printer took 45.87 ms. Allocated memory is still 1.3 GB. Free memory is still 956.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:57:31,350 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 248.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -112.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.41 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 188.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13837.53 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 225.4 MB). Free memory was 1.0 GB in the beginning and 956.5 MB in the end (delta: 82.7 MB). Peak memory consumption was 308.2 MB. Max. memory is 11.5 GB. * Witness Printer took 45.87 ms. Allocated memory is still 1.3 GB. Free memory is still 956.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: 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: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 15 error locations. SAFE Result, 13.8s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 512 SDtfs, 1316 SDslu, 1668 SDs, 0 SdLazy, 2528 SolverSat, 228 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 462 GetRequests, 173 SyntacticMatches, 9 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1733 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=15, 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, 17 MinimizatonAttempts, 132 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 463 NumberOfCodeBlocks, 463 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 559 ConstructedInterpolants, 110 QuantifiedInterpolants, 216483 SizeOfPredicates, 79 NumberOfNonLiveVariables, 599 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 25 InterpolantComputations, 13 PerfectInterpolantSequences, 23/79 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...