./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0233d496bfaf5cb1311bfa260a57f41458184795 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:46:49,010 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:46:49,013 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:46:49,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:46:49,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:46:49,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:46:49,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:46:49,034 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:46:49,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:46:49,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:46:49,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:46:49,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:46:49,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:46:49,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:46:49,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:46:49,044 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:46:49,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:46:49,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:46:49,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:46:49,050 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:46:49,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:46:49,054 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:46:49,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:46:49,056 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:46:49,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:46:49,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:46:49,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:46:49,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:46:49,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:46:49,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:46:49,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:46:49,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:46:49,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:46:49,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:46:49,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:46:49,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:46:49,070 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:46:49,071 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:46:49,071 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:46:49,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:46:49,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:46:49,074 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-28 02:46:49,095 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:46:49,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:46:49,097 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:46:49,097 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:46:49,098 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:46:49,098 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:46:49,098 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:46:49,099 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:46:49,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:46:49,099 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:46:49,100 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:46:49,100 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:46:49,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:46:49,101 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:46:49,101 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:46:49,101 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:46:49,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:46:49,102 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:46:49,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:46:49,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:46:49,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:46:49,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:46:49,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:46:49,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:46:49,104 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0233d496bfaf5cb1311bfa260a57f41458184795 [2019-11-28 02:46:49,426 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:46:49,439 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:46:49,442 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:46:49,444 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:46:49,444 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:46:49,445 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2019-11-28 02:46:49,505 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1180bfc8/f2cc2e2a83bf489382e8b6743841c890/FLAG3420001f3 [2019-11-28 02:46:49,964 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:46:49,965 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2019-11-28 02:46:49,972 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1180bfc8/f2cc2e2a83bf489382e8b6743841c890/FLAG3420001f3 [2019-11-28 02:46:50,390 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1180bfc8/f2cc2e2a83bf489382e8b6743841c890 [2019-11-28 02:46:50,394 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:46:50,396 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:46:50,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:50,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:46:50,401 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:46:50,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:50" (1/1) ... [2019-11-28 02:46:50,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bba22f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:50, skipping insertion in model container [2019-11-28 02:46:50,406 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:50" (1/1) ... [2019-11-28 02:46:50,414 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:46:50,432 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:46:50,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:50,625 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:46:50,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:50,658 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:46:50,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:50 WrapperNode [2019-11-28 02:46:50,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:50,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:46:50,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:46:50,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:46:50,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:50" (1/1) ... [2019-11-28 02:46:50,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:50" (1/1) ... [2019-11-28 02:46:50,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:50" (1/1) ... [2019-11-28 02:46:50,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:50" (1/1) ... [2019-11-28 02:46:50,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:50" (1/1) ... [2019-11-28 02:46:50,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:50" (1/1) ... [2019-11-28 02:46:50,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:50" (1/1) ... [2019-11-28 02:46:50,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:46:50,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:46:50,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:46:50,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:46:50,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 02:46:50,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:46:50,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:46:50,807 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:46:50,807 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:46:50,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 02:46:50,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 02:46:50,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 02:46:50,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:46:50,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:46:50,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:46:51,221 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:46:51,221 INFO L297 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-28 02:46:51,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:51 BoogieIcfgContainer [2019-11-28 02:46:51,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:46:51,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:46:51,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:46:51,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:46:51,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:46:50" (1/3) ... [2019-11-28 02:46:51,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2364b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:51, skipping insertion in model container [2019-11-28 02:46:51,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:50" (2/3) ... [2019-11-28 02:46:51,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2364b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:51, skipping insertion in model container [2019-11-28 02:46:51,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:51" (3/3) ... [2019-11-28 02:46:51,232 INFO L109 eAbstractionObserver]: Analyzing ICFG 4BitCounterPointer.c [2019-11-28 02:46:51,247 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:46:51,260 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-11-28 02:46:51,271 INFO L249 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-11-28 02:46:51,289 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:46:51,289 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:46:51,289 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:46:51,289 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:46:51,289 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:46:51,290 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:46:51,290 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:46:51,290 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:46:51,311 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2019-11-28 02:46:51,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 02:46:51,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:51,320 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:51,321 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:46:51,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:51,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1507145205, now seen corresponding path program 1 times [2019-11-28 02:46:51,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:51,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31349078] [2019-11-28 02:46:51,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:51,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31349078] [2019-11-28 02:46:51,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:51,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:51,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621941088] [2019-11-28 02:46:51,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:46:51,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:51,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:46:51,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:51,583 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2019-11-28 02:46:51,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:51,788 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-11-28 02:46:51,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:46:51,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 02:46:51,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:51,803 INFO L225 Difference]: With dead ends: 57 [2019-11-28 02:46:51,803 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 02:46:51,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:51,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 02:46:51,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-28 02:46:51,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 02:46:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-11-28 02:46:51,853 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 7 [2019-11-28 02:46:51,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:51,854 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-11-28 02:46:51,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:46:51,855 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-11-28 02:46:51,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 02:46:51,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:51,856 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:51,857 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:46:51,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:51,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1507145206, now seen corresponding path program 1 times [2019-11-28 02:46:51,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:51,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032740820] [2019-11-28 02:46:51,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:52,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:52,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032740820] [2019-11-28 02:46:52,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:52,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:52,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805246170] [2019-11-28 02:46:52,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:46:52,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:52,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:46:52,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:52,006 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 4 states. [2019-11-28 02:46:52,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:52,158 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-11-28 02:46:52,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:46:52,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 02:46:52,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:52,160 INFO L225 Difference]: With dead ends: 50 [2019-11-28 02:46:52,160 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 02:46:52,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:52,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 02:46:52,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-28 02:46:52,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 02:46:52,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-11-28 02:46:52,178 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 7 [2019-11-28 02:46:52,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:52,178 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-11-28 02:46:52,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:46:52,179 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-11-28 02:46:52,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 02:46:52,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:52,180 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:52,181 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:46:52,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:52,181 INFO L82 PathProgramCache]: Analyzing trace with hash -523138922, now seen corresponding path program 1 times [2019-11-28 02:46:52,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:52,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672305914] [2019-11-28 02:46:52,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:52,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:52,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672305914] [2019-11-28 02:46:52,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:52,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:52,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076194388] [2019-11-28 02:46:52,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:46:52,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:52,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:46:52,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:52,284 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 4 states. [2019-11-28 02:46:52,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:52,396 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-11-28 02:46:52,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:46:52,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 02:46:52,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:52,399 INFO L225 Difference]: With dead ends: 46 [2019-11-28 02:46:52,399 INFO L226 Difference]: Without dead ends: 46 [2019-11-28 02:46:52,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:52,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-28 02:46:52,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-11-28 02:46:52,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 02:46:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-11-28 02:46:52,406 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 8 [2019-11-28 02:46:52,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:52,406 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-11-28 02:46:52,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:46:52,407 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-11-28 02:46:52,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 02:46:52,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:52,407 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:52,408 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:46:52,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:52,408 INFO L82 PathProgramCache]: Analyzing trace with hash -523138921, now seen corresponding path program 1 times [2019-11-28 02:46:52,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:52,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88650911] [2019-11-28 02:46:52,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:52,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88650911] [2019-11-28 02:46:52,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:52,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:52,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671399346] [2019-11-28 02:46:52,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:46:52,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:52,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:46:52,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:52,495 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 4 states. [2019-11-28 02:46:52,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:52,608 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-11-28 02:46:52,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:46:52,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 02:46:52,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:52,611 INFO L225 Difference]: With dead ends: 42 [2019-11-28 02:46:52,611 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 02:46:52,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:52,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 02:46:52,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-28 02:46:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 02:46:52,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-28 02:46:52,624 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 8 [2019-11-28 02:46:52,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:52,625 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-28 02:46:52,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:46:52,625 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-28 02:46:52,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 02:46:52,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:52,626 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:52,627 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:46:52,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:52,628 INFO L82 PathProgramCache]: Analyzing trace with hash 962562584, now seen corresponding path program 1 times [2019-11-28 02:46:52,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:52,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340913261] [2019-11-28 02:46:52,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:52,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340913261] [2019-11-28 02:46:52,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:52,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:52,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400018947] [2019-11-28 02:46:52,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:46:52,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:52,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:46:52,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:52,700 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 4 states. [2019-11-28 02:46:52,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:52,784 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-11-28 02:46:52,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:46:52,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-28 02:46:52,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:52,785 INFO L225 Difference]: With dead ends: 38 [2019-11-28 02:46:52,785 INFO L226 Difference]: Without dead ends: 38 [2019-11-28 02:46:52,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:52,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-28 02:46:52,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-28 02:46:52,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 02:46:52,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-11-28 02:46:52,790 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 9 [2019-11-28 02:46:52,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:52,791 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-11-28 02:46:52,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:46:52,791 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-11-28 02:46:52,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 02:46:52,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:52,792 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:52,792 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:46:52,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:52,793 INFO L82 PathProgramCache]: Analyzing trace with hash 962562585, now seen corresponding path program 1 times [2019-11-28 02:46:52,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:52,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34421816] [2019-11-28 02:46:52,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:52,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:52,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34421816] [2019-11-28 02:46:52,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:52,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:52,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467334996] [2019-11-28 02:46:52,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:46:52,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:52,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:46:52,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:52,843 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 4 states. [2019-11-28 02:46:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:52,922 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-11-28 02:46:52,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:46:52,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-28 02:46:52,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:52,924 INFO L225 Difference]: With dead ends: 34 [2019-11-28 02:46:52,924 INFO L226 Difference]: Without dead ends: 34 [2019-11-28 02:46:52,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:52,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-28 02:46:52,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-28 02:46:52,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 02:46:52,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-11-28 02:46:52,929 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 9 [2019-11-28 02:46:52,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:52,929 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-11-28 02:46:52,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:46:52,929 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-11-28 02:46:52,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:46:52,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:52,930 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:52,930 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:46:52,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:52,931 INFO L82 PathProgramCache]: Analyzing trace with hash -225330983, now seen corresponding path program 1 times [2019-11-28 02:46:52,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:52,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314458447] [2019-11-28 02:46:52,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:52,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:52,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314458447] [2019-11-28 02:46:52,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:52,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:52,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322697998] [2019-11-28 02:46:52,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:46:52,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:52,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:46:52,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:52,994 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 4 states. [2019-11-28 02:46:53,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:53,083 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-11-28 02:46:53,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:46:53,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 02:46:53,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:53,085 INFO L225 Difference]: With dead ends: 31 [2019-11-28 02:46:53,085 INFO L226 Difference]: Without dead ends: 31 [2019-11-28 02:46:53,085 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:53,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-28 02:46:53,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-28 02:46:53,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 02:46:53,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-11-28 02:46:53,094 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 10 [2019-11-28 02:46:53,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:53,094 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-11-28 02:46:53,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:46:53,094 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-11-28 02:46:53,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:46:53,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:53,095 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:53,095 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:46:53,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:53,097 INFO L82 PathProgramCache]: Analyzing trace with hash -225330982, now seen corresponding path program 1 times [2019-11-28 02:46:53,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:53,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071215974] [2019-11-28 02:46:53,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:53,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:53,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071215974] [2019-11-28 02:46:53,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:53,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:53,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272205829] [2019-11-28 02:46:53,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:46:53,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:53,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:46:53,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:53,179 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2019-11-28 02:46:53,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:53,239 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-11-28 02:46:53,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:46:53,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 02:46:53,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:53,241 INFO L225 Difference]: With dead ends: 28 [2019-11-28 02:46:53,242 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 02:46:53,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:46:53,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 02:46:53,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-28 02:46:53,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 02:46:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-11-28 02:46:53,246 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 10 [2019-11-28 02:46:53,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:53,247 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-11-28 02:46:53,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:46:53,247 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-11-28 02:46:53,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 02:46:53,248 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:53,248 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:53,248 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:46:53,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:53,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1860435007, now seen corresponding path program 1 times [2019-11-28 02:46:53,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:53,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294882241] [2019-11-28 02:46:53,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:53,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294882241] [2019-11-28 02:46:53,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:53,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:46:53,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847488642] [2019-11-28 02:46:53,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:46:53,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:53,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:46:53,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:46:53,299 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2019-11-28 02:46:53,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:53,402 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-11-28 02:46:53,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:46:53,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 02:46:53,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:53,403 INFO L225 Difference]: With dead ends: 43 [2019-11-28 02:46:53,403 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 02:46:53,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:46:53,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 02:46:53,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2019-11-28 02:46:53,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 02:46:53,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-28 02:46:53,408 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 14 [2019-11-28 02:46:53,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:53,408 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-28 02:46:53,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:46:53,408 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-28 02:46:53,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:46:53,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:53,409 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:53,410 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:46:53,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:53,410 INFO L82 PathProgramCache]: Analyzing trace with hash 988980839, now seen corresponding path program 1 times [2019-11-28 02:46:53,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:53,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134960699] [2019-11-28 02:46:53,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:53,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:53,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134960699] [2019-11-28 02:46:53,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526155737] [2019-11-28 02:46:53,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:53,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 02:46:53,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:53,707 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:53,708 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-28 02:46:53,710 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:53,719 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:53,722 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:46:53,722 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:4 [2019-11-28 02:46:53,732 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-28 02:46:53,733 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:53,738 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:53,738 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:46:53,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-28 02:46:53,749 INFO L377 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 19 treesize of output 18 [2019-11-28 02:46:53,750 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:53,757 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:53,758 INFO L508 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. [2019-11-28 02:46:53,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-28 02:46:53,830 INFO L377 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 10 [2019-11-28 02:46:53,831 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:53,839 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:53,840 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:46:53,840 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-28 02:46:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:53,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:46:53,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-28 02:46:53,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761011455] [2019-11-28 02:46:53,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:46:53,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:53,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:46:53,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:46:53,845 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 9 states. [2019-11-28 02:46:54,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:54,061 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-11-28 02:46:54,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:46:54,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-11-28 02:46:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:54,063 INFO L225 Difference]: With dead ends: 36 [2019-11-28 02:46:54,064 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 02:46:54,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:46:54,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 02:46:54,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-11-28 02:46:54,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 02:46:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-28 02:46:54,068 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 19 [2019-11-28 02:46:54,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:54,069 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-28 02:46:54,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:46:54,069 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-28 02:46:54,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:46:54,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:54,070 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:54,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:54,275 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:46:54,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:54,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1875845268, now seen corresponding path program 1 times [2019-11-28 02:46:54,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:54,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015127333] [2019-11-28 02:46:54,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:54,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015127333] [2019-11-28 02:46:54,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630705112] [2019-11-28 02:46:54,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:54,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 02:46:54,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:54,766 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:54,767 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-28 02:46:54,769 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:54,777 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:54,778 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:46:54,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-11-28 02:46:54,800 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-28 02:46:54,800 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:54,811 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:54,811 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:46:54,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-28 02:46:54,846 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-28 02:46:54,846 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:54,854 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:54,855 INFO L508 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. [2019-11-28 02:46:54,856 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2019-11-28 02:46:54,899 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-28 02:46:54,899 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:54,917 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:54,918 INFO L508 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. [2019-11-28 02:46:54,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2019-11-28 02:46:54,973 INFO L377 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 13 [2019-11-28 02:46:54,973 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:54,981 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:54,982 INFO L508 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:46:54,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2019-11-28 02:46:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:54,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:46:54,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2019-11-28 02:46:54,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689186151] [2019-11-28 02:46:54,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 02:46:54,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:54,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 02:46:54,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:46:54,987 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 15 states. [2019-11-28 02:46:55,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:55,361 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-11-28 02:46:55,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:46:55,361 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-28 02:46:55,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:55,362 INFO L225 Difference]: With dead ends: 36 [2019-11-28 02:46:55,363 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 02:46:55,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-11-28 02:46:55,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 02:46:55,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-11-28 02:46:55,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 02:46:55,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-28 02:46:55,367 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2019-11-28 02:46:55,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:55,367 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-28 02:46:55,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 02:46:55,368 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-28 02:46:55,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:46:55,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:55,369 INFO L410 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] [2019-11-28 02:46:55,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:55,576 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:46:55,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:55,577 INFO L82 PathProgramCache]: Analyzing trace with hash -230868331, now seen corresponding path program 1 times [2019-11-28 02:46:55,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:55,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123377699] [2019-11-28 02:46:55,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:55,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:55,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123377699] [2019-11-28 02:46:55,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834482228] [2019-11-28 02:46:55,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:55,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-28 02:46:55,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:55,969 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 02:46:55,970 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:55,979 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:55,979 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:46:55,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-28 02:46:56,018 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:56,019 INFO L377 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 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-28 02:46:56,020 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:56,041 INFO L588 ElimStorePlain]: treesize reduction 16, result has 60.0 percent of original size [2019-11-28 02:46:56,041 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 02:46:56,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-11-28 02:46:56,085 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:56,085 INFO L377 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 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-28 02:46:56,086 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:56,107 INFO L588 ElimStorePlain]: treesize reduction 16, result has 56.8 percent of original size [2019-11-28 02:46:56,108 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 02:46:56,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-11-28 02:46:56,154 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:56,155 INFO L377 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 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-28 02:46:56,155 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:56,171 INFO L588 ElimStorePlain]: treesize reduction 16, result has 52.9 percent of original size [2019-11-28 02:46:56,171 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 02:46:56,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-11-28 02:46:56,204 INFO L377 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 15 treesize of output 7 [2019-11-28 02:46:56,205 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:56,208 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:56,208 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:46:56,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-28 02:46:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:56,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:46:56,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2019-11-28 02:46:56,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113953335] [2019-11-28 02:46:56,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:46:56,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:56,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:46:56,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-11-28 02:46:56,225 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 8 states. [2019-11-28 02:46:56,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:56,314 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-11-28 02:46:56,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:46:56,315 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-28 02:46:56,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:56,316 INFO L225 Difference]: With dead ends: 39 [2019-11-28 02:46:56,316 INFO L226 Difference]: Without dead ends: 39 [2019-11-28 02:46:56,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-11-28 02:46:56,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-28 02:46:56,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-11-28 02:46:56,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 02:46:56,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-28 02:46:56,320 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 25 [2019-11-28 02:46:56,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:56,321 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-28 02:46:56,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:46:56,321 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-11-28 02:46:56,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 02:46:56,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:56,322 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-28 02:46:56,526 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:56,526 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:46:56,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:56,527 INFO L82 PathProgramCache]: Analyzing trace with hash -587061395, now seen corresponding path program 1 times [2019-11-28 02:46:56,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:56,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341606875] [2019-11-28 02:46:56,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:57,134 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:57,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341606875] [2019-11-28 02:46:57,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388283452] [2019-11-28 02:46:57,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:46:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:57,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 02:46:57,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:46:57,249 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 02:46:57,250 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:57,261 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:57,261 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:46:57,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-28 02:46:57,311 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:57,312 INFO L377 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 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-28 02:46:57,313 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:57,340 INFO L588 ElimStorePlain]: treesize reduction 16, result has 60.0 percent of original size [2019-11-28 02:46:57,341 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 02:46:57,341 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-11-28 02:46:57,393 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:57,393 INFO L377 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 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-28 02:46:57,394 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:57,418 INFO L588 ElimStorePlain]: treesize reduction 16, result has 60.0 percent of original size [2019-11-28 02:46:57,419 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:46:57,419 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-11-28 02:46:57,480 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:57,481 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 68 [2019-11-28 02:46:57,482 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:57,525 INFO L588 ElimStorePlain]: treesize reduction 24, result has 61.9 percent of original size [2019-11-28 02:46:57,525 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:46:57,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:39 [2019-11-28 02:46:57,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:46:57,827 INFO L404 ElimStorePlain]: Different costs {3=[v_prenex_2], 5=[|v_#memory_int_42|]} [2019-11-28 02:46:57,846 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:57,846 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2019-11-28 02:46:57,847 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:57,895 INFO L588 ElimStorePlain]: treesize reduction 16, result has 76.5 percent of original size [2019-11-28 02:46:57,917 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:57,917 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2019-11-28 02:46:57,918 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:57,960 INFO L588 ElimStorePlain]: treesize reduction 16, result has 73.8 percent of original size [2019-11-28 02:46:57,961 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-28 02:46:57,961 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:45 [2019-11-28 02:46:58,013 INFO L377 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 10 [2019-11-28 02:46:58,013 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:46:58,016 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:46:58,017 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:46:58,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-11-28 02:46:58,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:58,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:46:58,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2019-11-28 02:46:58,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079012259] [2019-11-28 02:46:58,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 02:46:58,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:58,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 02:46:58,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-11-28 02:46:58,042 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 24 states. [2019-11-28 02:46:58,938 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 39 [2019-11-28 02:46:59,412 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2019-11-28 02:47:00,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:00,243 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2019-11-28 02:47:00,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 02:47:00,243 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-11-28 02:47:00,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:00,244 INFO L225 Difference]: With dead ends: 65 [2019-11-28 02:47:00,244 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 02:47:00,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=414, Invalid=1566, Unknown=0, NotChecked=0, Total=1980 [2019-11-28 02:47:00,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 02:47:00,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 38. [2019-11-28 02:47:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 02:47:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-28 02:47:00,250 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 30 [2019-11-28 02:47:00,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:00,250 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-28 02:47:00,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 02:47:00,250 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-28 02:47:00,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 02:47:00,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:00,251 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:00,457 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:00,457 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:47:00,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:00,458 INFO L82 PathProgramCache]: Analyzing trace with hash 349814, now seen corresponding path program 1 times [2019-11-28 02:47:00,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:00,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667520881] [2019-11-28 02:47:00,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:00,556 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:00,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667520881] [2019-11-28 02:47:00,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390997824] [2019-11-28 02:47:00,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:00,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 02:47:00,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:00,646 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 02:47:00,647 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:00,655 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:00,656 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:00,656 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-11-28 02:47:00,689 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:00,689 INFO L377 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 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-28 02:47:00,690 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:00,714 INFO L588 ElimStorePlain]: treesize reduction 12, result has 67.6 percent of original size [2019-11-28 02:47:00,715 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:00,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:25 [2019-11-28 02:47:00,820 INFO L377 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 19 treesize of output 18 [2019-11-28 02:47:00,821 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:00,832 INFO L588 ElimStorePlain]: treesize reduction 7, result has 61.1 percent of original size [2019-11-28 02:47:00,832 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:00,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:11 [2019-11-28 02:47:00,861 INFO L377 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 15 treesize of output 7 [2019-11-28 02:47:00,862 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:00,865 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:00,865 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:00,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-28 02:47:00,892 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:00,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:00,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-28 02:47:00,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633449574] [2019-11-28 02:47:00,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 02:47:00,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:00,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 02:47:00,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-28 02:47:00,895 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 16 states. [2019-11-28 02:47:01,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:01,340 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2019-11-28 02:47:01,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:47:01,341 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-11-28 02:47:01,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:01,342 INFO L225 Difference]: With dead ends: 57 [2019-11-28 02:47:01,342 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 02:47:01,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2019-11-28 02:47:01,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 02:47:01,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2019-11-28 02:47:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 02:47:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-11-28 02:47:01,348 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 34 [2019-11-28 02:47:01,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:01,349 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-11-28 02:47:01,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 02:47:01,349 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-11-28 02:47:01,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 02:47:01,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:01,350 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 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] [2019-11-28 02:47:01,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:01,552 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:47:01,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:01,553 INFO L82 PathProgramCache]: Analyzing trace with hash 210942700, now seen corresponding path program 1 times [2019-11-28 02:47:01,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:01,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301408948] [2019-11-28 02:47:01,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:01,809 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 02:47:01,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301408948] [2019-11-28 02:47:01,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417554213] [2019-11-28 02:47:01,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:01,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-28 02:47:01,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:01,899 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 02:47:01,899 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:01,909 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:01,910 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:01,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-28 02:47:01,943 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:01,943 INFO L377 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 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-28 02:47:01,944 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:01,972 INFO L588 ElimStorePlain]: treesize reduction 16, result has 62.8 percent of original size [2019-11-28 02:47:01,973 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:01,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-28 02:47:02,044 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:02,045 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 68 [2019-11-28 02:47:02,045 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:02,084 INFO L588 ElimStorePlain]: treesize reduction 24, result has 63.6 percent of original size [2019-11-28 02:47:02,085 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:02,085 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:42 [2019-11-28 02:47:02,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:02,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:02,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:02,167 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:02,167 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2019-11-28 02:47:02,168 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:02,195 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:02,196 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2019-11-28 02:47:02,197 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:02,206 INFO L377 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 19 treesize of output 11 [2019-11-28 02:47:02,207 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:02,249 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:02,249 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-11-28 02:47:02,250 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:02,380 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 23 [2019-11-28 02:47:02,380 INFO L588 ElimStorePlain]: treesize reduction 167, result has 16.9 percent of original size [2019-11-28 02:47:02,381 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:02,381 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:165, output treesize:34 [2019-11-28 02:47:02,484 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:02,485 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 110 [2019-11-28 02:47:02,486 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:02,535 INFO L588 ElimStorePlain]: treesize reduction 36, result has 59.6 percent of original size [2019-11-28 02:47:02,535 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:02,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:53 [2019-11-28 02:47:02,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:02,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:02,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:02,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:02,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:02,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:02,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:02,624 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:02,624 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2019-11-28 02:47:02,626 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:02,636 INFO L377 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 19 treesize of output 11 [2019-11-28 02:47:02,637 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:02,665 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:02,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2019-11-28 02:47:02,666 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:02,698 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:02,698 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2019-11-28 02:47:02,699 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:02,760 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:02,760 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-11-28 02:47:02,762 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:02,824 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:02,824 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-11-28 02:47:02,825 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:02,934 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:02,934 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 137 [2019-11-28 02:47:02,936 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:02,984 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:02,985 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-11-28 02:47:02,986 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:03,378 WARN L192 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-11-28 02:47:03,379 INFO L588 ElimStorePlain]: treesize reduction 340, result has 34.7 percent of original size [2019-11-28 02:47:03,380 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-11-28 02:47:03,380 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 1 variables, input treesize:369, output treesize:181 [2019-11-28 02:47:03,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-28 02:47:03,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:03,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:03,851 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-11-28 02:47:04,037 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-11-28 02:47:04,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 02:47:04,049 INFO L404 ElimStorePlain]: Different costs {9=[|v_#memory_int_52|, v_prenex_5], 11=[v_prenex_7]} [2019-11-28 02:47:04,088 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:04,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-11-28 02:47:04,090 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:04,208 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-11-28 02:47:04,209 INFO L588 ElimStorePlain]: treesize reduction 32, result has 78.7 percent of original size [2019-11-28 02:47:04,256 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:04,256 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-11-28 02:47:04,257 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:04,392 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-11-28 02:47:04,393 INFO L588 ElimStorePlain]: treesize reduction 32, result has 78.2 percent of original size [2019-11-28 02:47:04,440 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:04,440 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-11-28 02:47:04,441 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:04,562 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-11-28 02:47:04,563 INFO L588 ElimStorePlain]: treesize reduction 32, result has 77.8 percent of original size [2019-11-28 02:47:04,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:04,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:04,566 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-28 02:47:04,566 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:121, output treesize:112 [2019-11-28 02:47:04,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:04,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:04,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:04,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:04,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:04,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:04,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:04,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:04,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:04,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:04,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:04,765 INFO L404 ElimStorePlain]: Different costs {6=[|v_#memory_int_53|], 9=[v_prenex_8]} [2019-11-28 02:47:04,818 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:04,819 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 79 [2019-11-28 02:47:04,820 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:04,834 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-28 02:47:04,834 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:04,927 INFO L588 ElimStorePlain]: treesize reduction 69, result has 58.2 percent of original size [2019-11-28 02:47:04,978 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:04,979 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 79 [2019-11-28 02:47:04,980 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:04,987 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-28 02:47:04,987 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:05,034 INFO L588 ElimStorePlain]: treesize reduction 69, result has 39.5 percent of original size [2019-11-28 02:47:05,036 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-28 02:47:05,036 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:147, output treesize:45 [2019-11-28 02:47:05,087 INFO L377 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 10 [2019-11-28 02:47:05,087 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:05,098 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:05,099 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:05,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-11-28 02:47:05,116 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:05,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:05,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 21 [2019-11-28 02:47:05,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754779361] [2019-11-28 02:47:05,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 02:47:05,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:05,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 02:47:05,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-11-28 02:47:05,119 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 21 states. [2019-11-28 02:47:05,924 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-11-28 02:47:06,143 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 51 [2019-11-28 02:47:06,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:06,636 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2019-11-28 02:47:06,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 02:47:06,637 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2019-11-28 02:47:06,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:06,638 INFO L225 Difference]: With dead ends: 88 [2019-11-28 02:47:06,638 INFO L226 Difference]: Without dead ends: 88 [2019-11-28 02:47:06,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2019-11-28 02:47:06,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-28 02:47:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 62. [2019-11-28 02:47:06,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 02:47:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2019-11-28 02:47:06,651 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 44 [2019-11-28 02:47:06,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:06,651 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2019-11-28 02:47:06,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 02:47:06,651 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2019-11-28 02:47:06,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-28 02:47:06,655 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:06,655 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 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] [2019-11-28 02:47:06,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:06,863 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:47:06,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:06,863 INFO L82 PathProgramCache]: Analyzing trace with hash 264149196, now seen corresponding path program 1 times [2019-11-28 02:47:06,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:06,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750494021] [2019-11-28 02:47:06,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:07,055 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 29 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 02:47:07,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750494021] [2019-11-28 02:47:07,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96201736] [2019-11-28 02:47:07,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:07,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-28 02:47:07,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:07,141 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:07,141 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-28 02:47:07,142 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:07,151 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:07,152 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:07,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:11 [2019-11-28 02:47:07,170 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-28 02:47:07,170 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:07,178 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:07,178 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:07,178 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-11-28 02:47:07,198 INFO L377 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 15 treesize of output 7 [2019-11-28 02:47:07,198 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:07,205 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:07,206 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:07,206 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:14 [2019-11-28 02:47:07,227 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-28 02:47:07,227 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:07,234 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:07,235 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:07,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-11-28 02:47:07,279 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:07,279 INFO L377 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 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-28 02:47:07,280 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:07,306 INFO L588 ElimStorePlain]: treesize reduction 12, result has 70.7 percent of original size [2019-11-28 02:47:07,306 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:07,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:29 [2019-11-28 02:47:07,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:07,346 INFO L377 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 19 treesize of output 18 [2019-11-28 02:47:07,347 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:07,372 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:07,372 INFO L377 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 60 [2019-11-28 02:47:07,373 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:07,438 INFO L588 ElimStorePlain]: treesize reduction 20, result has 77.5 percent of original size [2019-11-28 02:47:07,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:07,440 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-28 02:47:07,440 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:69 [2019-11-28 02:47:07,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:07,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 02:47:07,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 02:47:07,615 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-28 02:47:07,616 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:07,623 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:07,624 INFO L508 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. [2019-11-28 02:47:07,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2019-11-28 02:47:07,650 INFO L377 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 10 [2019-11-28 02:47:07,650 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:07,654 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:07,655 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:07,655 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-28 02:47:07,681 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 02:47:07,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:07,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2019-11-28 02:47:07,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215123945] [2019-11-28 02:47:07,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 02:47:07,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:07,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 02:47:07,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-11-28 02:47:07,684 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 19 states. [2019-11-28 02:47:09,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:09,016 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2019-11-28 02:47:09,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 02:47:09,017 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-11-28 02:47:09,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:09,019 INFO L225 Difference]: With dead ends: 91 [2019-11-28 02:47:09,019 INFO L226 Difference]: Without dead ends: 91 [2019-11-28 02:47:09,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2019-11-28 02:47:09,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-28 02:47:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 76. [2019-11-28 02:47:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-28 02:47:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2019-11-28 02:47:09,027 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 55 [2019-11-28 02:47:09,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:09,028 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2019-11-28 02:47:09,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 02:47:09,028 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2019-11-28 02:47:09,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-28 02:47:09,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:09,030 INFO L410 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:09,234 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:09,235 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 02:47:09,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:09,235 INFO L82 PathProgramCache]: Analyzing trace with hash -2053442217, now seen corresponding path program 2 times [2019-11-28 02:47:09,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:09,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805401028] [2019-11-28 02:47:09,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:09,840 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-11-28 02:47:10,044 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-11-28 02:47:10,187 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-11-28 02:47:10,333 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-11-28 02:47:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:11,034 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 102 proven. 38 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 02:47:11,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805401028] [2019-11-28 02:47:11,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925167897] [2019-11-28 02:47:11,035 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:11,091 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:47:11,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:47:11,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 02:47:11,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-11-28 02:47:11,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:47:11,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 15 [2019-11-28 02:47:11,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84175408] [2019-11-28 02:47:11,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:47:11,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:11,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:47:11,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2019-11-28 02:47:11,318 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 5 states. [2019-11-28 02:47:11,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:11,381 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2019-11-28 02:47:11,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:47:11,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-11-28 02:47:11,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:11,383 INFO L225 Difference]: With dead ends: 75 [2019-11-28 02:47:11,383 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:47:11,383 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2019-11-28 02:47:11,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:47:11,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:47:11,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:47:11,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:47:11,384 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2019-11-28 02:47:11,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:11,384 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:47:11,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:47:11,384 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:47:11,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:47:11,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:11,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:47:11 BoogieIcfgContainer [2019-11-28 02:47:11,592 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:47:11,592 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:47:11,592 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:47:11,593 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:47:11,593 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:51" (3/4) ... [2019-11-28 02:47:11,598 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:47:11,604 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 02:47:11,604 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 02:47:11,610 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-11-28 02:47:11,610 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 02:47:11,610 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 02:47:11,611 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 02:47:11,651 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:47:11,651 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:47:11,652 INFO L168 Benchmark]: Toolchain (without parser) took 21256.90 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 364.4 MB). Free memory was 955.0 MB in the beginning and 891.0 MB in the end (delta: 64.0 MB). Peak memory consumption was 428.4 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:11,652 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:47:11,653 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.56 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 944.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:11,653 INFO L168 Benchmark]: Boogie Preprocessor took 91.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -177.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:11,653 INFO L168 Benchmark]: RCFGBuilder took 470.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:11,654 INFO L168 Benchmark]: TraceAbstraction took 20368.21 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 226.0 MB). Free memory was 1.1 GB in the beginning and 891.0 MB in the end (delta: 206.8 MB). Peak memory consumption was 432.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:11,654 INFO L168 Benchmark]: Witness Printer took 58.55 ms. Allocated memory is still 1.4 GB. Free memory is still 891.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:47:11,656 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 262.56 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 944.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -177.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 470.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20368.21 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 226.0 MB). Free memory was 1.1 GB in the beginning and 891.0 MB in the end (delta: 206.8 MB). Peak memory consumption was 432.7 MB. Max. memory is 11.5 GB. * Witness Printer took 58.55 ms. Allocated memory is still 1.4 GB. Free memory is still 891.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 61 locations, 31 error locations. Result: SAFE, OverallTime: 20.2s, OverallIterations: 17, TraceHistogramMax: 9, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 286 SDtfs, 971 SDslu, 832 SDs, 0 SdLazy, 2345 SolverSat, 565 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 510 GetRequests, 289 SyntacticMatches, 12 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 106 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 686 NumberOfCodeBlocks, 627 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 661 ConstructedInterpolants, 23 QuantifiedInterpolants, 895755 SizeOfPredicates, 81 NumberOfNonLiveVariables, 1348 ConjunctsInSsa, 172 ConjunctsInUnsatCore, 25 InterpolantComputations, 11 PerfectInterpolantSequences, 417/560 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...