./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_56e94ed9-15a2-4cdb-ba69-5b3ba34bcfe6/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_56e94ed9-15a2-4cdb-ba69-5b3ba34bcfe6/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_56e94ed9-15a2-4cdb-ba69-5b3ba34bcfe6/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_56e94ed9-15a2-4cdb-ba69-5b3ba34bcfe6/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_56e94ed9-15a2-4cdb-ba69-5b3ba34bcfe6/bin-2019/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_56e94ed9-15a2-4cdb-ba69-5b3ba34bcfe6/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-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a74485b04ec8988328f8bc8f67ebe898d81e7141 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 22:28:05,281 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 22:28:05,282 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 22:28:05,289 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 22:28:05,289 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 22:28:05,290 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 22:28:05,291 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 22:28:05,292 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 22:28:05,293 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 22:28:05,294 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 22:28:05,294 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 22:28:05,294 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 22:28:05,295 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 22:28:05,296 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 22:28:05,296 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 22:28:05,297 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 22:28:05,297 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 22:28:05,298 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 22:28:05,300 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 22:28:05,301 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 22:28:05,301 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 22:28:05,302 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 22:28:05,304 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 22:28:05,304 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 22:28:05,304 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 22:28:05,305 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 22:28:05,305 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 22:28:05,306 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 22:28:05,307 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 22:28:05,307 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 22:28:05,307 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 22:28:05,308 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 22:28:05,308 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 22:28:05,308 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 22:28:05,309 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 22:28:05,309 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 22:28:05,309 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_56e94ed9-15a2-4cdb-ba69-5b3ba34bcfe6/bin-2019/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2018-12-08 22:28:05,320 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 22:28:05,320 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 22:28:05,320 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 22:28:05,321 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 22:28:05,321 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 22:28:05,321 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 22:28:05,321 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 22:28:05,321 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 22:28:05,321 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 22:28:05,321 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 22:28:05,321 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 22:28:05,322 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 22:28:05,322 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 22:28:05,322 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 22:28:05,322 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 22:28:05,323 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 22:28:05,323 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 22:28:05,323 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 22:28:05,323 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 22:28:05,323 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 22:28:05,323 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 22:28:05,324 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 22:28:05,324 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 22:28:05,324 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 22:28:05,324 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 22:28:05,324 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 22:28:05,324 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 22:28:05,324 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 22:28:05,324 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 22:28:05,324 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 22:28:05,324 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 22:28:05,325 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 22:28:05,325 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 22:28:05,325 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 22:28:05,325 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 22:28:05,325 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_56e94ed9-15a2-4cdb-ba69-5b3ba34bcfe6/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-memcleanup) ) 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 -> a74485b04ec8988328f8bc8f67ebe898d81e7141 [2018-12-08 22:28:05,348 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 22:28:05,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 22:28:05,359 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 22:28:05,360 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 22:28:05,360 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 22:28:05,361 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_56e94ed9-15a2-4cdb-ba69-5b3ba34bcfe6/bin-2019/utaipan/../../sv-benchmarks/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i [2018-12-08 22:28:05,398 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_56e94ed9-15a2-4cdb-ba69-5b3ba34bcfe6/bin-2019/utaipan/data/026385407/4896d91545da4534a8e5ac00822b67b7/FLAG3b9a25bab [2018-12-08 22:28:05,821 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 22:28:05,822 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_56e94ed9-15a2-4cdb-ba69-5b3ba34bcfe6/sv-benchmarks/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i [2018-12-08 22:28:05,827 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_56e94ed9-15a2-4cdb-ba69-5b3ba34bcfe6/bin-2019/utaipan/data/026385407/4896d91545da4534a8e5ac00822b67b7/FLAG3b9a25bab [2018-12-08 22:28:05,836 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_56e94ed9-15a2-4cdb-ba69-5b3ba34bcfe6/bin-2019/utaipan/data/026385407/4896d91545da4534a8e5ac00822b67b7 [2018-12-08 22:28:05,838 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 22:28:05,839 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 22:28:05,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 22:28:05,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 22:28:05,843 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 22:28:05,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:28:05" (1/1) ... [2018-12-08 22:28:05,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5243922c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:28:05, skipping insertion in model container [2018-12-08 22:28:05,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:28:05" (1/1) ... [2018-12-08 22:28:05,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 22:28:05,875 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 22:28:06,034 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 22:28:06,073 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 22:28:06,101 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 22:28:06,121 INFO L195 MainTranslator]: Completed translation [2018-12-08 22:28:06,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:28:06 WrapperNode [2018-12-08 22:28:06,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 22:28:06,122 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 22:28:06,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 22:28:06,122 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 22:28:06,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:28:06" (1/1) ... [2018-12-08 22:28:06,134 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:28:06" (1/1) ... [2018-12-08 22:28:06,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 22:28:06,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 22:28:06,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 22:28:06,139 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 22:28:06,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:28:06" (1/1) ... [2018-12-08 22:28:06,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:28:06" (1/1) ... [2018-12-08 22:28:06,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:28:06" (1/1) ... [2018-12-08 22:28:06,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:28:06" (1/1) ... [2018-12-08 22:28:06,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:28:06" (1/1) ... [2018-12-08 22:28:06,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:28:06" (1/1) ... [2018-12-08 22:28:06,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:28:06" (1/1) ... [2018-12-08 22:28:06,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 22:28:06,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 22:28:06,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 22:28:06,158 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 22:28:06,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:28:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56e94ed9-15a2-4cdb-ba69-5b3ba34bcfe6/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-08 22:28:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-08 22:28:06,188 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-08 22:28:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 22:28:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 22:28:06,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 22:28:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 22:28:06,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 22:28:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 22:28:06,189 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 22:28:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 22:28:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 22:28:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 22:28:06,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 22:28:06,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 22:28:06,375 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 22:28:06,375 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-08 22:28:06,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:28:06 BoogieIcfgContainer [2018-12-08 22:28:06,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 22:28:06,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 22:28:06,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 22:28:06,378 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 22:28:06,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 10:28:05" (1/3) ... [2018-12-08 22:28:06,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266a3132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:28:06, skipping insertion in model container [2018-12-08 22:28:06,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:28:06" (2/3) ... [2018-12-08 22:28:06,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266a3132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:28:06, skipping insertion in model container [2018-12-08 22:28:06,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:28:06" (3/3) ... [2018-12-08 22:28:06,381 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list_false-unreach-call_false-valid-memcleanup.i [2018-12-08 22:28:06,387 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 22:28:06,392 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-12-08 22:28:06,401 INFO L257 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2018-12-08 22:28:06,415 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 22:28:06,416 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 22:28:06,416 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 22:28:06,416 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 22:28:06,416 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 22:28:06,416 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 22:28:06,416 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 22:28:06,416 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 22:28:06,426 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-12-08 22:28:06,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 22:28:06,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:28:06,432 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:28:06,433 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION]=== [2018-12-08 22:28:06,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:28:06,437 INFO L82 PathProgramCache]: Analyzing trace with hash 703952005, now seen corresponding path program 1 times [2018-12-08 22:28:06,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:28:06,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:06,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:28:06,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:06,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:28:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:28:06,510 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-08 22:28:06,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:28:06,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 22:28:06,512 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:28:06,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-08 22:28:06,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 22:28:06,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 22:28:06,524 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-12-08 22:28:06,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:28:06,535 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-12-08 22:28:06,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 22:28:06,536 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-08 22:28:06,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:28:06,541 INFO L225 Difference]: With dead ends: 76 [2018-12-08 22:28:06,541 INFO L226 Difference]: Without dead ends: 68 [2018-12-08 22:28:06,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 22:28:06,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-08 22:28:06,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-08 22:28:06,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-08 22:28:06,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-12-08 22:28:06,564 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 10 [2018-12-08 22:28:06,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:28:06,564 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-12-08 22:28:06,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-08 22:28:06,564 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-12-08 22:28:06,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 22:28:06,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:28:06,565 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:28:06,565 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION]=== [2018-12-08 22:28:06,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:28:06,565 INFO L82 PathProgramCache]: Analyzing trace with hash 347640025, now seen corresponding path program 1 times [2018-12-08 22:28:06,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:28:06,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:06,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:28:06,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:06,566 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:28:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:28:06,607 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-08 22:28:06,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:28:06,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 22:28:06,608 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:28:06,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 22:28:06,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 22:28:06,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 22:28:06,609 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 4 states. [2018-12-08 22:28:06,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:28:06,700 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-12-08 22:28:06,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 22:28:06,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-08 22:28:06,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:28:06,701 INFO L225 Difference]: With dead ends: 85 [2018-12-08 22:28:06,701 INFO L226 Difference]: Without dead ends: 85 [2018-12-08 22:28:06,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:28:06,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-08 22:28:06,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2018-12-08 22:28:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-08 22:28:06,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2018-12-08 22:28:06,705 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 11 [2018-12-08 22:28:06,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:28:06,705 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2018-12-08 22:28:06,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 22:28:06,705 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-12-08 22:28:06,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 22:28:06,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:28:06,706 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:28:06,706 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION]=== [2018-12-08 22:28:06,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:28:06,706 INFO L82 PathProgramCache]: Analyzing trace with hash 347640026, now seen corresponding path program 1 times [2018-12-08 22:28:06,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:28:06,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:06,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:28:06,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:06,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:28:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:28:06,736 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-08 22:28:06,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:28:06,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 22:28:06,736 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:28:06,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 22:28:06,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 22:28:06,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 22:28:06,737 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 4 states. [2018-12-08 22:28:06,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:28:06,829 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-12-08 22:28:06,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 22:28:06,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-08 22:28:06,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:28:06,830 INFO L225 Difference]: With dead ends: 93 [2018-12-08 22:28:06,830 INFO L226 Difference]: Without dead ends: 93 [2018-12-08 22:28:06,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:28:06,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-08 22:28:06,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-12-08 22:28:06,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-08 22:28:06,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2018-12-08 22:28:06,836 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 11 [2018-12-08 22:28:06,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:28:06,836 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2018-12-08 22:28:06,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 22:28:06,836 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2018-12-08 22:28:06,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 22:28:06,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:28:06,837 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-08 22:28:06,837 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION]=== [2018-12-08 22:28:06,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:28:06,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1047491972, now seen corresponding path program 1 times [2018-12-08 22:28:06,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:28:06,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:06,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:28:06,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:06,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:28:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:28:06,887 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-08 22:28:06,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:28:06,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 22:28:06,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:28:06,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 22:28:06,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 22:28:06,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:28:06,888 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 5 states. [2018-12-08 22:28:06,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:28:06,968 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2018-12-08 22:28:06,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 22:28:06,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-08 22:28:06,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:28:06,969 INFO L225 Difference]: With dead ends: 122 [2018-12-08 22:28:06,969 INFO L226 Difference]: Without dead ends: 119 [2018-12-08 22:28:06,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-08 22:28:06,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-08 22:28:06,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 106. [2018-12-08 22:28:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-08 22:28:06,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2018-12-08 22:28:06,974 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 20 [2018-12-08 22:28:06,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:28:06,974 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2018-12-08 22:28:06,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 22:28:06,975 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2018-12-08 22:28:06,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 22:28:06,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:28:06,975 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-08 22:28:06,975 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION]=== [2018-12-08 22:28:06,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:28:06,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1047539668, now seen corresponding path program 1 times [2018-12-08 22:28:06,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:28:06,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:06,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:28:06,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:06,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:28:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:28:07,002 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-08 22:28:07,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:28:07,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 22:28:07,003 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:28:07,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 22:28:07,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 22:28:07,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:28:07,004 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand 5 states. [2018-12-08 22:28:07,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:28:07,063 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2018-12-08 22:28:07,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 22:28:07,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-08 22:28:07,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:28:07,064 INFO L225 Difference]: With dead ends: 116 [2018-12-08 22:28:07,064 INFO L226 Difference]: Without dead ends: 116 [2018-12-08 22:28:07,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-08 22:28:07,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-08 22:28:07,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2018-12-08 22:28:07,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-08 22:28:07,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2018-12-08 22:28:07,068 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 20 [2018-12-08 22:28:07,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:28:07,069 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2018-12-08 22:28:07,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 22:28:07,069 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2018-12-08 22:28:07,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 22:28:07,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:28:07,069 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-08 22:28:07,070 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION]=== [2018-12-08 22:28:07,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:28:07,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1979155278, now seen corresponding path program 1 times [2018-12-08 22:28:07,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:28:07,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:07,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:28:07,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:07,071 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:28:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:28:07,087 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-08 22:28:07,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:28:07,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 22:28:07,088 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:28:07,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 22:28:07,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 22:28:07,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 22:28:07,088 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand 3 states. [2018-12-08 22:28:07,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:28:07,095 INFO L93 Difference]: Finished difference Result 159 states and 181 transitions. [2018-12-08 22:28:07,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 22:28:07,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-08 22:28:07,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:28:07,096 INFO L225 Difference]: With dead ends: 159 [2018-12-08 22:28:07,096 INFO L226 Difference]: Without dead ends: 159 [2018-12-08 22:28:07,097 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-08 22:28:07,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-08 22:28:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 120. [2018-12-08 22:28:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-08 22:28:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2018-12-08 22:28:07,101 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 20 [2018-12-08 22:28:07,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:28:07,101 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2018-12-08 22:28:07,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 22:28:07,101 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2018-12-08 22:28:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 22:28:07,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:28:07,102 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-08 22:28:07,102 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION]=== [2018-12-08 22:28:07,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:28:07,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2019987388, now seen corresponding path program 1 times [2018-12-08 22:28:07,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:28:07,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:07,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:28:07,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:07,103 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:28:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:28:07,145 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-08 22:28:07,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:28:07,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 22:28:07,145 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:28:07,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 22:28:07,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 22:28:07,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 22:28:07,146 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand 6 states. [2018-12-08 22:28:07,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:28:07,251 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2018-12-08 22:28:07,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 22:28:07,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-08 22:28:07,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:28:07,252 INFO L225 Difference]: With dead ends: 127 [2018-12-08 22:28:07,252 INFO L226 Difference]: Without dead ends: 127 [2018-12-08 22:28:07,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-08 22:28:07,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-08 22:28:07,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 102. [2018-12-08 22:28:07,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-08 22:28:07,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2018-12-08 22:28:07,256 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 20 [2018-12-08 22:28:07,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:28:07,256 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2018-12-08 22:28:07,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 22:28:07,256 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2018-12-08 22:28:07,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 22:28:07,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:28:07,257 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:28:07,257 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION]=== [2018-12-08 22:28:07,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:28:07,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1886008504, now seen corresponding path program 1 times [2018-12-08 22:28:07,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:28:07,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:07,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:28:07,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:07,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:28:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:28:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:28:07,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:28:07,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 22:28:07,290 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:28:07,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 22:28:07,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 22:28:07,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 22:28:07,291 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand 6 states. [2018-12-08 22:28:07,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:28:07,391 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2018-12-08 22:28:07,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 22:28:07,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-08 22:28:07,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:28:07,392 INFO L225 Difference]: With dead ends: 108 [2018-12-08 22:28:07,392 INFO L226 Difference]: Without dead ends: 108 [2018-12-08 22:28:07,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-12-08 22:28:07,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-08 22:28:07,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 101. [2018-12-08 22:28:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-08 22:28:07,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2018-12-08 22:28:07,396 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 21 [2018-12-08 22:28:07,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:28:07,396 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2018-12-08 22:28:07,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 22:28:07,396 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2018-12-08 22:28:07,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 22:28:07,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:28:07,397 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:28:07,397 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION]=== [2018-12-08 22:28:07,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:28:07,397 INFO L82 PathProgramCache]: Analyzing trace with hash 744049830, now seen corresponding path program 1 times [2018-12-08 22:28:07,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:28:07,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:07,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:28:07,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:07,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:28:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:28:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:28:07,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:28:07,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 22:28:07,430 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:28:07,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 22:28:07,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 22:28:07,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 22:28:07,430 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 6 states. [2018-12-08 22:28:07,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:28:07,535 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2018-12-08 22:28:07,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 22:28:07,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-08 22:28:07,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:28:07,536 INFO L225 Difference]: With dead ends: 103 [2018-12-08 22:28:07,536 INFO L226 Difference]: Without dead ends: 103 [2018-12-08 22:28:07,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-08 22:28:07,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-08 22:28:07,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2018-12-08 22:28:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-08 22:28:07,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2018-12-08 22:28:07,538 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 21 [2018-12-08 22:28:07,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:28:07,539 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2018-12-08 22:28:07,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 22:28:07,539 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2018-12-08 22:28:07,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 22:28:07,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:28:07,539 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:28:07,539 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION]=== [2018-12-08 22:28:07,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:28:07,540 INFO L82 PathProgramCache]: Analyzing trace with hash 744049831, now seen corresponding path program 1 times [2018-12-08 22:28:07,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:28:07,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:07,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:28:07,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:07,540 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:28:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:28:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:28:07,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:28:07,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 22:28:07,586 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:28:07,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 22:28:07,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 22:28:07,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 22:28:07,587 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 6 states. [2018-12-08 22:28:07,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:28:07,717 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-12-08 22:28:07,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 22:28:07,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-08 22:28:07,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:28:07,718 INFO L225 Difference]: With dead ends: 112 [2018-12-08 22:28:07,718 INFO L226 Difference]: Without dead ends: 112 [2018-12-08 22:28:07,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-08 22:28:07,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-08 22:28:07,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 86. [2018-12-08 22:28:07,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-08 22:28:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-12-08 22:28:07,720 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 21 [2018-12-08 22:28:07,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:28:07,720 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-12-08 22:28:07,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 22:28:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-12-08 22:28:07,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 22:28:07,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:28:07,720 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-08 22:28:07,720 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION]=== [2018-12-08 22:28:07,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:28:07,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1663278663, now seen corresponding path program 1 times [2018-12-08 22:28:07,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:28:07,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:07,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:28:07,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:07,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:28:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:28:07,746 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-08 22:28:07,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:28:07,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 22:28:07,746 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:28:07,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 22:28:07,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 22:28:07,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 22:28:07,747 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 7 states. [2018-12-08 22:28:07,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:28:07,860 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-12-08 22:28:07,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 22:28:07,861 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-08 22:28:07,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:28:07,861 INFO L225 Difference]: With dead ends: 105 [2018-12-08 22:28:07,861 INFO L226 Difference]: Without dead ends: 98 [2018-12-08 22:28:07,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-12-08 22:28:07,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-08 22:28:07,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 82. [2018-12-08 22:28:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-08 22:28:07,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-12-08 22:28:07,863 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 22 [2018-12-08 22:28:07,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:28:07,863 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-12-08 22:28:07,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 22:28:07,863 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-12-08 22:28:07,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 22:28:07,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:28:07,864 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:28:07,864 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION]=== [2018-12-08 22:28:07,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:28:07,864 INFO L82 PathProgramCache]: Analyzing trace with hash -12537769, now seen corresponding path program 1 times [2018-12-08 22:28:07,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:28:07,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:07,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:28:07,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:07,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:28:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:28:07,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:28:07,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:28:07,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 22:28:07,967 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-08 22:28:07,968 INFO L205 CegarAbsIntRunner]: [0], [1], [10], [16], [18], [23], [26], [28], [31], [32], [35], [43], [49], [51], [54], [57], [61], [64], [69], [74], [106], [111], [116], [131], [133], [136], [137], [138], [139] [2018-12-08 22:28:07,989 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 22:28:07,989 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 22:28:08,106 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 22:28:08,107 INFO L272 AbstractInterpreter]: Visited 29 different actions 35 times. Merged at 5 different actions 5 times. Never widened. Performed 233 root evaluator evaluations with a maximum evaluation depth of 3. Performed 233 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 31 variables. [2018-12-08 22:28:08,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:28:08,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 22:28:08,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:28:08,120 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56e94ed9-15a2-4cdb-ba69-5b3ba34bcfe6/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-08 22:28:08,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:28:08,126 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 22:28:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:28:08,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:28:08,171 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 6 treesize of output 5 [2018-12-08 22:28:08,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 22:28:08,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:28:08,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:28:08,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2018-12-08 22:28:08,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:28:08,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:28:08,236 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 11 treesize of output 4 [2018-12-08 22:28:08,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-12-08 22:28:08,257 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 13 treesize of output 10 [2018-12-08 22:28:08,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 22:28:08,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,271 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 27 treesize of output 22 [2018-12-08 22:28:08,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:28:08,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 22:28:08,275 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,284 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2018-12-08 22:28:08,301 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 20 treesize of output 16 [2018-12-08 22:28:08,303 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 16 treesize of output 4 [2018-12-08 22:28:08,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-12-08 22:28:08,331 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 19 treesize of output 20 [2018-12-08 22:28:08,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:28:08,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 22:28:08,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-12-08 22:28:08,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-08 22:28:08,382 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 5 treesize of output 1 [2018-12-08 22:28:08,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,386 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 11 treesize of output 3 [2018-12-08 22:28:08,386 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,389 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-12-08 22:28:08,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:28:08,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 22:28:08,529 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:28:08,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:28:08,532 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,534 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,538 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 2 xjuncts. [2018-12-08 22:28:08,538 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:23 [2018-12-08 22:28:08,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 19 [2018-12-08 22:28:08,596 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 6 treesize of output 1 [2018-12-08 22:28:08,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,602 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 30 treesize of output 28 [2018-12-08 22:28:08,604 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 14 treesize of output 18 [2018-12-08 22:28:08,613 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 17 treesize of output 11 [2018-12-08 22:28:08,614 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,615 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:08,615 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:08,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-08 22:28:08,616 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:08,622 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:28:08,630 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:28:08,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-08 22:28:08,651 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:44, output treesize:58 [2018-12-08 22:28:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:28:08,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 22:28:08,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 32 [2018-12-08 22:28:08,735 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 22:28:08,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 22:28:08,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 22:28:08,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2018-12-08 22:28:08,736 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 21 states. [2018-12-08 22:28:09,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:28:09,200 INFO L93 Difference]: Finished difference Result 179 states and 200 transitions. [2018-12-08 22:28:09,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 22:28:09,200 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-12-08 22:28:09,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:28:09,201 INFO L225 Difference]: With dead ends: 179 [2018-12-08 22:28:09,201 INFO L226 Difference]: Without dead ends: 179 [2018-12-08 22:28:09,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=306, Invalid=1500, Unknown=0, NotChecked=0, Total=1806 [2018-12-08 22:28:09,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-08 22:28:09,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 96. [2018-12-08 22:28:09,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-08 22:28:09,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2018-12-08 22:28:09,203 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 30 [2018-12-08 22:28:09,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:28:09,203 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2018-12-08 22:28:09,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 22:28:09,203 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2018-12-08 22:28:09,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 22:28:09,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:28:09,204 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:28:09,204 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION]=== [2018-12-08 22:28:09,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:28:09,204 INFO L82 PathProgramCache]: Analyzing trace with hash 959957647, now seen corresponding path program 1 times [2018-12-08 22:28:09,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:28:09,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:09,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:28:09,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:09,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:28:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:28:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:28:09,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:28:09,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 22:28:09,321 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-08 22:28:09,321 INFO L205 CegarAbsIntRunner]: [0], [1], [10], [16], [18], [23], [26], [28], [31], [32], [35], [43], [49], [51], [54], [57], [61], [64], [69], [70], [76], [79], [80], [87], [99], [102], [137], [138], [139] [2018-12-08 22:28:09,322 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 22:28:09,322 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 22:28:09,361 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 22:28:09,362 INFO L272 AbstractInterpreter]: Visited 29 different actions 39 times. Merged at 9 different actions 9 times. Never widened. Performed 269 root evaluator evaluations with a maximum evaluation depth of 3. Performed 269 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 32 variables. [2018-12-08 22:28:09,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:28:09,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 22:28:09,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:28:09,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56e94ed9-15a2-4cdb-ba69-5b3ba34bcfe6/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-08 22:28:09,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:28:09,375 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 22:28:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:28:09,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:28:09,397 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 6 treesize of output 5 [2018-12-08 22:28:09,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 22:28:09,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:28:09,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:28:09,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-08 22:28:09,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:28:09,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:28:09,465 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 11 treesize of output 4 [2018-12-08 22:28:09,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2018-12-08 22:28:09,492 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 13 treesize of output 10 [2018-12-08 22:28:09,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 22:28:09,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,518 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 27 treesize of output 22 [2018-12-08 22:28:09,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:28:09,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 22:28:09,522 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,535 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:30 [2018-12-08 22:28:09,551 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 20 treesize of output 16 [2018-12-08 22:28:09,553 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 16 treesize of output 4 [2018-12-08 22:28:09,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-12-08 22:28:09,587 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 19 treesize of output 20 [2018-12-08 22:28:09,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:28:09,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 22:28:09,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2018-12-08 22:28:09,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-08 22:28:09,634 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 11 treesize of output 3 [2018-12-08 22:28:09,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,639 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 5 treesize of output 1 [2018-12-08 22:28:09,639 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,647 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-12-08 22:28:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:28:09,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 22:28:09,691 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:28:09,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:28:09,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:28:09,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2018-12-08 22:28:09,736 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 19 [2018-12-08 22:28:09,737 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 14 treesize of output 18 [2018-12-08 22:28:09,746 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:09,746 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:09,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-08 22:28:09,747 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,748 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 17 treesize of output 11 [2018-12-08 22:28:09,748 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,754 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:28:09,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:28:09,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 12 treesize of output 10 [2018-12-08 22:28:09,765 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 6 treesize of output 1 [2018-12-08 22:28:09,765 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,766 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:09,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-08 22:28:09,780 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:32, output treesize:48 [2018-12-08 22:28:09,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:28:09,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 22:28:09,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 8] total 27 [2018-12-08 22:28:09,834 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 22:28:09,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 22:28:09,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 22:28:09,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2018-12-08 22:28:09,835 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 21 states. [2018-12-08 22:28:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:28:10,260 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2018-12-08 22:28:10,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-08 22:28:10,260 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-12-08 22:28:10,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:28:10,261 INFO L225 Difference]: With dead ends: 133 [2018-12-08 22:28:10,261 INFO L226 Difference]: Without dead ends: 126 [2018-12-08 22:28:10,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=369, Invalid=1353, Unknown=0, NotChecked=0, Total=1722 [2018-12-08 22:28:10,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-08 22:28:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 92. [2018-12-08 22:28:10,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-08 22:28:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2018-12-08 22:28:10,263 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 30 [2018-12-08 22:28:10,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:28:10,263 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2018-12-08 22:28:10,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 22:28:10,263 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2018-12-08 22:28:10,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 22:28:10,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:28:10,264 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 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-08 22:28:10,264 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION]=== [2018-12-08 22:28:10,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:28:10,264 INFO L82 PathProgramCache]: Analyzing trace with hash 319118564, now seen corresponding path program 1 times [2018-12-08 22:28:10,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:28:10,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:10,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:28:10,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:10,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:28:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:28:10,416 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:28:10,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:28:10,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 22:28:10,416 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-12-08 22:28:10,416 INFO L205 CegarAbsIntRunner]: [0], [1], [10], [16], [18], [23], [26], [28], [31], [32], [35], [37], [38], [41], [43], [49], [51], [54], [57], [61], [64], [69], [74], [106], [111], [116], [131], [133], [136], [137], [138], [139] [2018-12-08 22:28:10,418 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 22:28:10,418 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 22:28:10,502 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 22:28:10,502 INFO L272 AbstractInterpreter]: Visited 32 different actions 61 times. Merged at 15 different actions 25 times. Never widened. Performed 541 root evaluator evaluations with a maximum evaluation depth of 3. Performed 541 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 4 different actions. Largest state had 31 variables. [2018-12-08 22:28:10,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:28:10,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 22:28:10,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:28:10,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56e94ed9-15a2-4cdb-ba69-5b3ba34bcfe6/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-08 22:28:10,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:28:10,510 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 22:28:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:28:10,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:28:10,530 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 6 treesize of output 5 [2018-12-08 22:28:10,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 22:28:10,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:28:10,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:28:10,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2018-12-08 22:28:10,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:28:10,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:28:10,591 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 11 treesize of output 4 [2018-12-08 22:28:10,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-12-08 22:28:10,611 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 27 treesize of output 22 [2018-12-08 22:28:10,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:28:10,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 22:28:10,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,628 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 13 treesize of output 10 [2018-12-08 22:28:10,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 22:28:10,630 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,632 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,639 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2018-12-08 22:28:10,656 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 20 treesize of output 16 [2018-12-08 22:28:10,657 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 16 treesize of output 4 [2018-12-08 22:28:10,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2018-12-08 22:28:10,696 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 19 treesize of output 20 [2018-12-08 22:28:10,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:28:10,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-12-08 22:28:10,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:28:10,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:28:10,722 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 11 treesize of output 4 [2018-12-08 22:28:10,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-12-08 22:28:10,746 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 13 treesize of output 10 [2018-12-08 22:28:10,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 22:28:10,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-08 22:28:10,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:28:10,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 22:28:10,764 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,769 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,775 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2018-12-08 22:28:10,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 16 [2018-12-08 22:28:10,798 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 16 treesize of output 4 [2018-12-08 22:28:10,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 22:28:10,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:26 [2018-12-08 22:28:10,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2018-12-08 22:28:10,859 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-08 22:28:10,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:28:10,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2018-12-08 22:28:10,882 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 22:28:10,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:28:10,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-08 22:28:10,904 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:37, output treesize:56 [2018-12-08 22:28:10,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-08 22:28:10,957 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 11 treesize of output 3 [2018-12-08 22:28:10,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,965 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 5 treesize of output 1 [2018-12-08 22:28:10,965 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:10,968 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-12-08 22:28:10,983 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:28:10,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 22:28:11,126 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:28:11,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:28:11,129 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:11,131 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:11,136 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 2 xjuncts. [2018-12-08 22:28:11,136 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:23 [2018-12-08 22:28:11,343 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:11,344 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:11,344 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 33 treesize of output 24 [2018-12-08 22:28:11,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:11,372 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:11,372 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:11,373 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 44 treesize of output 35 [2018-12-08 22:28:11,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:11,375 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:11,376 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:11,376 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 53 treesize of output 44 [2018-12-08 22:28:11,377 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:11,401 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:28:11,407 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:28:11,408 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:28:11,414 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:28:11,433 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:11,434 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:11,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-08 22:28:11,449 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:88, output treesize:57 [2018-12-08 22:28:17,572 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2018-12-08 22:28:27,640 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 51 [2018-12-08 22:28:27,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 27 [2018-12-08 22:28:27,680 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 14 treesize of output 18 [2018-12-08 22:28:27,688 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 17 treesize of output 11 [2018-12-08 22:28:27,688 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:27,690 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,690 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-08 22:28:27,690 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:27,696 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:28:27,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:28:27,706 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 38 treesize of output 36 [2018-12-08 22:28:27,707 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 22 treesize of output 26 [2018-12-08 22:28:27,709 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2018-12-08 22:28:27,711 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,713 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 49 [2018-12-08 22:28:27,774 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,775 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,775 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,775 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,776 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,776 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2018-12-08 22:28:27,776 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:27,778 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,778 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,779 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 29 treesize of output 20 [2018-12-08 22:28:27,779 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:27,817 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,817 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,817 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,818 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,819 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,819 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,820 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 40 [2018-12-08 22:28:27,827 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-12-08 22:28:27,828 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,828 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,829 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,833 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-12-08 22:28:27,833 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-08 22:28:27,882 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 25 treesize of output 23 [2018-12-08 22:28:27,882 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-12-08 22:28:27,884 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,884 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,885 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,885 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:27,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-12-08 22:28:27,887 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:27,906 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 22:28:27,920 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 22:28:27,932 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 22:28:27,947 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 22:28:27,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 19 [2018-12-08 22:28:27,992 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 6 treesize of output 1 [2018-12-08 22:28:27,992 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:27,996 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:27,997 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 30 treesize of output 28 [2018-12-08 22:28:27,998 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 14 treesize of output 18 [2018-12-08 22:28:28,006 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:28,006 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:28,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-08 22:28:28,007 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:28,008 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 17 treesize of output 11 [2018-12-08 22:28:28,008 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:28,014 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:28:28,022 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:28:28,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-12-08 22:28:28,060 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 8 variables, input treesize:87, output treesize:115 [2018-12-08 22:28:32,172 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:28:32,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 22:28:32,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 18] total 47 [2018-12-08 22:28:32,187 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 22:28:32,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-08 22:28:32,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-08 22:28:32,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1889, Unknown=7, NotChecked=0, Total=2162 [2018-12-08 22:28:32,188 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 31 states. [2018-12-08 22:28:33,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:28:33,128 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2018-12-08 22:28:33,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-08 22:28:33,128 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2018-12-08 22:28:33,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:28:33,129 INFO L225 Difference]: With dead ends: 92 [2018-12-08 22:28:33,129 INFO L226 Difference]: Without dead ends: 92 [2018-12-08 22:28:33,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=656, Invalid=3627, Unknown=7, NotChecked=0, Total=4290 [2018-12-08 22:28:33,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-08 22:28:33,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-12-08 22:28:33,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-08 22:28:33,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-12-08 22:28:33,133 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 40 [2018-12-08 22:28:33,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:28:33,134 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-12-08 22:28:33,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-08 22:28:33,134 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-12-08 22:28:33,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 22:28:33,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:28:33,135 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 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-08 22:28:33,135 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION]=== [2018-12-08 22:28:33,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:28:33,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1291613980, now seen corresponding path program 1 times [2018-12-08 22:28:33,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:28:33,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:33,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:28:33,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:28:33,137 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:28:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:28:33,291 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:28:33,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:28:33,291 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 22:28:33,292 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-12-08 22:28:33,292 INFO L205 CegarAbsIntRunner]: [0], [1], [10], [16], [18], [23], [26], [28], [31], [32], [35], [37], [38], [41], [43], [49], [51], [54], [57], [61], [64], [69], [70], [76], [79], [80], [87], [99], [102], [137], [138], [139] [2018-12-08 22:28:33,293 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 22:28:33,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 22:28:33,352 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 22:28:33,353 INFO L272 AbstractInterpreter]: Visited 32 different actions 65 times. Merged at 19 different actions 29 times. Never widened. Performed 577 root evaluator evaluations with a maximum evaluation depth of 3. Performed 577 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 5 different actions. Largest state had 32 variables. [2018-12-08 22:28:33,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:28:33,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 22:28:33,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 22:28:33,354 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56e94ed9-15a2-4cdb-ba69-5b3ba34bcfe6/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-08 22:28:33,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:28:33,363 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 22:28:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:28:33,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 22:28:33,387 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 6 treesize of output 5 [2018-12-08 22:28:33,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 22:28:33,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 22:28:33,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:28:33,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-08 22:28:33,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:28:33,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:28:33,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 22:28:33,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:34 [2018-12-08 22:28:33,513 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 27 treesize of output 22 [2018-12-08 22:28:33,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:28:33,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 22:28:33,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,530 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 13 treesize of output 10 [2018-12-08 22:28:33,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 22:28:33,532 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,541 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:46 [2018-12-08 22:28:33,561 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 31 treesize of output 25 [2018-12-08 22:28:33,563 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 25 treesize of output 10 [2018-12-08 22:28:33,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:28 [2018-12-08 22:28:33,603 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 19 treesize of output 20 [2018-12-08 22:28:33,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:28:33,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-12-08 22:28:33,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:28:33,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:28:33,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:28:33,634 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-08 22:28:33,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:33 [2018-12-08 22:28:33,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-08 22:28:33,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 22:28:33,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 22:28:33,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 13 treesize of output 10 [2018-12-08 22:28:33,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-08 22:28:33,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,695 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:45 [2018-12-08 22:28:33,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 24 [2018-12-08 22:28:33,717 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2018-12-08 22:28:33,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 22:28:33,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:33 [2018-12-08 22:28:33,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-12-08 22:28:33,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 22:28:33,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,789 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-08 22:28:33,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-12-08 22:28:33,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-12-08 22:28:33,844 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 11 treesize of output 3 [2018-12-08 22:28:33,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,850 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 5 treesize of output 1 [2018-12-08 22:28:33,850 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,853 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 5 treesize of output 1 [2018-12-08 22:28:33,854 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:33,859 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:47, output treesize:3 [2018-12-08 22:28:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:28:33,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 22:28:33,920 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:28:33,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:28:33,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:28:33,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2018-12-08 22:28:34,090 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:28:34,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:28:34,096 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:28:34,107 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 22:28:34,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-08 22:28:34,125 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:66 [2018-12-08 22:28:34,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 28 [2018-12-08 22:28:34,239 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 6 treesize of output 1 [2018-12-08 22:28:34,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:34,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 22:28:34,244 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 39 treesize of output 37 [2018-12-08 22:28:34,245 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 14 treesize of output 18 [2018-12-08 22:28:34,253 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 17 treesize of output 11 [2018-12-08 22:28:34,253 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:34,254 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:34,255 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 22:28:34,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-08 22:28:34,255 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 22:28:34,264 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:28:34,295 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 22:28:34,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-12-08 22:28:34,326 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:62, output treesize:94 [2018-12-08 22:28:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:28:34,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 22:28:34,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 14] total 42 [2018-12-08 22:28:34,457 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 22:28:34,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-08 22:28:34,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-08 22:28:34,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1457, Unknown=0, NotChecked=0, Total=1722 [2018-12-08 22:28:34,457 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 30 states. [2018-12-08 22:28:35,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:28:35,573 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-12-08 22:28:35,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-08 22:28:35,573 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 40 [2018-12-08 22:28:35,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:28:35,574 INFO L225 Difference]: With dead ends: 79 [2018-12-08 22:28:35,574 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 22:28:35,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1333 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=920, Invalid=3910, Unknown=0, NotChecked=0, Total=4830 [2018-12-08 22:28:35,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 22:28:35,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 22:28:35,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 22:28:35,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 22:28:35,575 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-12-08 22:28:35,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:28:35,575 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 22:28:35,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-08 22:28:35,575 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 22:28:35,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 22:28:35,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 10:28:35 BoogieIcfgContainer [2018-12-08 22:28:35,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 22:28:35,579 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 22:28:35,579 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 22:28:35,580 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 22:28:35,580 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:28:06" (3/4) ... [2018-12-08 22:28:35,583 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 22:28:35,587 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 22:28:35,587 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-08 22:28:35,588 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 22:28:35,590 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-08 22:28:35,590 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-08 22:28:35,591 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-08 22:28:35,616 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_56e94ed9-15a2-4cdb-ba69-5b3ba34bcfe6/bin-2019/utaipan/witness.graphml [2018-12-08 22:28:35,617 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 22:28:35,617 INFO L168 Benchmark]: Toolchain (without parser) took 29778.62 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 229.6 MB). Free memory was 948.1 MB in the beginning and 832.0 MB in the end (delta: 116.1 MB). Peak memory consumption was 345.7 MB. Max. memory is 11.5 GB. [2018-12-08 22:28:35,617 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 22:28:35,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -149.4 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. [2018-12-08 22:28:35,618 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.22 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 22:28:35,618 INFO L168 Benchmark]: Boogie Preprocessor took 18.32 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-08 22:28:35,618 INFO L168 Benchmark]: RCFGBuilder took 217.93 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-08 22:28:35,618 INFO L168 Benchmark]: TraceAbstraction took 29203.26 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 121.6 MB). Free memory was 1.1 GB in the beginning and 840.1 MB in the end (delta: 227.0 MB). Peak memory consumption was 348.6 MB. Max. memory is 11.5 GB. [2018-12-08 22:28:35,618 INFO L168 Benchmark]: Witness Printer took 37.21 ms. Allocated memory is still 1.3 GB. Free memory was 840.1 MB in the beginning and 832.0 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-12-08 22:28:35,619 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 281.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -149.4 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.22 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.32 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 217.93 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29203.26 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 121.6 MB). Free memory was 1.1 GB in the beginning and 840.1 MB in the end (delta: 227.0 MB). Peak memory consumption was 348.6 MB. Max. memory is 11.5 GB. * Witness Printer took 37.21 ms. Allocated memory is still 1.3 GB. Free memory was 840.1 MB in the beginning and 832.0 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 655]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 655]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 663]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 663]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 664]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 643]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 643]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 645]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 645]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 664]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 666]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 27 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 78 locations, 27 error locations. SAFE Result, 29.1s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 707 SDtfs, 1553 SDslu, 2373 SDs, 0 SdLazy, 2898 SolverSat, 425 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 489 GetRequests, 210 SyntacticMatches, 8 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3495 ImplicationChecksByTransitivity, 24.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 284 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 24.4s InterpolantComputationTime, 477 NumberOfCodeBlocks, 477 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 594 ConstructedInterpolants, 86 QuantifiedInterpolants, 232456 SizeOfPredicates, 87 NumberOfNonLiveVariables, 646 ConjunctsInSsa, 155 ConjunctsInUnsatCore, 23 InterpolantComputations, 11 PerfectInterpolantSequences, 13/97 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...