./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2d5aae62-0195-4996-b15e-1f7f7804f66c/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_2d5aae62-0195-4996-b15e-1f7f7804f66c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2d5aae62-0195-4996-b15e-1f7f7804f66c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2d5aae62-0195-4996-b15e-1f7f7804f66c/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2d5aae62-0195-4996-b15e-1f7f7804f66c/bin/uautomizer/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2d5aae62-0195-4996-b15e-1f7f7804f66c/bin/uautomizer --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.2.0-a4ecdab [2020-11-30 00:53:10,914 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:53:10,918 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:53:10,964 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:53:10,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:53:10,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:53:10,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:53:10,972 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:53:10,975 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:53:10,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:53:10,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:53:10,981 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:53:10,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:53:10,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:53:10,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:53:10,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:53:10,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:53:10,990 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:53:10,992 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:53:10,995 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:53:10,998 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:53:11,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:53:11,006 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:53:11,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:53:11,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:53:11,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:53:11,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:53:11,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:53:11,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:53:11,028 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:53:11,028 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:53:11,031 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:53:11,033 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:53:11,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:53:11,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:53:11,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:53:11,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:53:11,043 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:53:11,043 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:53:11,045 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:53:11,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:53:11,050 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2d5aae62-0195-4996-b15e-1f7f7804f66c/bin/uautomizer/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2020-11-30 00:53:11,120 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:53:11,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:53:11,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:53:11,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:53:11,124 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:53:11,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:53:11,125 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 00:53:11,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:53:11,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:53:11,126 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-30 00:53:11,127 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-30 00:53:11,128 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-30 00:53:11,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 00:53:11,128 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 00:53:11,129 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:53:11,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:53:11,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:53:11,129 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 00:53:11,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 00:53:11,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:53:11,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:53:11,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 00:53:11,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:53:11,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 00:53:11,138 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:53:11,139 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_2d5aae62-0195-4996-b15e-1f7f7804f66c/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_2d5aae62-0195-4996-b15e-1f7f7804f66c/bin/uautomizer 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 [2020-11-30 00:53:11,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:53:11,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:53:11,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:53:11,582 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:53:11,583 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:53:11,584 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2d5aae62-0195-4996-b15e-1f7f7804f66c/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2020-11-30 00:53:11,678 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2d5aae62-0195-4996-b15e-1f7f7804f66c/bin/uautomizer/data/d39a87b33/cc3456670e56436788c97ab186992b5c/FLAG2b3ceacc2 [2020-11-30 00:53:12,175 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:53:12,176 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2d5aae62-0195-4996-b15e-1f7f7804f66c/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2020-11-30 00:53:12,183 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2d5aae62-0195-4996-b15e-1f7f7804f66c/bin/uautomizer/data/d39a87b33/cc3456670e56436788c97ab186992b5c/FLAG2b3ceacc2 [2020-11-30 00:53:12,577 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2d5aae62-0195-4996-b15e-1f7f7804f66c/bin/uautomizer/data/d39a87b33/cc3456670e56436788c97ab186992b5c [2020-11-30 00:53:12,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:53:12,607 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-30 00:53:12,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:53:12,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:53:12,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:53:12,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:53:12" (1/1) ... [2020-11-30 00:53:12,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@136e5567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:53:12, skipping insertion in model container [2020-11-30 00:53:12,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:53:12" (1/1) ... [2020-11-30 00:53:12,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:53:12,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:53:12,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:53:12,890 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:53:12,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:53:12,953 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:53:12,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:53:12 WrapperNode [2020-11-30 00:53:12,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:53:12,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:53:12,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:53:12,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:53:12,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:53:12" (1/1) ... [2020-11-30 00:53:12,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:53:12" (1/1) ... [2020-11-30 00:53:12,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:53:12" (1/1) ... [2020-11-30 00:53:12,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:53:12" (1/1) ... [2020-11-30 00:53:13,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:53:12" (1/1) ... [2020-11-30 00:53:13,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:53:12" (1/1) ... [2020-11-30 00:53:13,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:53:12" (1/1) ... [2020-11-30 00:53:13,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:53:13,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:53:13,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:53:13,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:53:13,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:53:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2d5aae62-0195-4996-b15e-1f7f7804f66c/bin/uautomizer/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 [2020-11-30 00:53:13,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-30 00:53:13,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:53:13,128 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-30 00:53:13,128 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-30 00:53:13,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:53:13,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 00:53:13,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 00:53:13,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 00:53:13,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-30 00:53:13,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:53:13,731 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:53:13,732 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-30 00:53:13,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:53:13 BoogieIcfgContainer [2020-11-30 00:53:13,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:53:13,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 00:53:13,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 00:53:13,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 00:53:13,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:53:12" (1/3) ... [2020-11-30 00:53:13,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87f31e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:53:13, skipping insertion in model container [2020-11-30 00:53:13,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:53:12" (2/3) ... [2020-11-30 00:53:13,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87f31e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:53:13, skipping insertion in model container [2020-11-30 00:53:13,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:53:13" (3/3) ... [2020-11-30 00:53:13,752 INFO L111 eAbstractionObserver]: Analyzing ICFG 4BitCounterPointer.c [2020-11-30 00:53:13,766 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 00:53:13,772 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2020-11-30 00:53:13,787 INFO L253 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2020-11-30 00:53:13,817 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 00:53:13,817 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-30 00:53:13,818 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 00:53:13,818 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:53:13,818 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:53:13,818 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 00:53:13,821 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:53:13,821 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 00:53:13,850 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2020-11-30 00:53:13,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-30 00:53:13,866 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:53:13,867 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:53:13,867 INFO L429 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]=== [2020-11-30 00:53:13,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:53:13,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1507145205, now seen corresponding path program 1 times [2020-11-30 00:53:13,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:53:13,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601858338] [2020-11-30 00:53:13,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:53:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:14,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:53:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:14,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:53:14,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601858338] [2020-11-30 00:53:14,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:53:14,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:53:14,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478410310] [2020-11-30 00:53:14,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:53:14,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:53:14,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:53:14,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:53:14,188 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2020-11-30 00:53:14,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:53:14,426 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2020-11-30 00:53:14,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:53:14,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-11-30 00:53:14,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:53:14,447 INFO L225 Difference]: With dead ends: 57 [2020-11-30 00:53:14,448 INFO L226 Difference]: Without dead ends: 54 [2020-11-30 00:53:14,450 INFO L677 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 [2020-11-30 00:53:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-11-30 00:53:14,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-11-30 00:53:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-30 00:53:14,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2020-11-30 00:53:14,502 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 7 [2020-11-30 00:53:14,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:53:14,503 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2020-11-30 00:53:14,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:53:14,503 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2020-11-30 00:53:14,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-30 00:53:14,505 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:53:14,505 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:53:14,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 00:53:14,507 INFO L429 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]=== [2020-11-30 00:53:14,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:53:14,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1507145206, now seen corresponding path program 1 times [2020-11-30 00:53:14,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:53:14,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21525805] [2020-11-30 00:53:14,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:53:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:14,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:53:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:14,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:53:14,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21525805] [2020-11-30 00:53:14,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:53:14,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:53:14,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448948892] [2020-11-30 00:53:14,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:53:14,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:53:14,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:53:14,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:53:14,649 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 4 states. [2020-11-30 00:53:14,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:53:14,854 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2020-11-30 00:53:14,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:53:14,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-11-30 00:53:14,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:53:14,856 INFO L225 Difference]: With dead ends: 50 [2020-11-30 00:53:14,856 INFO L226 Difference]: Without dead ends: 50 [2020-11-30 00:53:14,857 INFO L677 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 [2020-11-30 00:53:14,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-11-30 00:53:14,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-11-30 00:53:14,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-11-30 00:53:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2020-11-30 00:53:14,870 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 7 [2020-11-30 00:53:14,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:53:14,871 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2020-11-30 00:53:14,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:53:14,872 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2020-11-30 00:53:14,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-30 00:53:14,873 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:53:14,873 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:53:14,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 00:53:14,875 INFO L429 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]=== [2020-11-30 00:53:14,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:53:14,878 INFO L82 PathProgramCache]: Analyzing trace with hash -523138922, now seen corresponding path program 1 times [2020-11-30 00:53:14,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:53:14,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651062557] [2020-11-30 00:53:14,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:53:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:15,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:53:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:53:15,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651062557] [2020-11-30 00:53:15,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:53:15,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:53:15,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112077018] [2020-11-30 00:53:15,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:53:15,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:53:15,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:53:15,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:53:15,019 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 4 states. [2020-11-30 00:53:15,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:53:15,151 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2020-11-30 00:53:15,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:53:15,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-11-30 00:53:15,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:53:15,153 INFO L225 Difference]: With dead ends: 46 [2020-11-30 00:53:15,154 INFO L226 Difference]: Without dead ends: 46 [2020-11-30 00:53:15,154 INFO L677 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 [2020-11-30 00:53:15,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-11-30 00:53:15,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-11-30 00:53:15,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-11-30 00:53:15,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2020-11-30 00:53:15,161 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 8 [2020-11-30 00:53:15,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:53:15,162 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2020-11-30 00:53:15,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:53:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2020-11-30 00:53:15,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-30 00:53:15,163 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:53:15,163 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:53:15,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 00:53:15,164 INFO L429 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]=== [2020-11-30 00:53:15,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:53:15,164 INFO L82 PathProgramCache]: Analyzing trace with hash -523138921, now seen corresponding path program 1 times [2020-11-30 00:53:15,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:53:15,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317512606] [2020-11-30 00:53:15,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:53:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:15,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:53:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:53:15,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317512606] [2020-11-30 00:53:15,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:53:15,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:53:15,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758040533] [2020-11-30 00:53:15,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:53:15,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:53:15,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:53:15,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:53:15,295 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 4 states. [2020-11-30 00:53:15,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:53:15,427 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2020-11-30 00:53:15,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:53:15,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-11-30 00:53:15,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:53:15,429 INFO L225 Difference]: With dead ends: 42 [2020-11-30 00:53:15,429 INFO L226 Difference]: Without dead ends: 42 [2020-11-30 00:53:15,430 INFO L677 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 [2020-11-30 00:53:15,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-30 00:53:15,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-30 00:53:15,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-30 00:53:15,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2020-11-30 00:53:15,436 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 8 [2020-11-30 00:53:15,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:53:15,437 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2020-11-30 00:53:15,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:53:15,437 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2020-11-30 00:53:15,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 00:53:15,438 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:53:15,438 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:53:15,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 00:53:15,438 INFO L429 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]=== [2020-11-30 00:53:15,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:53:15,443 INFO L82 PathProgramCache]: Analyzing trace with hash 962562584, now seen corresponding path program 1 times [2020-11-30 00:53:15,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:53:15,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135158518] [2020-11-30 00:53:15,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:53:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:15,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:53:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:15,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:53:15,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135158518] [2020-11-30 00:53:15,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:53:15,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:53:15,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158264107] [2020-11-30 00:53:15,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:53:15,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:53:15,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:53:15,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:53:15,562 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 4 states. [2020-11-30 00:53:15,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:53:15,717 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2020-11-30 00:53:15,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:53:15,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-11-30 00:53:15,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:53:15,719 INFO L225 Difference]: With dead ends: 38 [2020-11-30 00:53:15,719 INFO L226 Difference]: Without dead ends: 38 [2020-11-30 00:53:15,720 INFO L677 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 [2020-11-30 00:53:15,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-11-30 00:53:15,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-11-30 00:53:15,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-11-30 00:53:15,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2020-11-30 00:53:15,726 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 9 [2020-11-30 00:53:15,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:53:15,726 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2020-11-30 00:53:15,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:53:15,732 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2020-11-30 00:53:15,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 00:53:15,733 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:53:15,733 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:53:15,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 00:53:15,734 INFO L429 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]=== [2020-11-30 00:53:15,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:53:15,735 INFO L82 PathProgramCache]: Analyzing trace with hash 962562585, now seen corresponding path program 1 times [2020-11-30 00:53:15,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:53:15,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510731178] [2020-11-30 00:53:15,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:53:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:15,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:53:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:15,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:53:15,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510731178] [2020-11-30 00:53:15,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:53:15,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:53:15,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363803337] [2020-11-30 00:53:15,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:53:15,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:53:15,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:53:15,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:53:15,848 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 4 states. [2020-11-30 00:53:15,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:53:15,958 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2020-11-30 00:53:15,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:53:15,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-11-30 00:53:15,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:53:15,960 INFO L225 Difference]: With dead ends: 34 [2020-11-30 00:53:15,960 INFO L226 Difference]: Without dead ends: 34 [2020-11-30 00:53:15,961 INFO L677 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 [2020-11-30 00:53:15,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-11-30 00:53:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-11-30 00:53:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-30 00:53:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2020-11-30 00:53:15,966 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 9 [2020-11-30 00:53:15,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:53:15,967 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2020-11-30 00:53:15,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:53:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2020-11-30 00:53:15,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 00:53:15,968 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:53:15,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:53:15,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 00:53:15,969 INFO L429 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]=== [2020-11-30 00:53:15,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:53:15,969 INFO L82 PathProgramCache]: Analyzing trace with hash -225330983, now seen corresponding path program 1 times [2020-11-30 00:53:15,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:53:15,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777037240] [2020-11-30 00:53:15,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:53:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:16,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:53:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:53:16,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777037240] [2020-11-30 00:53:16,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:53:16,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:53:16,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117103609] [2020-11-30 00:53:16,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:53:16,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:53:16,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:53:16,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:53:16,019 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 4 states. [2020-11-30 00:53:16,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:53:16,116 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2020-11-30 00:53:16,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:53:16,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-30 00:53:16,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:53:16,117 INFO L225 Difference]: With dead ends: 31 [2020-11-30 00:53:16,117 INFO L226 Difference]: Without dead ends: 31 [2020-11-30 00:53:16,118 INFO L677 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 [2020-11-30 00:53:16,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-11-30 00:53:16,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-11-30 00:53:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-30 00:53:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2020-11-30 00:53:16,122 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 10 [2020-11-30 00:53:16,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:53:16,122 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2020-11-30 00:53:16,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:53:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-11-30 00:53:16,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 00:53:16,123 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:53:16,124 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:53:16,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 00:53:16,124 INFO L429 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]=== [2020-11-30 00:53:16,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:53:16,125 INFO L82 PathProgramCache]: Analyzing trace with hash -225330982, now seen corresponding path program 1 times [2020-11-30 00:53:16,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:53:16,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861694981] [2020-11-30 00:53:16,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:53:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:16,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:53:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:16,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:53:16,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861694981] [2020-11-30 00:53:16,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:53:16,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:53:16,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265320178] [2020-11-30 00:53:16,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:53:16,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:53:16,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:53:16,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:53:16,200 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2020-11-30 00:53:16,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:53:16,297 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-11-30 00:53:16,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:53:16,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-30 00:53:16,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:53:16,298 INFO L225 Difference]: With dead ends: 28 [2020-11-30 00:53:16,299 INFO L226 Difference]: Without dead ends: 28 [2020-11-30 00:53:16,299 INFO L677 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 [2020-11-30 00:53:16,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-11-30 00:53:16,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-11-30 00:53:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-11-30 00:53:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2020-11-30 00:53:16,304 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 10 [2020-11-30 00:53:16,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:53:16,304 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2020-11-30 00:53:16,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:53:16,304 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-11-30 00:53:16,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 00:53:16,305 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:53:16,305 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:53:16,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 00:53:16,305 INFO L429 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]=== [2020-11-30 00:53:16,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:53:16,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1860435007, now seen corresponding path program 1 times [2020-11-30 00:53:16,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:53:16,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481179417] [2020-11-30 00:53:16,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:53:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:16,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:53:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:16,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:53:16,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481179417] [2020-11-30 00:53:16,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:53:16,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:53:16,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726616288] [2020-11-30 00:53:16,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:53:16,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:53:16,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:53:16,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:53:16,362 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2020-11-30 00:53:16,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:53:16,489 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2020-11-30 00:53:16,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:53:16,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-30 00:53:16,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:53:16,491 INFO L225 Difference]: With dead ends: 43 [2020-11-30 00:53:16,491 INFO L226 Difference]: Without dead ends: 43 [2020-11-30 00:53:16,492 INFO L677 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 [2020-11-30 00:53:16,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-11-30 00:53:16,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2020-11-30 00:53:16,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-11-30 00:53:16,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-11-30 00:53:16,497 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 14 [2020-11-30 00:53:16,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:53:16,498 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-11-30 00:53:16,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:53:16,498 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-11-30 00:53:16,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-30 00:53:16,499 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:53:16,499 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:53:16,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 00:53:16,500 INFO L429 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]=== [2020-11-30 00:53:16,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:53:16,501 INFO L82 PathProgramCache]: Analyzing trace with hash 988980839, now seen corresponding path program 1 times [2020-11-30 00:53:16,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:53:16,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012198113] [2020-11-30 00:53:16,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:53:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:16,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:53:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:16,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:53:16,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012198113] [2020-11-30 00:53:16,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942875442] [2020-11-30 00:53:16,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2d5aae62-0195-4996-b15e-1f7f7804f66c/bin/uautomizer/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 [2020-11-30 00:53:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:16,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 00:53:16,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:53:16,859 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:16,859 INFO L384 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 [2020-11-30 00:53:16,862 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:16,887 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:16,896 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:53:16,896 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:4 [2020-11-30 00:53:16,912 INFO L384 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 [2020-11-30 00:53:16,912 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:16,940 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:16,941 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:53:16,941 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-11-30 00:53:16,972 INFO L384 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 [2020-11-30 00:53:16,973 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:16,985 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:16,989 INFO L545 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. [2020-11-30 00:53:16,989 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-11-30 00:53:17,125 INFO L384 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 [2020-11-30 00:53:17,128 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:17,133 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:17,135 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:53:17,136 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-11-30 00:53:17,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:53:17,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:53:17,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2020-11-30 00:53:17,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841056793] [2020-11-30 00:53:17,140 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 00:53:17,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:53:17,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 00:53:17,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:53:17,142 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 9 states. [2020-11-30 00:53:17,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:53:17,460 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-11-30 00:53:17,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 00:53:17,461 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-11-30 00:53:17,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:53:17,462 INFO L225 Difference]: With dead ends: 36 [2020-11-30 00:53:17,462 INFO L226 Difference]: Without dead ends: 36 [2020-11-30 00:53:17,463 INFO L677 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 [2020-11-30 00:53:17,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-11-30 00:53:17,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2020-11-30 00:53:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-11-30 00:53:17,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-11-30 00:53:17,467 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 19 [2020-11-30 00:53:17,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:53:17,467 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-11-30 00:53:17,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 00:53:17,467 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-11-30 00:53:17,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 00:53:17,468 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:53:17,468 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:53:17,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-11-30 00:53:17,683 INFO L429 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]=== [2020-11-30 00:53:17,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:53:17,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1875845268, now seen corresponding path program 1 times [2020-11-30 00:53:17,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:53:17,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282655284] [2020-11-30 00:53:17,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:53:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:18,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:53:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:18,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:53:18,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282655284] [2020-11-30 00:53:18,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388064251] [2020-11-30 00:53:18,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2d5aae62-0195-4996-b15e-1f7f7804f66c/bin/uautomizer/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 [2020-11-30 00:53:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:18,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-30 00:53:18,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:53:18,179 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:18,179 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2020-11-30 00:53:18,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:53:18,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:18,198 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:18,215 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:18,221 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:53:18,221 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:13 [2020-11-30 00:53:18,257 INFO L384 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 [2020-11-30 00:53:18,257 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:18,270 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:18,271 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:53:18,271 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-11-30 00:53:18,334 INFO L384 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 [2020-11-30 00:53:18,335 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:18,352 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:18,356 INFO L545 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. [2020-11-30 00:53:18,356 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-11-30 00:53:18,466 INFO L384 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 [2020-11-30 00:53:18,468 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:18,510 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:18,524 INFO L545 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. [2020-11-30 00:53:18,525 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2020-11-30 00:53:18,658 INFO L384 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 [2020-11-30 00:53:18,661 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:18,672 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:18,675 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:53:18,675 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2020-11-30 00:53:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:53:18,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:53:18,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2020-11-30 00:53:18,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697466970] [2020-11-30 00:53:18,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-30 00:53:18,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:53:18,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-30 00:53:18,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2020-11-30 00:53:18,683 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 15 states. [2020-11-30 00:53:23,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:53:23,241 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-11-30 00:53:23,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 00:53:23,241 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2020-11-30 00:53:23,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:53:23,242 INFO L225 Difference]: With dead ends: 36 [2020-11-30 00:53:23,242 INFO L226 Difference]: Without dead ends: 36 [2020-11-30 00:53:23,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2020-11-30 00:53:23,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-11-30 00:53:23,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2020-11-30 00:53:23,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-11-30 00:53:23,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-11-30 00:53:23,246 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2020-11-30 00:53:23,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:53:23,246 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-11-30 00:53:23,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-30 00:53:23,247 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-11-30 00:53:23,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-30 00:53:23,247 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:53:23,248 INFO L422 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] [2020-11-30 00:53:23,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:53:23,448 INFO L429 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]=== [2020-11-30 00:53:23,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:53:23,449 INFO L82 PathProgramCache]: Analyzing trace with hash -230868331, now seen corresponding path program 1 times [2020-11-30 00:53:23,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:53:23,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861727211] [2020-11-30 00:53:23,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:53:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:23,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:53:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:23,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:53:23,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861727211] [2020-11-30 00:53:23,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580548044] [2020-11-30 00:53:23,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2d5aae62-0195-4996-b15e-1f7f7804f66c/bin/uautomizer/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 [2020-11-30 00:53:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:23,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 20 conjunts are in the unsatisfiable core [2020-11-30 00:53:23,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:53:23,928 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:23,929 INFO L384 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 23 treesize of output 27 [2020-11-30 00:53:23,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:23,938 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:23,948 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:23,948 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:53:23,948 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2020-11-30 00:53:23,983 INFO L384 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 [2020-11-30 00:53:23,984 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:23,996 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:23,997 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:53:23,997 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-11-30 00:53:24,048 INFO L384 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 [2020-11-30 00:53:24,049 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:24,064 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:24,067 INFO L545 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. [2020-11-30 00:53:24,067 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-11-30 00:53:24,193 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:24,193 INFO L384 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 2 case distinctions, treesize of input 26 treesize of output 76 [2020-11-30 00:53:24,195 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:24,263 INFO L625 ElimStorePlain]: treesize reduction 48, result has 41.5 percent of original size [2020-11-30 00:53:24,266 INFO L545 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. [2020-11-30 00:53:24,266 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2020-11-30 00:53:24,388 INFO L384 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 [2020-11-30 00:53:24,389 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:24,407 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:24,413 INFO L545 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. [2020-11-30 00:53:24,421 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2020-11-30 00:53:26,532 INFO L384 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 [2020-11-30 00:53:26,536 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:26,544 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:26,548 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:53:26,548 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2020-11-30 00:53:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:53:26,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:53:26,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 17 [2020-11-30 00:53:26,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005752968] [2020-11-30 00:53:26,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:53:26,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:53:26,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:53:26,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=227, Unknown=1, NotChecked=0, Total=272 [2020-11-30 00:53:26,590 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 7 states. [2020-11-30 00:53:37,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:53:37,031 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2020-11-30 00:53:37,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:53:37,032 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-11-30 00:53:37,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:53:37,033 INFO L225 Difference]: With dead ends: 53 [2020-11-30 00:53:37,033 INFO L226 Difference]: Without dead ends: 53 [2020-11-30 00:53:37,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=71, Invalid=348, Unknown=1, NotChecked=0, Total=420 [2020-11-30 00:53:37,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-30 00:53:37,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2020-11-30 00:53:37,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-30 00:53:37,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2020-11-30 00:53:37,038 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 25 [2020-11-30 00:53:37,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:53:37,038 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2020-11-30 00:53:37,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:53:37,039 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2020-11-30 00:53:37,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-30 00:53:37,040 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:53:37,040 INFO L422 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] [2020-11-30 00:53:37,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-11-30 00:53:37,241 INFO L429 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]=== [2020-11-30 00:53:37,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:53:37,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1236238112, now seen corresponding path program 1 times [2020-11-30 00:53:37,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:53:37,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694692712] [2020-11-30 00:53:37,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:53:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:38,122 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-11-30 00:53:38,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:53:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:53:38,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694692712] [2020-11-30 00:53:38,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463194745] [2020-11-30 00:53:38,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2d5aae62-0195-4996-b15e-1f7f7804f66c/bin/uautomizer/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 [2020-11-30 00:53:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:38,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 00:53:38,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:53:38,313 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-11-30 00:53:38,314 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:38,316 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:38,317 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:53:38,317 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2020-11-30 00:53:38,349 INFO L384 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 [2020-11-30 00:53:38,350 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:38,362 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:38,363 INFO L545 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. [2020-11-30 00:53:38,363 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2020-11-30 00:53:38,449 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:38,449 INFO L384 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 42 [2020-11-30 00:53:38,450 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:38,477 INFO L625 ElimStorePlain]: treesize reduction 24, result has 44.2 percent of original size [2020-11-30 00:53:38,477 INFO L545 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. [2020-11-30 00:53:38,478 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-11-30 00:53:38,536 INFO L384 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 [2020-11-30 00:53:38,537 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:38,547 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:38,549 INFO L545 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. [2020-11-30 00:53:38,549 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-11-30 00:53:38,622 INFO L384 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 [2020-11-30 00:53:38,623 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:38,630 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:38,631 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:53:38,631 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-11-30 00:53:38,657 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:53:38,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:53:38,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 7] total 21 [2020-11-30 00:53:38,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909088177] [2020-11-30 00:53:38,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-30 00:53:38,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:53:38,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-30 00:53:38,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2020-11-30 00:53:38,660 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 21 states. [2020-11-30 00:53:39,567 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-11-30 00:53:39,958 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2020-11-30 00:53:40,101 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 25 [2020-11-30 00:53:41,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:53:41,058 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2020-11-30 00:53:41,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-11-30 00:53:41,059 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2020-11-30 00:53:41,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:53:41,060 INFO L225 Difference]: With dead ends: 93 [2020-11-30 00:53:41,060 INFO L226 Difference]: Without dead ends: 93 [2020-11-30 00:53:41,061 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=546, Invalid=1806, Unknown=0, NotChecked=0, Total=2352 [2020-11-30 00:53:41,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-11-30 00:53:41,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2020-11-30 00:53:41,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-30 00:53:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2020-11-30 00:53:41,067 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 33 [2020-11-30 00:53:41,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:53:41,067 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2020-11-30 00:53:41,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-30 00:53:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2020-11-30 00:53:41,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-30 00:53:41,069 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:53:41,069 INFO L422 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] [2020-11-30 00:53:41,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:53:41,279 INFO L429 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]=== [2020-11-30 00:53:41,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:53:41,279 INFO L82 PathProgramCache]: Analyzing trace with hash 210942700, now seen corresponding path program 1 times [2020-11-30 00:53:41,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:53:41,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6479744] [2020-11-30 00:53:41,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:53:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:41,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:53:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-30 00:53:41,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6479744] [2020-11-30 00:53:41,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878939489] [2020-11-30 00:53:41,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2d5aae62-0195-4996-b15e-1f7f7804f66c/bin/uautomizer/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 [2020-11-30 00:53:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:53:41,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 24 conjunts are in the unsatisfiable core [2020-11-30 00:53:41,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:53:41,705 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:41,706 INFO L384 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 31 treesize of output 35 [2020-11-30 00:53:41,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:41,719 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:41,732 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:41,733 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:53:41,733 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:21 [2020-11-30 00:53:41,780 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2020-11-30 00:53:41,780 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:41,798 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:41,799 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:53:41,799 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2020-11-30 00:53:41,852 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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 [2020-11-30 00:53:41,853 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:41,882 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:41,884 INFO L545 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. [2020-11-30 00:53:41,884 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2020-11-30 00:53:41,964 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 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 [2020-11-30 00:53:41,965 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:42,006 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:42,008 INFO L545 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. [2020-11-30 00:53:42,008 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:42 [2020-11-30 00:53:42,089 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2020-11-30 00:53:42,091 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:42,119 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:42,120 INFO L545 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. [2020-11-30 00:53:42,121 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:42 [2020-11-30 00:53:42,208 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:42,208 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 62 [2020-11-30 00:53:42,209 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:42,281 INFO L625 ElimStorePlain]: treesize reduction 16, result has 78.1 percent of original size [2020-11-30 00:53:42,282 INFO L545 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. [2020-11-30 00:53:42,283 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:57 [2020-11-30 00:53:42,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 00:53:42,616 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:42,617 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 77 [2020-11-30 00:53:42,618 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:42,637 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2020-11-30 00:53:42,638 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:42,764 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2020-11-30 00:53:42,765 INFO L625 ElimStorePlain]: treesize reduction 82, result has 37.4 percent of original size [2020-11-30 00:53:42,767 INFO L545 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. [2020-11-30 00:53:42,767 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:120, output treesize:49 [2020-11-30 00:53:42,919 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:42,919 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 77 [2020-11-30 00:53:42,920 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:42,997 INFO L625 ElimStorePlain]: treesize reduction 16, result has 78.1 percent of original size [2020-11-30 00:53:43,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,004 INFO L545 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. [2020-11-30 00:53:43,004 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:57 [2020-11-30 00:53:43,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:53:43,452 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:43,452 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 77 [2020-11-30 00:53:43,453 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:43,467 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2020-11-30 00:53:43,469 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:43,520 INFO L625 ElimStorePlain]: treesize reduction 83, result has 29.1 percent of original size [2020-11-30 00:53:43,523 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 00:53:43,524 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:106, output treesize:34 [2020-11-30 00:53:43,586 INFO L384 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 [2020-11-30 00:53:43,588 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:53:43,597 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:53:43,598 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:53:43,598 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2020-11-30 00:53:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:53:43,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:53:43,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2020-11-30 00:53:43,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156307297] [2020-11-30 00:53:43,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-30 00:53:43,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:53:43,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-30 00:53:43,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2020-11-30 00:53:43,624 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 20 states. [2020-11-30 00:54:19,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:54:19,453 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2020-11-30 00:54:19,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-30 00:54:19,454 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2020-11-30 00:54:19,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:54:19,455 INFO L225 Difference]: With dead ends: 112 [2020-11-30 00:54:19,455 INFO L226 Difference]: Without dead ends: 112 [2020-11-30 00:54:19,456 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 32 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=240, Invalid=630, Unknown=0, NotChecked=0, Total=870 [2020-11-30 00:54:19,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-30 00:54:19,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2020-11-30 00:54:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-11-30 00:54:19,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2020-11-30 00:54:19,463 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 44 [2020-11-30 00:54:19,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:54:19,464 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2020-11-30 00:54:19,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-30 00:54:19,464 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2020-11-30 00:54:19,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-30 00:54:19,481 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:54:19,481 INFO L422 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] [2020-11-30 00:54:19,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-11-30 00:54:19,703 INFO L429 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]=== [2020-11-30 00:54:19,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:54:19,703 INFO L82 PathProgramCache]: Analyzing trace with hash -2053442217, now seen corresponding path program 1 times [2020-11-30 00:54:19,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:54:19,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060028915] [2020-11-30 00:54:19,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:54:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:54:20,421 WARN L193 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2020-11-30 00:54:20,615 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2020-11-30 00:54:21,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 00:54:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:54:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 67 proven. 73 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-30 00:54:21,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060028915] [2020-11-30 00:54:21,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357126572] [2020-11-30 00:54:21,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2d5aae62-0195-4996-b15e-1f7f7804f66c/bin/uautomizer/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 [2020-11-30 00:54:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:54:21,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-30 00:54:21,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:54:21,703 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2020-11-30 00:54:21,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:54:21,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2020-11-30 00:54:21,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680470067] [2020-11-30 00:54:21,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:54:21,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:54:21,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:54:21,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2020-11-30 00:54:21,706 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 6 states. [2020-11-30 00:54:21,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:54:21,912 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2020-11-30 00:54:21,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:54:21,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2020-11-30 00:54:21,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:54:21,914 INFO L225 Difference]: With dead ends: 93 [2020-11-30 00:54:21,914 INFO L226 Difference]: Without dead ends: 0 [2020-11-30 00:54:21,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2020-11-30 00:54:21,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-30 00:54:21,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-30 00:54:21,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-30 00:54:21,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-30 00:54:21,916 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2020-11-30 00:54:21,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:54:21,916 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 00:54:21,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:54:21,916 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-30 00:54:21,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-30 00:54:22,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:54:22,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 12:54:22 BoogieIcfgContainer [2020-11-30 00:54:22,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 00:54:22,123 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:54:22,123 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:54:22,123 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:54:22,124 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:53:13" (3/4) ... [2020-11-30 00:54:22,128 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-30 00:54:22,133 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2020-11-30 00:54:22,134 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2020-11-30 00:54:22,140 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2020-11-30 00:54:22,140 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-11-30 00:54:22,140 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-11-30 00:54:22,140 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-11-30 00:54:22,180 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2d5aae62-0195-4996-b15e-1f7f7804f66c/bin/uautomizer/witness.graphml [2020-11-30 00:54:22,180 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:54:22,182 INFO L168 Benchmark]: Toolchain (without parser) took 69574.83 ms. Allocated memory was 102.8 MB in the beginning and 123.7 MB in the end (delta: 21.0 MB). Free memory was 83.6 MB in the beginning and 42.3 MB in the end (delta: 41.3 MB). Peak memory consumption was 61.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:54:22,183 INFO L168 Benchmark]: CDTParser took 0.82 ms. Allocated memory is still 81.8 MB. Free memory is still 58.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:54:22,183 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.12 ms. Allocated memory is still 102.8 MB. Free memory was 83.3 MB in the beginning and 74.2 MB in the end (delta: 9.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:54:22,184 INFO L168 Benchmark]: Boogie Preprocessor took 58.17 ms. Allocated memory is still 102.8 MB. Free memory was 74.2 MB in the beginning and 72.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:54:22,184 INFO L168 Benchmark]: RCFGBuilder took 715.44 ms. Allocated memory is still 102.8 MB. Free memory was 72.9 MB in the beginning and 53.0 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-30 00:54:22,185 INFO L168 Benchmark]: TraceAbstraction took 68386.26 ms. Allocated memory was 102.8 MB in the beginning and 123.7 MB in the end (delta: 21.0 MB). Free memory was 52.5 MB in the beginning and 46.2 MB in the end (delta: 6.3 MB). Peak memory consumption was 30.0 MB. Max. memory is 16.1 GB. [2020-11-30 00:54:22,185 INFO L168 Benchmark]: Witness Printer took 57.79 ms. Allocated memory is still 123.7 MB. Free memory was 46.2 MB in the beginning and 42.3 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 00:54:22,188 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.82 ms. Allocated memory is still 81.8 MB. Free memory is still 58.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 342.12 ms. Allocated memory is still 102.8 MB. Free memory was 83.3 MB in the beginning and 74.2 MB in the end (delta: 9.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 58.17 ms. Allocated memory is still 102.8 MB. Free memory was 74.2 MB in the beginning and 72.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 715.44 ms. Allocated memory is still 102.8 MB. Free memory was 72.9 MB in the beginning and 53.0 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 68386.26 ms. Allocated memory was 102.8 MB in the beginning and 123.7 MB in the end (delta: 21.0 MB). Free memory was 52.5 MB in the beginning and 46.2 MB in the end (delta: 6.3 MB). Peak memory consumption was 30.0 MB. Max. memory is 16.1 GB. * Witness Printer took 57.79 ms. Allocated memory is still 123.7 MB. Free memory was 46.2 MB in the beginning and 42.3 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 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. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 68.3s, OverallIterations: 15, TraceHistogramMax: 9, AutomataDifference: 55.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 262 SDtfs, 673 SDslu, 569 SDs, 0 SdLazy, 1703 SolverSat, 337 SolverUnsat, 27 SolverUnknown, 0 SolverNotchecked, 51.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 388 GetRequests, 218 SyntacticMatches, 11 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=14, 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, 15 MinimizatonAttempts, 86 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 514 NumberOfCodeBlocks, 514 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 493 ConstructedInterpolants, 48 QuantifiedInterpolants, 683003 SizeOfPredicates, 70 NumberOfNonLiveVariables, 1151 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 21 InterpolantComputations, 11 PerfectInterpolantSequences, 304/418 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...