./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa --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 32bit --witnessprinter.graph.data.programhash 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 17:17:53,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 17:17:53,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 17:17:53,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 17:17:54,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 17:17:54,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 17:17:54,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 17:17:54,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 17:17:54,007 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 17:17:54,008 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 17:17:54,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 17:17:54,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 17:17:54,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 17:17:54,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 17:17:54,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 17:17:54,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 17:17:54,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 17:17:54,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 17:17:54,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 17:17:54,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 17:17:54,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 17:17:54,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 17:17:54,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 17:17:54,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 17:17:54,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 17:17:54,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 17:17:54,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 17:17:54,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 17:17:54,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 17:17:54,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 17:17:54,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 17:17:54,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 17:17:54,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 17:17:54,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 17:17:54,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 17:17:54,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 17:17:54,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 17:17:54,039 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 17:17:54,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 17:17:54,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 17:17:54,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 17:17:54,041 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-06 17:17:54,064 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 17:17:54,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 17:17:54,065 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 17:17:54,065 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 17:17:54,065 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 17:17:54,066 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 17:17:54,066 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 17:17:54,066 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 17:17:54,066 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 17:17:54,066 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 17:17:54,067 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 17:17:54,067 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-06 17:17:54,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 17:17:54,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 17:17:54,067 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 17:17:54,067 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-06 17:17:54,067 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-06 17:17:54,068 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-06 17:17:54,068 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 17:17:54,068 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-06 17:17:54,068 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 17:17:54,068 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 17:17:54,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 17:17:54,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 17:17:54,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 17:17:54,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:17:54,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 17:17:54,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 17:17:54,069 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 17:17:54,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 17:17:54,069 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 17:17:54,069 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_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/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_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e [2021-12-06 17:17:54,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 17:17:54,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 17:17:54,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 17:17:54,275 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 17:17:54,276 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 17:17:54,277 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2021-12-06 17:17:54,328 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/data/4740a7240/09f1b7ffd33b438a800fd725ffebe9cc/FLAG1a602b7e2 [2021-12-06 17:17:54,737 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 17:17:54,737 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2021-12-06 17:17:54,746 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/data/4740a7240/09f1b7ffd33b438a800fd725ffebe9cc/FLAG1a602b7e2 [2021-12-06 17:17:54,755 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/data/4740a7240/09f1b7ffd33b438a800fd725ffebe9cc [2021-12-06 17:17:54,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 17:17:54,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 17:17:54,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 17:17:54,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 17:17:54,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 17:17:54,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:17:54" (1/1) ... [2021-12-06 17:17:54,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13632ea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:54, skipping insertion in model container [2021-12-06 17:17:54,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:17:54" (1/1) ... [2021-12-06 17:17:54,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 17:17:54,804 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 17:17:55,003 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:17:55,009 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 17:17:55,041 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:17:55,064 INFO L208 MainTranslator]: Completed translation [2021-12-06 17:17:55,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:55 WrapperNode [2021-12-06 17:17:55,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 17:17:55,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 17:17:55,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 17:17:55,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 17:17:55,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:55" (1/1) ... [2021-12-06 17:17:55,088 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:55" (1/1) ... [2021-12-06 17:17:55,106 INFO L137 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2021-12-06 17:17:55,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 17:17:55,107 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 17:17:55,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 17:17:55,108 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 17:17:55,114 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:55" (1/1) ... [2021-12-06 17:17:55,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:55" (1/1) ... [2021-12-06 17:17:55,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:55" (1/1) ... [2021-12-06 17:17:55,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:55" (1/1) ... [2021-12-06 17:17:55,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:55" (1/1) ... [2021-12-06 17:17:55,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:55" (1/1) ... [2021-12-06 17:17:55,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:55" (1/1) ... [2021-12-06 17:17:55,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 17:17:55,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 17:17:55,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 17:17:55,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 17:17:55,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:55" (1/1) ... [2021-12-06 17:17:55,140 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:17:55,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:17:55,159 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 17:17:55,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 17:17:55,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 17:17:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 17:17:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-06 17:17:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-06 17:17:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 17:17:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 17:17:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 17:17:55,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 17:17:55,276 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 17:17:55,277 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 17:17:55,528 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 17:17:55,534 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 17:17:55,534 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-06 17:17:55,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:17:55 BoogieIcfgContainer [2021-12-06 17:17:55,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 17:17:55,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 17:17:55,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 17:17:55,539 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 17:17:55,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:17:54" (1/3) ... [2021-12-06 17:17:55,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ca4592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:17:55, skipping insertion in model container [2021-12-06 17:17:55,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:55" (2/3) ... [2021-12-06 17:17:55,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ca4592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:17:55, skipping insertion in model container [2021-12-06 17:17:55,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:17:55" (3/3) ... [2021-12-06 17:17:55,541 INFO L111 eAbstractionObserver]: Analyzing ICFG skiplist_2lvl.i [2021-12-06 17:17:55,546 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 17:17:55,546 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2021-12-06 17:17:55,580 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 17:17:55,585 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 17:17:55,586 INFO L340 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2021-12-06 17:17:55,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 67 states have (on average 2.1343283582089554) internal successors, (143), 132 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-06 17:17:55,606 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:17:55,606 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-06 17:17:55,607 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:17:55,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:17:55,611 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-06 17:17:55,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:17:55,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672298477] [2021-12-06 17:17:55,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:17:55,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:17:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:17:55,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:17:55,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:17:55,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672298477] [2021-12-06 17:17:55,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672298477] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:17:55,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:17:55,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 17:17:55,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857495008] [2021-12-06 17:17:55,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:17:55,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:17:55,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:17:55,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:17:55,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:17:55,781 INFO L87 Difference]: Start difference. First operand has 133 states, 67 states have (on average 2.1343283582089554) internal successors, (143), 132 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:55,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:17:55,885 INFO L93 Difference]: Finished difference Result 156 states and 163 transitions. [2021-12-06 17:17:55,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:17:55,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-06 17:17:55,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:17:55,894 INFO L225 Difference]: With dead ends: 156 [2021-12-06 17:17:55,895 INFO L226 Difference]: Without dead ends: 154 [2021-12-06 17:17:55,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:17:55,899 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 122 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:17:55,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 86 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:17:55,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-06 17:17:55,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 124. [2021-12-06 17:17:55,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 66 states have (on average 1.9696969696969697) internal successors, (130), 123 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:55,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2021-12-06 17:17:55,930 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 3 [2021-12-06 17:17:55,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:17:55,930 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2021-12-06 17:17:55,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:55,930 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2021-12-06 17:17:55,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-06 17:17:55,930 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:17:55,930 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-06 17:17:55,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 17:17:55,931 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:17:55,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:17:55,931 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-06 17:17:55,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:17:55,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155469276] [2021-12-06 17:17:55,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:17:55,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:17:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:17:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:17:55,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:17:55,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155469276] [2021-12-06 17:17:55,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155469276] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:17:55,967 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:17:55,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 17:17:55,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079604442] [2021-12-06 17:17:55,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:17:55,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:17:55,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:17:55,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:17:55,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:17:55,969 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:56,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:17:56,033 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2021-12-06 17:17:56,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:17:56,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-06 17:17:56,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:17:56,034 INFO L225 Difference]: With dead ends: 117 [2021-12-06 17:17:56,034 INFO L226 Difference]: Without dead ends: 117 [2021-12-06 17:17:56,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:17:56,036 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:17:56,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 69 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:17:56,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-06 17:17:56,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-12-06 17:17:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 66 states have (on average 1.8636363636363635) internal successors, (123), 116 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:56,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2021-12-06 17:17:56,043 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 3 [2021-12-06 17:17:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:17:56,044 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2021-12-06 17:17:56,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:56,044 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2021-12-06 17:17:56,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-06 17:17:56,044 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:17:56,044 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:17:56,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 17:17:56,045 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:17:56,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:17:56,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1056606480, now seen corresponding path program 1 times [2021-12-06 17:17:56,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:17:56,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614438644] [2021-12-06 17:17:56,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:17:56,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:17:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:17:56,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:17:56,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:17:56,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614438644] [2021-12-06 17:17:56,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614438644] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:17:56,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:17:56,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:17:56,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93399731] [2021-12-06 17:17:56,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:17:56,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:17:56,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:17:56,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:17:56,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:17:56,110 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:56,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:17:56,211 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2021-12-06 17:17:56,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:17:56,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-06 17:17:56,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:17:56,212 INFO L225 Difference]: With dead ends: 116 [2021-12-06 17:17:56,212 INFO L226 Difference]: Without dead ends: 116 [2021-12-06 17:17:56,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:17:56,213 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 8 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:17:56,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 294 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:17:56,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-06 17:17:56,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-12-06 17:17:56,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 115 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2021-12-06 17:17:56,220 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 10 [2021-12-06 17:17:56,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:17:56,220 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2021-12-06 17:17:56,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:56,221 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2021-12-06 17:17:56,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-06 17:17:56,221 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:17:56,221 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:17:56,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 17:17:56,221 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:17:56,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:17:56,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1056606481, now seen corresponding path program 1 times [2021-12-06 17:17:56,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:17:56,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296225790] [2021-12-06 17:17:56,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:17:56,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:17:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:17:56,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:17:56,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:17:56,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296225790] [2021-12-06 17:17:56,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296225790] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:17:56,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:17:56,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:17:56,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846678070] [2021-12-06 17:17:56,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:17:56,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:17:56,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:17:56,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:17:56,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:17:56,323 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:56,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:17:56,452 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2021-12-06 17:17:56,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:17:56,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-06 17:17:56,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:17:56,453 INFO L225 Difference]: With dead ends: 115 [2021-12-06 17:17:56,453 INFO L226 Difference]: Without dead ends: 115 [2021-12-06 17:17:56,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:17:56,455 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 10 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:17:56,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 283 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:17:56,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-06 17:17:56,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-12-06 17:17:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 66 states have (on average 1.8333333333333333) internal successors, (121), 114 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2021-12-06 17:17:56,461 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 10 [2021-12-06 17:17:56,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:17:56,461 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2021-12-06 17:17:56,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:56,461 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2021-12-06 17:17:56,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-06 17:17:56,461 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:17:56,462 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:17:56,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 17:17:56,462 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:17:56,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:17:56,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937495, now seen corresponding path program 1 times [2021-12-06 17:17:56,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:17:56,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977565808] [2021-12-06 17:17:56,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:17:56,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:17:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:17:56,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:17:56,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:17:56,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977565808] [2021-12-06 17:17:56,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977565808] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:17:56,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:17:56,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:17:56,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993221506] [2021-12-06 17:17:56,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:17:56,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:17:56,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:17:56,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:17:56,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:17:56,504 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:56,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:17:56,568 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2021-12-06 17:17:56,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 17:17:56,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-06 17:17:56,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:17:56,569 INFO L225 Difference]: With dead ends: 114 [2021-12-06 17:17:56,569 INFO L226 Difference]: Without dead ends: 114 [2021-12-06 17:17:56,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:17:56,571 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 6 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:17:56,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 374 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:17:56,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-06 17:17:56,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-12-06 17:17:56,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 66 states have (on average 1.8181818181818181) internal successors, (120), 113 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:56,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2021-12-06 17:17:56,576 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 11 [2021-12-06 17:17:56,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:17:56,576 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2021-12-06 17:17:56,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:56,577 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2021-12-06 17:17:56,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-06 17:17:56,577 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:17:56,577 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:17:56,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 17:17:56,577 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:17:56,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:17:56,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937494, now seen corresponding path program 1 times [2021-12-06 17:17:56,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:17:56,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656362303] [2021-12-06 17:17:56,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:17:56,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:17:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:17:56,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:17:56,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:17:56,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656362303] [2021-12-06 17:17:56,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656362303] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:17:56,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:17:56,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:17:56,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826325883] [2021-12-06 17:17:56,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:17:56,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:17:56,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:17:56,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:17:56,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:17:56,687 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:56,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:17:56,855 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2021-12-06 17:17:56,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 17:17:56,856 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-06 17:17:56,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:17:56,857 INFO L225 Difference]: With dead ends: 113 [2021-12-06 17:17:56,857 INFO L226 Difference]: Without dead ends: 113 [2021-12-06 17:17:56,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-06 17:17:56,858 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 11 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:17:56,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 410 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:17:56,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-06 17:17:56,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-12-06 17:17:56,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.803030303030303) internal successors, (119), 112 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:56,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2021-12-06 17:17:56,863 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 11 [2021-12-06 17:17:56,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:17:56,863 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2021-12-06 17:17:56,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:56,864 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2021-12-06 17:17:56,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-06 17:17:56,864 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:17:56,864 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:17:56,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 17:17:56,864 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:17:56,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:17:56,865 INFO L85 PathProgramCache]: Analyzing trace with hash -266592339, now seen corresponding path program 1 times [2021-12-06 17:17:56,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:17:56,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99483533] [2021-12-06 17:17:56,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:17:56,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:17:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:17:56,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:17:56,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:17:56,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99483533] [2021-12-06 17:17:56,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99483533] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:17:56,980 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:17:56,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 17:17:56,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707642790] [2021-12-06 17:17:56,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:17:56,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 17:17:56,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:17:56,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 17:17:56,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-06 17:17:56,981 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:57,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:17:57,122 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2021-12-06 17:17:57,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 17:17:57,123 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-06 17:17:57,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:17:57,123 INFO L225 Difference]: With dead ends: 112 [2021-12-06 17:17:57,123 INFO L226 Difference]: Without dead ends: 112 [2021-12-06 17:17:57,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-12-06 17:17:57,124 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 24 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:17:57,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 578 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:17:57,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-06 17:17:57,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-12-06 17:17:57,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 66 states have (on average 1.7878787878787878) internal successors, (118), 111 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2021-12-06 17:17:57,129 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 15 [2021-12-06 17:17:57,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:17:57,129 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2021-12-06 17:17:57,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:57,129 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2021-12-06 17:17:57,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-06 17:17:57,130 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:17:57,130 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:17:57,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 17:17:57,130 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:17:57,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:17:57,130 INFO L85 PathProgramCache]: Analyzing trace with hash -266592338, now seen corresponding path program 1 times [2021-12-06 17:17:57,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:17:57,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306253420] [2021-12-06 17:17:57,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:17:57,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:17:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:17:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:17:57,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:17:57,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306253420] [2021-12-06 17:17:57,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306253420] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:17:57,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:17:57,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 17:17:57,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304983377] [2021-12-06 17:17:57,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:17:57,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 17:17:57,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:17:57,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 17:17:57,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-06 17:17:57,251 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:57,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:17:57,388 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2021-12-06 17:17:57,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 17:17:57,389 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-06 17:17:57,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:17:57,390 INFO L225 Difference]: With dead ends: 111 [2021-12-06 17:17:57,390 INFO L226 Difference]: Without dead ends: 111 [2021-12-06 17:17:57,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-12-06 17:17:57,391 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 20 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:17:57,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 479 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:17:57,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-06 17:17:57,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-12-06 17:17:57,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 66 states have (on average 1.7727272727272727) internal successors, (117), 110 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:57,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2021-12-06 17:17:57,397 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 15 [2021-12-06 17:17:57,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:17:57,397 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2021-12-06 17:17:57,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:57,397 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2021-12-06 17:17:57,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-06 17:17:57,398 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:17:57,398 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:17:57,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 17:17:57,398 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:17:57,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:17:57,399 INFO L85 PathProgramCache]: Analyzing trace with hash 325572089, now seen corresponding path program 1 times [2021-12-06 17:17:57,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:17:57,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567382626] [2021-12-06 17:17:57,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:17:57,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:17:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:17:57,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:17:57,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:17:57,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567382626] [2021-12-06 17:17:57,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567382626] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:17:57,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:17:57,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:17:57,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114449151] [2021-12-06 17:17:57,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:17:57,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:17:57,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:17:57,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:17:57,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:17:57,443 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:57,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:17:57,504 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2021-12-06 17:17:57,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 17:17:57,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-06 17:17:57,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:17:57,505 INFO L225 Difference]: With dead ends: 110 [2021-12-06 17:17:57,505 INFO L226 Difference]: Without dead ends: 110 [2021-12-06 17:17:57,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:17:57,506 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 5 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:17:57,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 363 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:17:57,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-06 17:17:57,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-12-06 17:17:57,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 66 states have (on average 1.7575757575757576) internal successors, (116), 109 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:57,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2021-12-06 17:17:57,511 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 16 [2021-12-06 17:17:57,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:17:57,511 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2021-12-06 17:17:57,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:57,511 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2021-12-06 17:17:57,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-06 17:17:57,512 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:17:57,512 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:17:57,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 17:17:57,512 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:17:57,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:17:57,513 INFO L85 PathProgramCache]: Analyzing trace with hash 325572090, now seen corresponding path program 1 times [2021-12-06 17:17:57,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:17:57,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707217638] [2021-12-06 17:17:57,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:17:57,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:17:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:17:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:17:57,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:17:57,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707217638] [2021-12-06 17:17:57,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707217638] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:17:57,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:17:57,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 17:17:57,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186879124] [2021-12-06 17:17:57,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:17:57,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 17:17:57,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:17:57,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 17:17:57,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-06 17:17:57,656 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:57,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:17:57,779 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2021-12-06 17:17:57,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 17:17:57,779 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-06 17:17:57,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:17:57,780 INFO L225 Difference]: With dead ends: 109 [2021-12-06 17:17:57,780 INFO L226 Difference]: Without dead ends: 109 [2021-12-06 17:17:57,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-12-06 17:17:57,781 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 15 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:17:57,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 473 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:17:57,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-06 17:17:57,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-12-06 17:17:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 66 states have (on average 1.7424242424242424) internal successors, (115), 108 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2021-12-06 17:17:57,784 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 16 [2021-12-06 17:17:57,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:17:57,784 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2021-12-06 17:17:57,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:57,784 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2021-12-06 17:17:57,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-06 17:17:57,785 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:17:57,785 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:17:57,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 17:17:57,785 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:17:57,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:17:57,785 INFO L85 PathProgramCache]: Analyzing trace with hash 379588598, now seen corresponding path program 1 times [2021-12-06 17:17:57,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:17:57,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055081564] [2021-12-06 17:17:57,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:17:57,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:17:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:17:57,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:17:57,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:17:57,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055081564] [2021-12-06 17:17:57,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055081564] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:17:57,830 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:17:57,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:17:57,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724283137] [2021-12-06 17:17:57,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:17:57,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:17:57,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:17:57,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:17:57,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:17:57,831 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:57,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:17:57,964 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2021-12-06 17:17:57,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:17:57,965 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-06 17:17:57,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:17:57,966 INFO L225 Difference]: With dead ends: 170 [2021-12-06 17:17:57,966 INFO L226 Difference]: Without dead ends: 170 [2021-12-06 17:17:57,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:17:57,967 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 362 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:17:57,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [362 Valid, 155 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:17:57,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-06 17:17:57,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 107. [2021-12-06 17:17:57,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 66 states have (on average 1.7121212121212122) internal successors, (113), 106 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:57,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2021-12-06 17:17:57,970 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 21 [2021-12-06 17:17:57,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:17:57,971 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2021-12-06 17:17:57,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:57,971 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2021-12-06 17:17:57,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-06 17:17:57,971 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:17:57,972 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:17:57,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 17:17:57,972 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:17:57,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:17:57,972 INFO L85 PathProgramCache]: Analyzing trace with hash 379588599, now seen corresponding path program 1 times [2021-12-06 17:17:57,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:17:57,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57864977] [2021-12-06 17:17:57,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:17:57,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:17:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:17:58,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:17:58,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:17:58,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57864977] [2021-12-06 17:17:58,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57864977] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:17:58,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:17:58,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:17:58,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406038735] [2021-12-06 17:17:58,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:17:58,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:17:58,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:17:58,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:17:58,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:17:58,043 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:58,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:17:58,170 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2021-12-06 17:17:58,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:17:58,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-06 17:17:58,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:17:58,171 INFO L225 Difference]: With dead ends: 141 [2021-12-06 17:17:58,171 INFO L226 Difference]: Without dead ends: 141 [2021-12-06 17:17:58,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:17:58,172 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 382 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:17:58,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 117 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:17:58,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-06 17:17:58,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 105. [2021-12-06 17:17:58,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 66 states have (on average 1.6818181818181819) internal successors, (111), 104 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2021-12-06 17:17:58,176 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 21 [2021-12-06 17:17:58,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:17:58,177 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2021-12-06 17:17:58,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2021-12-06 17:17:58,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-06 17:17:58,178 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:17:58,178 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:17:58,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 17:17:58,178 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:17:58,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:17:58,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1117654205, now seen corresponding path program 1 times [2021-12-06 17:17:58,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:17:58,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902405217] [2021-12-06 17:17:58,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:17:58,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:17:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:17:58,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:17:58,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:17:58,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902405217] [2021-12-06 17:17:58,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902405217] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:17:58,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:17:58,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:17:58,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993685978] [2021-12-06 17:17:58,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:17:58,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:17:58,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:17:58,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:17:58,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:17:58,216 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:58,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:17:58,317 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2021-12-06 17:17:58,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:17:58,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-06 17:17:58,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:17:58,318 INFO L225 Difference]: With dead ends: 126 [2021-12-06 17:17:58,318 INFO L226 Difference]: Without dead ends: 126 [2021-12-06 17:17:58,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:17:58,319 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 297 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:17:58,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 130 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:17:58,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-06 17:17:58,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 102. [2021-12-06 17:17:58,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 67 states have (on average 1.626865671641791) internal successors, (109), 101 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:58,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2021-12-06 17:17:58,322 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 22 [2021-12-06 17:17:58,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:17:58,322 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2021-12-06 17:17:58,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:58,322 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2021-12-06 17:17:58,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-06 17:17:58,323 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:17:58,323 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:17:58,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 17:17:58,323 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:17:58,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:17:58,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1117654204, now seen corresponding path program 1 times [2021-12-06 17:17:58,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:17:58,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570721400] [2021-12-06 17:17:58,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:17:58,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:17:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:17:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:17:58,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:17:58,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570721400] [2021-12-06 17:17:58,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570721400] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:17:58,378 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:17:58,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:17:58,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064777042] [2021-12-06 17:17:58,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:17:58,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:17:58,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:17:58,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:17:58,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:17:58,380 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:58,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:17:58,486 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2021-12-06 17:17:58,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:17:58,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-06 17:17:58,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:17:58,487 INFO L225 Difference]: With dead ends: 97 [2021-12-06 17:17:58,487 INFO L226 Difference]: Without dead ends: 97 [2021-12-06 17:17:58,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:17:58,488 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 372 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:17:58,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 90 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:17:58,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-06 17:17:58,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-12-06 17:17:58,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 67 states have (on average 1.537313432835821) internal successors, (103), 96 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:58,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2021-12-06 17:17:58,491 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 22 [2021-12-06 17:17:58,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:17:58,492 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2021-12-06 17:17:58,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:58,492 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2021-12-06 17:17:58,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-06 17:17:58,493 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:17:58,493 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:17:58,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 17:17:58,493 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:17:58,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:17:58,493 INFO L85 PathProgramCache]: Analyzing trace with hash -287576677, now seen corresponding path program 1 times [2021-12-06 17:17:58,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:17:58,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655080865] [2021-12-06 17:17:58,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:17:58,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:17:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:17:58,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:17:58,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:17:58,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655080865] [2021-12-06 17:17:58,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655080865] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:17:58,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:17:58,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-06 17:17:58,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029483043] [2021-12-06 17:17:58,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:17:58,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-06 17:17:58,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:17:58,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-06 17:17:58,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-12-06 17:17:58,694 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:59,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:17:59,142 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2021-12-06 17:17:59,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-06 17:17:59,143 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-06 17:17:59,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:17:59,144 INFO L225 Difference]: With dead ends: 165 [2021-12-06 17:17:59,144 INFO L226 Difference]: Without dead ends: 165 [2021-12-06 17:17:59,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=876, Unknown=0, NotChecked=0, Total=1056 [2021-12-06 17:17:59,145 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 413 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:17:59,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 774 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:17:59,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-12-06 17:17:59,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 98. [2021-12-06 17:17:59,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.4722222222222223) internal successors, (106), 97 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:59,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2021-12-06 17:17:59,148 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 23 [2021-12-06 17:17:59,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:17:59,148 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2021-12-06 17:17:59,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:17:59,148 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2021-12-06 17:17:59,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-06 17:17:59,148 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:17:59,149 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:17:59,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 17:17:59,149 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:17:59,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:17:59,149 INFO L85 PathProgramCache]: Analyzing trace with hash -287576676, now seen corresponding path program 1 times [2021-12-06 17:17:59,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:17:59,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205301773] [2021-12-06 17:17:59,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:17:59,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:17:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:17:59,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:17:59,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:17:59,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205301773] [2021-12-06 17:17:59,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205301773] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:17:59,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:17:59,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-12-06 17:17:59,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005427975] [2021-12-06 17:17:59,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:17:59,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-06 17:17:59,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:17:59,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-06 17:17:59,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-12-06 17:17:59,411 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:00,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:00,018 INFO L93 Difference]: Finished difference Result 211 states and 228 transitions. [2021-12-06 17:18:00,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-06 17:18:00,018 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-06 17:18:00,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:00,019 INFO L225 Difference]: With dead ends: 211 [2021-12-06 17:18:00,019 INFO L226 Difference]: Without dead ends: 211 [2021-12-06 17:18:00,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=993, Unknown=0, NotChecked=0, Total=1190 [2021-12-06 17:18:00,020 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 628 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:00,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [628 Valid, 811 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:18:00,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-12-06 17:18:00,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 122. [2021-12-06 17:18:00,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.5208333333333333) internal successors, (146), 121 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:00,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 146 transitions. [2021-12-06 17:18:00,023 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 146 transitions. Word has length 23 [2021-12-06 17:18:00,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:00,023 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 146 transitions. [2021-12-06 17:18:00,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:00,024 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 146 transitions. [2021-12-06 17:18:00,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-06 17:18:00,024 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:00,024 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:00,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 17:18:00,024 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:00,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:00,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1449815588, now seen corresponding path program 1 times [2021-12-06 17:18:00,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:18:00,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447079381] [2021-12-06 17:18:00,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:00,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:18:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:00,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:18:00,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447079381] [2021-12-06 17:18:00,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447079381] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:00,061 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:00,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:18:00,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487352592] [2021-12-06 17:18:00,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:00,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:18:00,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:18:00,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:18:00,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:18:00,062 INFO L87 Difference]: Start difference. First operand 122 states and 146 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:00,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:00,103 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2021-12-06 17:18:00,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:18:00,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-06 17:18:00,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:00,104 INFO L225 Difference]: With dead ends: 121 [2021-12-06 17:18:00,104 INFO L226 Difference]: Without dead ends: 121 [2021-12-06 17:18:00,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:18:00,105 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 258 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:00,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 146 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:18:00,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-06 17:18:00,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-12-06 17:18:00,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 96 states have (on average 1.5104166666666667) internal successors, (145), 120 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:00,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 145 transitions. [2021-12-06 17:18:00,109 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 145 transitions. Word has length 25 [2021-12-06 17:18:00,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:00,109 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 145 transitions. [2021-12-06 17:18:00,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:00,109 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 145 transitions. [2021-12-06 17:18:00,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-06 17:18:00,109 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:00,109 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:00,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-06 17:18:00,110 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:00,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:00,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1702259996, now seen corresponding path program 1 times [2021-12-06 17:18:00,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:18:00,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883051176] [2021-12-06 17:18:00,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:00,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:18:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:00,259 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:18:00,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883051176] [2021-12-06 17:18:00,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883051176] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:00,259 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:00,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-06 17:18:00,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833226895] [2021-12-06 17:18:00,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:00,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-06 17:18:00,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:18:00,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-06 17:18:00,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-12-06 17:18:00,260 INFO L87 Difference]: Start difference. First operand 121 states and 145 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:00,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:00,628 INFO L93 Difference]: Finished difference Result 166 states and 194 transitions. [2021-12-06 17:18:00,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-06 17:18:00,629 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-06 17:18:00,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:00,629 INFO L225 Difference]: With dead ends: 166 [2021-12-06 17:18:00,629 INFO L226 Difference]: Without dead ends: 166 [2021-12-06 17:18:00,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=767, Unknown=0, NotChecked=0, Total=930 [2021-12-06 17:18:00,630 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 320 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:00,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 705 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:18:00,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-12-06 17:18:00,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 128. [2021-12-06 17:18:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 103 states have (on average 1.4951456310679612) internal successors, (154), 127 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:00,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 154 transitions. [2021-12-06 17:18:00,633 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 154 transitions. Word has length 27 [2021-12-06 17:18:00,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:00,633 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 154 transitions. [2021-12-06 17:18:00,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:00,634 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 154 transitions. [2021-12-06 17:18:00,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-06 17:18:00,634 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:00,634 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:00,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-06 17:18:00,634 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:00,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:00,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1702259995, now seen corresponding path program 1 times [2021-12-06 17:18:00,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:18:00,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586101687] [2021-12-06 17:18:00,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:00,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:18:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:00,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:18:00,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586101687] [2021-12-06 17:18:00,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586101687] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:00,878 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:00,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-06 17:18:00,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672055698] [2021-12-06 17:18:00,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:00,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-06 17:18:00,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:18:00,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-06 17:18:00,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-12-06 17:18:00,879 INFO L87 Difference]: Start difference. First operand 128 states and 154 transitions. Second operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:01,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:01,381 INFO L93 Difference]: Finished difference Result 166 states and 194 transitions. [2021-12-06 17:18:01,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-06 17:18:01,381 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-06 17:18:01,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:01,382 INFO L225 Difference]: With dead ends: 166 [2021-12-06 17:18:01,382 INFO L226 Difference]: Without dead ends: 166 [2021-12-06 17:18:01,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=877, Unknown=0, NotChecked=0, Total=1056 [2021-12-06 17:18:01,383 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 272 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:01,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 629 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:18:01,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-12-06 17:18:01,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 128. [2021-12-06 17:18:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 103 states have (on average 1.4854368932038835) internal successors, (153), 127 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:01,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 153 transitions. [2021-12-06 17:18:01,386 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 153 transitions. Word has length 27 [2021-12-06 17:18:01,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:01,386 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 153 transitions. [2021-12-06 17:18:01,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:01,386 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 153 transitions. [2021-12-06 17:18:01,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-06 17:18:01,387 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:01,387 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:01,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-06 17:18:01,387 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:01,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:01,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1264836991, now seen corresponding path program 1 times [2021-12-06 17:18:01,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:18:01,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966806723] [2021-12-06 17:18:01,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:01,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:18:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:01,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:18:01,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966806723] [2021-12-06 17:18:01,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966806723] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:01,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:01,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-12-06 17:18:01,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103349151] [2021-12-06 17:18:01,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:01,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-06 17:18:01,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:18:01,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-06 17:18:01,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-12-06 17:18:01,568 INFO L87 Difference]: Start difference. First operand 128 states and 153 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:01,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:01,876 INFO L93 Difference]: Finished difference Result 159 states and 187 transitions. [2021-12-06 17:18:01,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 17:18:01,876 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-06 17:18:01,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:01,877 INFO L225 Difference]: With dead ends: 159 [2021-12-06 17:18:01,877 INFO L226 Difference]: Without dead ends: 159 [2021-12-06 17:18:01,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2021-12-06 17:18:01,878 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 195 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:01,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 774 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:18:01,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-06 17:18:01,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 128. [2021-12-06 17:18:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 127 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:01,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 152 transitions. [2021-12-06 17:18:01,881 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 152 transitions. Word has length 28 [2021-12-06 17:18:01,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:01,881 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 152 transitions. [2021-12-06 17:18:01,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:01,881 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 152 transitions. [2021-12-06 17:18:01,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-06 17:18:01,881 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:01,881 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:01,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-06 17:18:01,882 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:01,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:01,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2059816375, now seen corresponding path program 1 times [2021-12-06 17:18:01,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:18:01,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098185380] [2021-12-06 17:18:01,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:01,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:18:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:01,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:01,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:18:01,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098185380] [2021-12-06 17:18:01,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098185380] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:01,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:01,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 17:18:01,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264556103] [2021-12-06 17:18:01,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:01,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 17:18:01,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:18:01,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 17:18:01,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 17:18:01,910 INFO L87 Difference]: Start difference. First operand 128 states and 152 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:01,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:01,976 INFO L93 Difference]: Finished difference Result 146 states and 169 transitions. [2021-12-06 17:18:01,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 17:18:01,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-06 17:18:01,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:01,977 INFO L225 Difference]: With dead ends: 146 [2021-12-06 17:18:01,977 INFO L226 Difference]: Without dead ends: 146 [2021-12-06 17:18:01,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:18:01,978 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 113 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:01,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 131 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:18:01,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-06 17:18:01,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 127. [2021-12-06 17:18:01,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 126 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:01,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 150 transitions. [2021-12-06 17:18:01,982 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 150 transitions. Word has length 29 [2021-12-06 17:18:01,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:01,982 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 150 transitions. [2021-12-06 17:18:01,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:01,983 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2021-12-06 17:18:01,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-06 17:18:01,983 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:01,983 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:01,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-06 17:18:01,983 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:01,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:01,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2059816374, now seen corresponding path program 1 times [2021-12-06 17:18:01,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:18:01,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114880193] [2021-12-06 17:18:01,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:01,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:18:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:02,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:18:02,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114880193] [2021-12-06 17:18:02,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114880193] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:02,245 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:02,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-12-06 17:18:02,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431001843] [2021-12-06 17:18:02,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:02,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-06 17:18:02,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:18:02,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-06 17:18:02,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2021-12-06 17:18:02,246 INFO L87 Difference]: Start difference. First operand 127 states and 150 transitions. Second operand has 21 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:02,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:02,795 INFO L93 Difference]: Finished difference Result 202 states and 223 transitions. [2021-12-06 17:18:02,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-06 17:18:02,796 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-06 17:18:02,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:02,797 INFO L225 Difference]: With dead ends: 202 [2021-12-06 17:18:02,797 INFO L226 Difference]: Without dead ends: 202 [2021-12-06 17:18:02,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2021-12-06 17:18:02,798 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 473 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:02,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [473 Valid, 1196 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:18:02,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-12-06 17:18:02,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 132. [2021-12-06 17:18:02,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 110 states have (on average 1.4181818181818182) internal successors, (156), 131 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:02,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 156 transitions. [2021-12-06 17:18:02,803 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 156 transitions. Word has length 29 [2021-12-06 17:18:02,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:02,803 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 156 transitions. [2021-12-06 17:18:02,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:02,803 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 156 transitions. [2021-12-06 17:18:02,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-06 17:18:02,803 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:02,804 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:02,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-06 17:18:02,804 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:02,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:02,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1348537848, now seen corresponding path program 1 times [2021-12-06 17:18:02,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:18:02,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515952626] [2021-12-06 17:18:02,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:02,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:18:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:02,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:18:02,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515952626] [2021-12-06 17:18:02,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515952626] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:02,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:02,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-12-06 17:18:03,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810200136] [2021-12-06 17:18:03,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:03,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-06 17:18:03,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:18:03,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-06 17:18:03,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2021-12-06 17:18:03,000 INFO L87 Difference]: Start difference. First operand 132 states and 156 transitions. Second operand has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:03,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:03,354 INFO L93 Difference]: Finished difference Result 173 states and 202 transitions. [2021-12-06 17:18:03,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 17:18:03,355 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-06 17:18:03,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:03,355 INFO L225 Difference]: With dead ends: 173 [2021-12-06 17:18:03,356 INFO L226 Difference]: Without dead ends: 173 [2021-12-06 17:18:03,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2021-12-06 17:18:03,356 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 246 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:03,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 747 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:18:03,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-12-06 17:18:03,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 135. [2021-12-06 17:18:03,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.407079646017699) internal successors, (159), 134 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:03,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 159 transitions. [2021-12-06 17:18:03,359 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 159 transitions. Word has length 30 [2021-12-06 17:18:03,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:03,359 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 159 transitions. [2021-12-06 17:18:03,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:03,360 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 159 transitions. [2021-12-06 17:18:03,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-06 17:18:03,360 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:03,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:03,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-06 17:18:03,360 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:03,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:03,360 INFO L85 PathProgramCache]: Analyzing trace with hash 570254421, now seen corresponding path program 1 times [2021-12-06 17:18:03,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:18:03,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240829902] [2021-12-06 17:18:03,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:03,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:18:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:03,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:03,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:18:03,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240829902] [2021-12-06 17:18:03,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240829902] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:03,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:03,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-12-06 17:18:03,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545622651] [2021-12-06 17:18:03,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:03,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-06 17:18:03,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:18:03,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-06 17:18:03,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2021-12-06 17:18:03,943 INFO L87 Difference]: Start difference. First operand 135 states and 159 transitions. Second operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:04,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:04,981 INFO L93 Difference]: Finished difference Result 140 states and 156 transitions. [2021-12-06 17:18:04,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-06 17:18:04,982 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-06 17:18:04,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:04,982 INFO L225 Difference]: With dead ends: 140 [2021-12-06 17:18:04,982 INFO L226 Difference]: Without dead ends: 140 [2021-12-06 17:18:04,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=267, Invalid=1455, Unknown=0, NotChecked=0, Total=1722 [2021-12-06 17:18:04,983 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 232 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:04,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 914 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:18:04,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-06 17:18:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2021-12-06 17:18:04,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 133 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:04,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2021-12-06 17:18:04,986 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 30 [2021-12-06 17:18:04,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:04,986 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2021-12-06 17:18:04,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:04,986 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2021-12-06 17:18:04,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-06 17:18:04,987 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:04,987 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:04,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-06 17:18:04,987 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:04,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:04,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1144999879, now seen corresponding path program 1 times [2021-12-06 17:18:04,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:18:04,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381192941] [2021-12-06 17:18:04,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:04,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:18:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:05,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:05,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:18:05,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381192941] [2021-12-06 17:18:05,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381192941] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:05,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:05,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-12-06 17:18:05,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976061806] [2021-12-06 17:18:05,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:05,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-06 17:18:05,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:18:05,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-06 17:18:05,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2021-12-06 17:18:05,188 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:05,542 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2021-12-06 17:18:05,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 17:18:05,543 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-06 17:18:05,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:05,543 INFO L225 Difference]: With dead ends: 150 [2021-12-06 17:18:05,543 INFO L226 Difference]: Without dead ends: 150 [2021-12-06 17:18:05,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2021-12-06 17:18:05,544 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 206 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:05,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 587 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:18:05,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-06 17:18:05,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 135. [2021-12-06 17:18:05,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 134 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:05,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2021-12-06 17:18:05,548 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 31 [2021-12-06 17:18:05,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:05,548 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2021-12-06 17:18:05,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:05,548 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2021-12-06 17:18:05,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-06 17:18:05,549 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:05,549 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:05,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-06 17:18:05,549 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:05,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:05,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1135258090, now seen corresponding path program 1 times [2021-12-06 17:18:05,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:18:05,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576793311] [2021-12-06 17:18:05,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:05,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:18:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:05,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:05,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:18:05,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576793311] [2021-12-06 17:18:05,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576793311] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:05,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:05,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:18:05,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007584765] [2021-12-06 17:18:05,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:05,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:18:05,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:18:05,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:18:05,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:18:05,586 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:05,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:05,657 INFO L93 Difference]: Finished difference Result 134 states and 156 transitions. [2021-12-06 17:18:05,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 17:18:05,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-06 17:18:05,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:05,658 INFO L225 Difference]: With dead ends: 134 [2021-12-06 17:18:05,658 INFO L226 Difference]: Without dead ends: 134 [2021-12-06 17:18:05,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:18:05,659 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 9 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:05,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 315 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:18:05,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-06 17:18:05,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2021-12-06 17:18:05,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 113 states have (on average 1.3805309734513274) internal successors, (156), 133 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:05,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2021-12-06 17:18:05,663 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 32 [2021-12-06 17:18:05,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:05,663 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2021-12-06 17:18:05,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:05,663 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2021-12-06 17:18:05,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-06 17:18:05,664 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:05,664 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:05,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-06 17:18:05,664 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:05,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:05,664 INFO L85 PathProgramCache]: Analyzing trace with hash 833262606, now seen corresponding path program 1 times [2021-12-06 17:18:05,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:18:05,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711402176] [2021-12-06 17:18:05,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:05,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:18:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:05,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:05,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:18:05,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711402176] [2021-12-06 17:18:05,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711402176] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:18:05,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284729084] [2021-12-06 17:18:05,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:05,842 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:18:05,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:18:05,842 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:18:05,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 17:18:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:05,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-06 17:18:05,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:05,963 INFO L388 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 [2021-12-06 17:18:05,999 INFO L388 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 [2021-12-06 17:18:06,034 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:18:06,035 INFO L388 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 11 treesize of output 11 [2021-12-06 17:18:06,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:18:06,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-06 17:18:06,177 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:06,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2021-12-06 17:18:06,192 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:06,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-06 17:18:06,267 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:06,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2021-12-06 17:18:06,286 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:06,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2021-12-06 17:18:06,450 INFO L388 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 24 treesize of output 12 [2021-12-06 17:18:06,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-06 17:18:06,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:06,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:18:06,529 INFO L388 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 6 treesize of output 4 [2021-12-06 17:18:06,595 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1051 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1051) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-06 17:18:06,601 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1051 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1050) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1051) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-06 17:18:06,606 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1051 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1050) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1051) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-06 17:18:06,612 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1051 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1051) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-06 17:18:06,622 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1049))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1051)) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-06 17:18:06,629 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1048 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1048) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1049))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1051)) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-06 17:18:06,641 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1048 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) v_ArrVal_1048) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1049))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1051)) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-06 17:18:06,648 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) v_ArrVal_1049))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1051)) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-06 17:18:06,759 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:18:06,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 58 [2021-12-06 17:18:06,769 INFO L354 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-06 17:18:06,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 79 [2021-12-06 17:18:06,778 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-06 17:18:06,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 419 treesize of output 325 [2021-12-06 17:18:06,794 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-06 17:18:06,795 INFO L388 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 184 treesize of output 156 [2021-12-06 17:18:06,799 INFO L388 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 156 treesize of output 148 [2021-12-06 17:18:06,807 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-06 17:18:06,807 INFO L388 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 13 treesize of output 12 [2021-12-06 17:18:06,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:06,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284729084] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:18:06,837 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:18:06,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 20] total 44 [2021-12-06 17:18:06,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956278712] [2021-12-06 17:18:06,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:18:06,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-06 17:18:06,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:18:06,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-06 17:18:06,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1195, Unknown=11, NotChecked=616, Total=1980 [2021-12-06 17:18:06,839 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand has 45 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 45 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:07,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:07,670 INFO L93 Difference]: Finished difference Result 148 states and 165 transitions. [2021-12-06 17:18:07,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-06 17:18:07,670 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 45 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-06 17:18:07,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:07,671 INFO L225 Difference]: With dead ends: 148 [2021-12-06 17:18:07,671 INFO L226 Difference]: Without dead ends: 148 [2021-12-06 17:18:07,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=313, Invalid=2060, Unknown=11, NotChecked=808, Total=3192 [2021-12-06 17:18:07,672 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 233 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 805 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:07,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 1240 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 821 Invalid, 0 Unknown, 805 Unchecked, 0.3s Time] [2021-12-06 17:18:07,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-12-06 17:18:07,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 135. [2021-12-06 17:18:07,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 114 states have (on average 1.3771929824561404) internal successors, (157), 134 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:07,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2021-12-06 17:18:07,675 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 33 [2021-12-06 17:18:07,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:07,675 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2021-12-06 17:18:07,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 45 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:07,675 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2021-12-06 17:18:07,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-06 17:18:07,675 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:07,676 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:07,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 17:18:07,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-06 17:18:07,876 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:07,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:07,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2032785906, now seen corresponding path program 1 times [2021-12-06 17:18:07,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:18:07,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100577276] [2021-12-06 17:18:07,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:07,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:18:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:07,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:18:07,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100577276] [2021-12-06 17:18:07,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100577276] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:07,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:07,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:18:07,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509373933] [2021-12-06 17:18:07,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:07,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:18:07,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:18:07,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:18:07,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:18:07,956 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:08,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:08,141 INFO L93 Difference]: Finished difference Result 231 states and 263 transitions. [2021-12-06 17:18:08,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:18:08,141 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-06 17:18:08,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:08,142 INFO L225 Difference]: With dead ends: 231 [2021-12-06 17:18:08,143 INFO L226 Difference]: Without dead ends: 231 [2021-12-06 17:18:08,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:18:08,143 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 126 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:08,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 344 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:18:08,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-12-06 17:18:08,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 145. [2021-12-06 17:18:08,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 124 states have (on average 1.3790322580645162) internal successors, (171), 144 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 171 transitions. [2021-12-06 17:18:08,148 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 171 transitions. Word has length 35 [2021-12-06 17:18:08,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:08,148 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 171 transitions. [2021-12-06 17:18:08,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:08,148 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 171 transitions. [2021-12-06 17:18:08,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 17:18:08,149 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:08,149 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:08,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-06 17:18:08,149 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:08,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:08,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1408146296, now seen corresponding path program 1 times [2021-12-06 17:18:08,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:18:08,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528139678] [2021-12-06 17:18:08,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:08,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:18:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:08,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:18:08,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528139678] [2021-12-06 17:18:08,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528139678] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:08,178 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:08,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 17:18:08,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522590110] [2021-12-06 17:18:08,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:08,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:18:08,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:18:08,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:18:08,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:18:08,179 INFO L87 Difference]: Start difference. First operand 145 states and 171 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:08,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:08,225 INFO L93 Difference]: Finished difference Result 161 states and 185 transitions. [2021-12-06 17:18:08,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:18:08,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-06 17:18:08,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:08,226 INFO L225 Difference]: With dead ends: 161 [2021-12-06 17:18:08,226 INFO L226 Difference]: Without dead ends: 161 [2021-12-06 17:18:08,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:18:08,227 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 37 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:08,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 136 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:18:08,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-06 17:18:08,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 143. [2021-12-06 17:18:08,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 142 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:08,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 166 transitions. [2021-12-06 17:18:08,230 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 166 transitions. Word has length 36 [2021-12-06 17:18:08,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:08,230 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 166 transitions. [2021-12-06 17:18:08,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:08,230 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 166 transitions. [2021-12-06 17:18:08,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 17:18:08,231 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:08,231 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:08,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-06 17:18:08,231 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:08,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:08,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1408146295, now seen corresponding path program 1 times [2021-12-06 17:18:08,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:18:08,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140110327] [2021-12-06 17:18:08,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:08,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:18:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:08,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:18:08,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140110327] [2021-12-06 17:18:08,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140110327] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:08,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:08,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 17:18:08,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168191588] [2021-12-06 17:18:08,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:08,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:18:08,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:18:08,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:18:08,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:18:08,261 INFO L87 Difference]: Start difference. First operand 143 states and 166 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:08,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:08,310 INFO L93 Difference]: Finished difference Result 164 states and 184 transitions. [2021-12-06 17:18:08,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:18:08,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-06 17:18:08,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:08,312 INFO L225 Difference]: With dead ends: 164 [2021-12-06 17:18:08,312 INFO L226 Difference]: Without dead ends: 164 [2021-12-06 17:18:08,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:18:08,313 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 40 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:08,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 138 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:18:08,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-06 17:18:08,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 141. [2021-12-06 17:18:08,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 124 states have (on average 1.2983870967741935) internal successors, (161), 140 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:08,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 161 transitions. [2021-12-06 17:18:08,316 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 161 transitions. Word has length 36 [2021-12-06 17:18:08,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:08,316 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 161 transitions. [2021-12-06 17:18:08,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:08,316 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 161 transitions. [2021-12-06 17:18:08,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 17:18:08,316 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:08,316 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:08,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-06 17:18:08,317 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:08,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:08,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1408093625, now seen corresponding path program 1 times [2021-12-06 17:18:08,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:18:08,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860838593] [2021-12-06 17:18:08,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:08,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:18:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:08,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:08,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:18:08,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860838593] [2021-12-06 17:18:08,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860838593] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:18:08,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245329607] [2021-12-06 17:18:08,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:08,897 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:18:08,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:18:08,897 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:18:08,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 17:18:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:08,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 103 conjunts are in the unsatisfiable core [2021-12-06 17:18:08,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:08,987 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:08,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-06 17:18:09,020 INFO L388 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 [2021-12-06 17:18:09,059 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-12-06 17:18:09,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2021-12-06 17:18:09,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:18:09,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2021-12-06 17:18:09,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:18:09,307 INFO L354 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2021-12-06 17:18:09,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 64 [2021-12-06 17:18:09,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2021-12-06 17:18:09,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:18:09,398 INFO L354 Elim1Store]: treesize reduction 152, result has 15.6 percent of original size [2021-12-06 17:18:09,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 84 [2021-12-06 17:18:09,407 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-12-06 17:18:09,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 76 [2021-12-06 17:18:09,630 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 17:18:09,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 124 [2021-12-06 17:18:09,634 INFO L388 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 92 treesize of output 83 [2021-12-06 17:18:09,667 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 17:18:09,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 117 [2021-12-06 17:18:09,671 INFO L388 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 92 treesize of output 83 [2021-12-06 17:18:10,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:18:10,323 INFO L354 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2021-12-06 17:18:10,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 101 treesize of output 63 [2021-12-06 17:18:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:10,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:18:10,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245329607] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:10,509 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:18:10,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [25] total 46 [2021-12-06 17:18:10,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410617148] [2021-12-06 17:18:10,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:10,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-06 17:18:10,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:18:10,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-06 17:18:10,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1951, Unknown=0, NotChecked=0, Total=2070 [2021-12-06 17:18:10,511 INFO L87 Difference]: Start difference. First operand 141 states and 161 transitions. Second operand has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:11,541 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2021-12-06 17:18:11,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-06 17:18:11,542 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-06 17:18:11,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:11,542 INFO L225 Difference]: With dead ends: 141 [2021-12-06 17:18:11,542 INFO L226 Difference]: Without dead ends: 141 [2021-12-06 17:18:11,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=257, Invalid=3525, Unknown=0, NotChecked=0, Total=3782 [2021-12-06 17:18:11,544 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 63 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 229 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:11,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 781 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 346 Invalid, 0 Unknown, 229 Unchecked, 0.2s Time] [2021-12-06 17:18:11,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-06 17:18:11,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2021-12-06 17:18:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 124 states have (on average 1.2903225806451613) internal successors, (160), 140 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2021-12-06 17:18:11,546 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 36 [2021-12-06 17:18:11,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:11,546 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2021-12-06 17:18:11,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:11,547 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2021-12-06 17:18:11,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 17:18:11,547 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:11,547 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:11,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 17:18:11,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-12-06 17:18:11,748 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:11,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:11,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1406246583, now seen corresponding path program 1 times [2021-12-06 17:18:11,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:18:11,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021126505] [2021-12-06 17:18:11,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:11,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:18:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:11,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:18:11,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021126505] [2021-12-06 17:18:11,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021126505] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:11,782 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:11,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 17:18:11,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537733751] [2021-12-06 17:18:11,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:11,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:18:11,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:18:11,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:18:11,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:18:11,783 INFO L87 Difference]: Start difference. First operand 141 states and 160 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:11,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:11,787 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2021-12-06 17:18:11,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:18:11,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-06 17:18:11,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:11,788 INFO L225 Difference]: With dead ends: 130 [2021-12-06 17:18:11,788 INFO L226 Difference]: Without dead ends: 130 [2021-12-06 17:18:11,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:18:11,789 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:11,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:18:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-06 17:18:11,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2021-12-06 17:18:11,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.25) internal successors, (140), 128 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:11,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2021-12-06 17:18:11,791 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 36 [2021-12-06 17:18:11,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:11,791 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2021-12-06 17:18:11,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:11,792 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2021-12-06 17:18:11,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-06 17:18:11,792 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:11,792 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:11,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-06 17:18:11,792 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:11,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:11,792 INFO L85 PathProgramCache]: Analyzing trace with hash -183715591, now seen corresponding path program 1 times [2021-12-06 17:18:11,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:18:11,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82859976] [2021-12-06 17:18:11,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:11,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:18:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:12,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:18:12,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82859976] [2021-12-06 17:18:12,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82859976] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:18:12,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478201863] [2021-12-06 17:18:12,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:12,274 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:18:12,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:18:12,275 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:18:12,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 17:18:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:12,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 98 conjunts are in the unsatisfiable core [2021-12-06 17:18:12,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:12,380 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:12,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-06 17:18:12,425 INFO L388 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 [2021-12-06 17:18:12,429 INFO L388 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 [2021-12-06 17:18:12,479 INFO L354 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2021-12-06 17:18:12,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2021-12-06 17:18:12,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:18:12,528 INFO L388 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 21 treesize of output 20 [2021-12-06 17:18:12,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:18:12,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2021-12-06 17:18:12,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-06 17:18:12,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:18:12,776 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-06 17:18:12,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 55 [2021-12-06 17:18:12,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:18:12,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:18:12,843 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-06 17:18:12,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 55 [2021-12-06 17:18:13,048 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 17:18:13,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 87 [2021-12-06 17:18:13,079 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 17:18:13,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 80 [2021-12-06 17:18:13,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:18:13,583 INFO L354 Elim1Store]: treesize reduction 100, result has 16.0 percent of original size [2021-12-06 17:18:13,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 95 treesize of output 73 [2021-12-06 17:18:13,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 26 treesize of output 29 [2021-12-06 17:18:13,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 26 [2021-12-06 17:18:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:13,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:18:14,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2021-12-06 17:18:14,098 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int))) (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1453))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) 0)))))) (forall ((v_ArrVal_1453 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1453))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1))) is different from false [2021-12-06 17:18:14,105 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1452) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1453))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1)) (forall ((v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1452) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1453))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= (select (select .cse1 .cse2) 0) .cse2)))))) is different from false [2021-12-06 17:18:14,113 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1452) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1453))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1)) (forall ((v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (not (let ((.cse2 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1452) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1453))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= .cse1 (select (select .cse2 .cse1) 0))))))) is different from false [2021-12-06 17:18:14,120 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1453))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= (select (select .cse0 .cse1) 0) .cse1))))) (forall ((v_ArrVal_1453 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1453))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1))) is different from false [2021-12-06 17:18:14,132 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1453)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1)) (forall ((v_ArrVal_1453 (Array Int Int))) (not (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1453)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= (select (select .cse2 .cse3) 0) .cse3)))))) is different from false [2021-12-06 17:18:14,143 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int))) (not (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|)))) (store .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|))))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1453)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= (select (select .cse0 .cse1) 0) .cse1))))) (forall ((v_ArrVal_1453 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|)))) (store .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|))))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1453)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1))) is different from false [2021-12-06 17:18:14,155 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int))) (not (let ((.cse1 (let ((.cse3 (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| .cse5)))) (store .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) .cse5)))))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3) v_ArrVal_1453))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) 0)))))) (forall ((v_ArrVal_1453 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse6 (let ((.cse8 (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse7 (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse8))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| .cse10)))) (store .cse9 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse9 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) .cse10)))))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse8) v_ArrVal_1453))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1))) is different from false [2021-12-06 17:18:14,170 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (let ((.cse2 (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse1 (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse4 (select .cse6 .cse2))) (let ((.cse3 (let ((.cse5 (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) .cse4))))) (store .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) .cse4))))))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse2) v_ArrVal_1453))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1)) (forall ((v_ArrVal_1453 (Array Int Int))) (not (let ((.cse8 (let ((.cse10 (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse9 (let ((.cse14 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse12 (select .cse14 .cse10))) (let ((.cse11 (let ((.cse13 (select .cse14 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse13 (store (select |c_#memory_$Pointer$.base| .cse13) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) .cse12))))) (store .cse11 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse11 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) .cse12))))))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse10) v_ArrVal_1453))))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= .cse7 (select (select .cse8 .cse7) 0))))))) is different from false [2021-12-06 17:18:14,184 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1453 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (let ((.cse2 (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse1 (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse3 (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) (.cse5 (select .cse6 .cse2))) (store (store (select |c_#memory_$Pointer$.base| .cse3) .cse4 .cse5) (+ 4 .cse4) .cse5))))))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse2) v_ArrVal_1453))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) 0)) 1)) (forall ((v_ArrVal_1453 (Array Int Int))) (not (let ((.cse8 (let ((.cse10 (+ 4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse9 (let ((.cse14 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse11 (select .cse14 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse11 (let ((.cse12 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) (.cse13 (select .cse14 .cse10))) (store (store (select |c_#memory_$Pointer$.base| .cse11) .cse12 .cse13) (+ 4 .cse12) .cse13))))))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse10) v_ArrVal_1453))))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (= .cse7 (select (select .cse8 .cse7) 0))))))) is different from false [2021-12-06 17:18:14,811 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:18:14,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 483 treesize of output 362 [2021-12-06 17:18:14,825 INFO L354 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-06 17:18:14,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 336 treesize of output 334 [2021-12-06 17:18:14,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 314 [2021-12-06 17:18:14,833 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:18:14,931 INFO L354 Elim1Store]: treesize reduction 153, result has 36.5 percent of original size [2021-12-06 17:18:14,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 395 treesize of output 328 [2021-12-06 17:18:14,936 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:18:14,979 INFO L354 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-12-06 17:18:14,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 350 treesize of output 358 [2021-12-06 17:18:14,986 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:18:15,023 INFO L354 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-12-06 17:18:15,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 399 treesize of output 393 [2021-12-06 17:18:15,036 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:18:15,089 INFO L354 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-12-06 17:18:15,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 412 treesize of output 416 [2021-12-06 17:18:15,105 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-12-06 17:18:15,105 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:18:15,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2021-12-06 17:18:15,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079169136] [2021-12-06 17:18:15,105 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-06 17:18:15,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-06 17:18:15,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:18:15,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-06 17:18:15,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2450, Unknown=35, NotChecked=972, Total=3660 [2021-12-06 17:18:15,107 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 26 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:15,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 17:18:15,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=203, Invalid=2450, Unknown=35, NotChecked=972, Total=3660 [2021-12-06 17:18:15,108 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:15,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:18:15,130 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 17:18:15,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:18:15,310 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@466959ee at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-06 17:18:15,311 INFO L158 Benchmark]: Toolchain (without parser) took 20553.38ms. Allocated memory was 83.9MB in the beginning and 138.4MB in the end (delta: 54.5MB). Free memory was 48.4MB in the beginning and 44.3MB in the end (delta: 4.1MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. [2021-12-06 17:18:15,311 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 83.9MB. Free memory was 63.1MB in the beginning and 63.1MB in the end (delta: 24.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:18:15,312 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.14ms. Allocated memory was 83.9MB in the beginning and 115.3MB in the end (delta: 31.5MB). Free memory was 48.2MB in the beginning and 83.9MB in the end (delta: -35.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-06 17:18:15,312 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.06ms. Allocated memory is still 115.3MB. Free memory was 83.9MB in the beginning and 81.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:18:15,312 INFO L158 Benchmark]: Boogie Preprocessor took 25.19ms. Allocated memory is still 115.3MB. Free memory was 81.8MB in the beginning and 79.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:18:15,312 INFO L158 Benchmark]: RCFGBuilder took 402.47ms. Allocated memory is still 115.3MB. Free memory was 79.7MB in the beginning and 59.5MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-06 17:18:15,312 INFO L158 Benchmark]: TraceAbstraction took 19774.42ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 58.8MB in the beginning and 44.3MB in the end (delta: 14.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2021-12-06 17:18:15,314 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.12ms. Allocated memory is still 83.9MB. Free memory was 63.1MB in the beginning and 63.1MB in the end (delta: 24.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.14ms. Allocated memory was 83.9MB in the beginning and 115.3MB in the end (delta: 31.5MB). Free memory was 48.2MB in the beginning and 83.9MB in the end (delta: -35.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.06ms. Allocated memory is still 115.3MB. Free memory was 83.9MB in the beginning and 81.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.19ms. Allocated memory is still 115.3MB. Free memory was 81.8MB in the beginning and 79.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 402.47ms. Allocated memory is still 115.3MB. Free memory was 79.7MB in the beginning and 59.5MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 19774.42ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 58.8MB in the beginning and 44.3MB in the end (delta: 14.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@466959ee de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@466959ee: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-06 17:18:15,341 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa --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 32bit --witnessprinter.graph.data.programhash 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 17:18:16,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 17:18:16,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 17:18:16,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 17:18:16,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 17:18:16,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 17:18:16,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 17:18:16,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 17:18:16,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 17:18:16,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 17:18:16,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 17:18:16,905 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 17:18:16,905 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 17:18:16,906 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 17:18:16,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 17:18:16,909 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 17:18:16,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 17:18:16,911 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 17:18:16,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 17:18:16,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 17:18:16,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 17:18:16,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 17:18:16,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 17:18:16,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 17:18:16,926 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 17:18:16,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 17:18:16,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 17:18:16,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 17:18:16,928 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 17:18:16,929 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 17:18:16,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 17:18:16,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 17:18:16,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 17:18:16,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 17:18:16,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 17:18:16,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 17:18:16,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 17:18:16,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 17:18:16,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 17:18:16,934 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 17:18:16,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 17:18:16,935 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-06 17:18:16,953 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 17:18:16,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 17:18:16,954 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 17:18:16,954 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 17:18:16,954 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 17:18:16,954 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 17:18:16,955 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 17:18:16,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 17:18:16,955 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 17:18:16,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 17:18:16,956 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 17:18:16,956 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-06 17:18:16,956 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 17:18:16,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 17:18:16,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 17:18:16,956 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-06 17:18:16,956 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-06 17:18:16,957 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-06 17:18:16,957 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 17:18:16,957 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-06 17:18:16,957 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-06 17:18:16,957 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-06 17:18:16,957 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 17:18:16,957 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 17:18:16,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 17:18:16,958 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 17:18:16,958 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 17:18:16,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:18:16,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 17:18:16,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 17:18:16,958 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-06 17:18:16,959 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-06 17:18:16,959 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 17:18:16,959 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-06 17:18:16,959 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/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_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e [2021-12-06 17:18:17,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 17:18:17,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 17:18:17,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 17:18:17,206 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 17:18:17,206 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 17:18:17,207 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2021-12-06 17:18:17,249 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/data/bc9937c3e/aedfcbe1847d41e8aff3acc2007e5aa9/FLAG69d418077 [2021-12-06 17:18:17,668 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 17:18:17,668 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2021-12-06 17:18:17,678 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/data/bc9937c3e/aedfcbe1847d41e8aff3acc2007e5aa9/FLAG69d418077 [2021-12-06 17:18:17,687 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/data/bc9937c3e/aedfcbe1847d41e8aff3acc2007e5aa9 [2021-12-06 17:18:17,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 17:18:17,690 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 17:18:17,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 17:18:17,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 17:18:17,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 17:18:17,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:18:17" (1/1) ... [2021-12-06 17:18:17,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e3aa488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:17, skipping insertion in model container [2021-12-06 17:18:17,695 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:18:17" (1/1) ... [2021-12-06 17:18:17,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 17:18:17,726 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 17:18:17,924 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:18:17,933 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 17:18:17,971 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:18:17,995 INFO L208 MainTranslator]: Completed translation [2021-12-06 17:18:17,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:17 WrapperNode [2021-12-06 17:18:17,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 17:18:17,997 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 17:18:17,997 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 17:18:17,997 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 17:18:18,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:17" (1/1) ... [2021-12-06 17:18:18,016 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:17" (1/1) ... [2021-12-06 17:18:18,036 INFO L137 Inliner]: procedures = 128, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 125 [2021-12-06 17:18:18,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 17:18:18,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 17:18:18,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 17:18:18,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 17:18:18,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:17" (1/1) ... [2021-12-06 17:18:18,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:17" (1/1) ... [2021-12-06 17:18:18,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:17" (1/1) ... [2021-12-06 17:18:18,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:17" (1/1) ... [2021-12-06 17:18:18,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:17" (1/1) ... [2021-12-06 17:18:18,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:17" (1/1) ... [2021-12-06 17:18:18,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:17" (1/1) ... [2021-12-06 17:18:18,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 17:18:18,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 17:18:18,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 17:18:18,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 17:18:18,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:17" (1/1) ... [2021-12-06 17:18:18,072 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:18:18,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:18:18,094 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 17:18:18,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 17:18:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 17:18:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 17:18:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-06 17:18:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-06 17:18:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 17:18:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-06 17:18:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 17:18:18,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 17:18:18,218 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 17:18:18,219 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 17:18:18,678 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 17:18:18,683 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 17:18:18,683 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-06 17:18:18,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:18:18 BoogieIcfgContainer [2021-12-06 17:18:18,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 17:18:18,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 17:18:18,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 17:18:18,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 17:18:18,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:18:17" (1/3) ... [2021-12-06 17:18:18,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77130c65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:18:18, skipping insertion in model container [2021-12-06 17:18:18,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:17" (2/3) ... [2021-12-06 17:18:18,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77130c65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:18:18, skipping insertion in model container [2021-12-06 17:18:18,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:18:18" (3/3) ... [2021-12-06 17:18:18,691 INFO L111 eAbstractionObserver]: Analyzing ICFG skiplist_2lvl.i [2021-12-06 17:18:18,694 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 17:18:18,695 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2021-12-06 17:18:18,726 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 17:18:18,731 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 17:18:18,731 INFO L340 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2021-12-06 17:18:18,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 61 states have (on average 2.2131147540983607) internal successors, (135), 126 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:18,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-06 17:18:18,747 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:18,747 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-06 17:18:18,747 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:18,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:18,751 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-06 17:18:18,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:18:18,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497417521] [2021-12-06 17:18:18,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:18,761 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:18:18,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:18:18,762 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:18:18,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-06 17:18:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:18,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 17:18:18,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:18,901 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:18:18,917 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-06 17:18:18,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 14 [2021-12-06 17:18:18,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:18,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:18:18,937 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:18:18,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497417521] [2021-12-06 17:18:18,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497417521] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:18,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:18,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 17:18:18,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99655938] [2021-12-06 17:18:18,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:18,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:18:18,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:18:18,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:18:18,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:18:18,968 INFO L87 Difference]: Start difference. First operand has 127 states, 61 states have (on average 2.2131147540983607) internal successors, (135), 126 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:19,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:19,258 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2021-12-06 17:18:19,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:18:19,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-06 17:18:19,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:19,268 INFO L225 Difference]: With dead ends: 150 [2021-12-06 17:18:19,269 INFO L226 Difference]: Without dead ends: 148 [2021-12-06 17:18:19,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:18:19,273 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 114 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:19,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 78 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:18:19,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-12-06 17:18:19,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 118. [2021-12-06 17:18:19,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 60 states have (on average 2.033333333333333) internal successors, (122), 117 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2021-12-06 17:18:19,306 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 3 [2021-12-06 17:18:19,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:19,306 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2021-12-06 17:18:19,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:19,307 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2021-12-06 17:18:19,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-06 17:18:19,307 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:19,307 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-06 17:18:19,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-06 17:18:19,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:18:19,509 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:19,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:19,512 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-06 17:18:19,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:18:19,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294721463] [2021-12-06 17:18:19,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:19,516 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:18:19,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:18:19,520 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:18:19,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-06 17:18:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:19,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 17:18:19,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:19,716 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:19,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2021-12-06 17:18:19,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:19,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:18:19,735 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:18:19,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294721463] [2021-12-06 17:18:19,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [294721463] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:19,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:19,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 17:18:19,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137412956] [2021-12-06 17:18:19,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:19,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:18:19,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:18:19,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:18:19,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:18:19,738 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:19,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:19,976 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2021-12-06 17:18:19,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:18:19,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-06 17:18:19,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:19,978 INFO L225 Difference]: With dead ends: 111 [2021-12-06 17:18:19,978 INFO L226 Difference]: Without dead ends: 111 [2021-12-06 17:18:19,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:18:19,980 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 111 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:19,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 61 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:18:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-06 17:18:19,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-12-06 17:18:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 60 states have (on average 1.9166666666666667) internal successors, (115), 110 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2021-12-06 17:18:19,990 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 3 [2021-12-06 17:18:19,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:19,990 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2021-12-06 17:18:19,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:19,991 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2021-12-06 17:18:19,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-06 17:18:19,991 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:19,991 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:19,998 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-06 17:18:20,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:18:20,193 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:20,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:20,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1056606480, now seen corresponding path program 1 times [2021-12-06 17:18:20,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:18:20,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874120741] [2021-12-06 17:18:20,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:20,199 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:18:20,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:18:20,202 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:18:20,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-06 17:18:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:20,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 17:18:20,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:20,327 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-06 17:18:20,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 18 [2021-12-06 17:18:20,346 INFO L388 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 [2021-12-06 17:18:20,386 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-06 17:18:20,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 39 [2021-12-06 17:18:20,431 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 17:18:20,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2021-12-06 17:18:20,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-12-06 17:18:20,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:20,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:18:20,460 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:18:20,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874120741] [2021-12-06 17:18:20,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874120741] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:20,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:20,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:18:20,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698764403] [2021-12-06 17:18:20,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:20,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:18:20,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:18:20,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:18:20,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:18:20,462 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:20,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:20,794 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2021-12-06 17:18:20,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:18:20,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-06 17:18:20,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:20,795 INFO L225 Difference]: With dead ends: 110 [2021-12-06 17:18:20,795 INFO L226 Difference]: Without dead ends: 110 [2021-12-06 17:18:20,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:18:20,797 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 8 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:20,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 262 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:18:20,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-06 17:18:20,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-12-06 17:18:20,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 60 states have (on average 1.9) internal successors, (114), 109 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:20,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2021-12-06 17:18:20,803 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 10 [2021-12-06 17:18:20,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:20,803 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2021-12-06 17:18:20,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2021-12-06 17:18:20,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-06 17:18:20,803 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:20,804 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:20,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-06 17:18:21,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:18:21,005 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:21,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:21,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1056606481, now seen corresponding path program 1 times [2021-12-06 17:18:21,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:18:21,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830687509] [2021-12-06 17:18:21,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:21,010 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:18:21,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:18:21,013 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:18:21,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-06 17:18:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:21,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-06 17:18:21,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:21,202 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:18:21,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-06 17:18:21,221 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-06 17:18:21,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 18 [2021-12-06 17:18:21,257 INFO L388 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 [2021-12-06 17:18:21,263 INFO L388 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 [2021-12-06 17:18:21,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:18:21,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 17:18:21,309 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-06 17:18:21,309 INFO L388 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 18 treesize of output 18 [2021-12-06 17:18:21,348 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 17:18:21,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 17:18:21,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:18:21,354 INFO L388 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 21 treesize of output 20 [2021-12-06 17:18:21,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-06 17:18:21,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:18:21,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:21,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:18:21,400 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:18:21,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830687509] [2021-12-06 17:18:21,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830687509] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:21,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:21,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:18:21,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078506056] [2021-12-06 17:18:21,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:21,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:18:21,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:18:21,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:18:21,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:18:21,402 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:21,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:21,860 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2021-12-06 17:18:21,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:18:21,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-06 17:18:21,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:21,862 INFO L225 Difference]: With dead ends: 109 [2021-12-06 17:18:21,862 INFO L226 Difference]: Without dead ends: 109 [2021-12-06 17:18:21,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:18:21,863 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 10 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:21,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 251 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:18:21,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-06 17:18:21,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-12-06 17:18:21,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 60 states have (on average 1.8833333333333333) internal successors, (113), 108 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:21,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2021-12-06 17:18:21,871 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 10 [2021-12-06 17:18:21,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:21,871 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2021-12-06 17:18:21,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:21,872 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2021-12-06 17:18:21,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-06 17:18:21,872 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:21,872 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:21,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-06 17:18:22,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:18:22,074 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:22,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:22,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937495, now seen corresponding path program 1 times [2021-12-06 17:18:22,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:18:22,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348020246] [2021-12-06 17:18:22,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:22,078 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:18:22,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:18:22,080 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:18:22,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-06 17:18:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:22,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 17:18:22,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:22,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:18:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:22,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:18:22,181 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:18:22,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348020246] [2021-12-06 17:18:22,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348020246] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:22,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:22,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:18:22,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390798360] [2021-12-06 17:18:22,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:22,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:18:22,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:18:22,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:18:22,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:18:22,182 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:22,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:22,395 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2021-12-06 17:18:22,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 17:18:22,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-06 17:18:22,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:22,396 INFO L225 Difference]: With dead ends: 108 [2021-12-06 17:18:22,397 INFO L226 Difference]: Without dead ends: 108 [2021-12-06 17:18:22,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:18:22,398 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 6 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:22,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 342 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:18:22,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-06 17:18:22,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-12-06 17:18:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 107 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:22,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2021-12-06 17:18:22,405 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 11 [2021-12-06 17:18:22,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:22,405 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2021-12-06 17:18:22,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:22,406 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2021-12-06 17:18:22,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-06 17:18:22,406 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:22,406 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:22,413 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-06 17:18:22,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:18:22,608 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:22,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:22,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937494, now seen corresponding path program 1 times [2021-12-06 17:18:22,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:18:22,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819782324] [2021-12-06 17:18:22,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:22,611 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:18:22,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:18:22,613 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:18:22,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-06 17:18:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:22,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-06 17:18:22,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:22,730 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:18:22,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-06 17:18:22,747 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-06 17:18:22,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 18 [2021-12-06 17:18:22,768 INFO L388 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 [2021-12-06 17:18:22,773 INFO L388 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 [2021-12-06 17:18:22,803 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-06 17:18:22,804 INFO L388 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 20 treesize of output 20 [2021-12-06 17:18:22,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 17:18:22,842 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 17:18:22,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:18:22,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:18:22,850 INFO L388 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 23 treesize of output 22 [2021-12-06 17:18:22,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-06 17:18:22,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:18:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:22,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:18:22,897 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:18:22,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819782324] [2021-12-06 17:18:22,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819782324] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:22,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:22,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:18:22,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510567534] [2021-12-06 17:18:22,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:22,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:18:22,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:18:22,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:18:22,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:18:22,898 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:23,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:23,427 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2021-12-06 17:18:23,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:18:23,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-06 17:18:23,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:23,429 INFO L225 Difference]: With dead ends: 107 [2021-12-06 17:18:23,429 INFO L226 Difference]: Without dead ends: 107 [2021-12-06 17:18:23,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:18:23,430 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 6 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:23,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 280 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 17:18:23,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-06 17:18:23,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-12-06 17:18:23,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 60 states have (on average 1.85) internal successors, (111), 106 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:23,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2021-12-06 17:18:23,434 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 11 [2021-12-06 17:18:23,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:23,434 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2021-12-06 17:18:23,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:23,434 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2021-12-06 17:18:23,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-06 17:18:23,435 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:23,435 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:23,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-06 17:18:23,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:18:23,637 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:23,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:23,638 INFO L85 PathProgramCache]: Analyzing trace with hash -266592339, now seen corresponding path program 1 times [2021-12-06 17:18:23,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:18:23,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822385132] [2021-12-06 17:18:23,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:23,640 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:18:23,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:18:23,642 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:18:23,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-06 17:18:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:23,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-06 17:18:23,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:23,770 INFO L388 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 22 treesize of output 20 [2021-12-06 17:18:23,786 INFO L388 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 [2021-12-06 17:18:23,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:18:23,825 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 17:18:23,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2021-12-06 17:18:23,940 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:23,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2021-12-06 17:18:23,962 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:23,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-06 17:18:23,984 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-06 17:18:23,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2021-12-06 17:18:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:23,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:18:23,995 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:18:23,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822385132] [2021-12-06 17:18:23,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822385132] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:23,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:23,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:18:23,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693856450] [2021-12-06 17:18:23,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:23,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:18:23,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:18:23,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:18:23,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:18:23,996 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:24,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:24,519 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2021-12-06 17:18:24,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 17:18:24,519 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-06 17:18:24,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:24,520 INFO L225 Difference]: With dead ends: 106 [2021-12-06 17:18:24,520 INFO L226 Difference]: Without dead ends: 106 [2021-12-06 17:18:24,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-06 17:18:24,520 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 16 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:24,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 465 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 17:18:24,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-06 17:18:24,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-12-06 17:18:24,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 105 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:24,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2021-12-06 17:18:24,524 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 15 [2021-12-06 17:18:24,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:24,524 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2021-12-06 17:18:24,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:24,524 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2021-12-06 17:18:24,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-06 17:18:24,525 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:24,525 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:24,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-06 17:18:24,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:18:24,726 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:24,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:24,728 INFO L85 PathProgramCache]: Analyzing trace with hash -266592338, now seen corresponding path program 1 times [2021-12-06 17:18:24,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:18:24,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827474617] [2021-12-06 17:18:24,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:24,730 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:18:24,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:18:24,732 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:18:24,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-06 17:18:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:24,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-06 17:18:24,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:24,844 INFO L388 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 24 treesize of output 22 [2021-12-06 17:18:24,860 INFO L388 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 [2021-12-06 17:18:24,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:18:24,907 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 17:18:24,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2021-12-06 17:18:24,915 INFO L388 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 13 treesize of output 9 [2021-12-06 17:18:25,053 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:25,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2021-12-06 17:18:25,059 INFO L388 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 20 treesize of output 22 [2021-12-06 17:18:25,096 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:25,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2021-12-06 17:18:25,101 INFO L388 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 20 treesize of output 22 [2021-12-06 17:18:25,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:18:25,140 INFO L388 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 29 treesize of output 13 [2021-12-06 17:18:25,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 17:18:25,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:25,161 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:18:25,161 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:18:25,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827474617] [2021-12-06 17:18:25,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827474617] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:25,161 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:25,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:18:25,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603043503] [2021-12-06 17:18:25,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:25,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:18:25,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:18:25,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:18:25,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:18:25,163 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:25,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:25,728 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2021-12-06 17:18:25,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 17:18:25,729 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-06 17:18:25,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:25,729 INFO L225 Difference]: With dead ends: 105 [2021-12-06 17:18:25,729 INFO L226 Difference]: Without dead ends: 105 [2021-12-06 17:18:25,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-06 17:18:25,730 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 12 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:25,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 430 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 17:18:25,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-06 17:18:25,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-12-06 17:18:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 60 states have (on average 1.8166666666666667) internal successors, (109), 104 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2021-12-06 17:18:25,734 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 15 [2021-12-06 17:18:25,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:25,734 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2021-12-06 17:18:25,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:25,734 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2021-12-06 17:18:25,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-06 17:18:25,735 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:25,735 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:25,742 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-12-06 17:18:25,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:18:25,937 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:25,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:25,938 INFO L85 PathProgramCache]: Analyzing trace with hash 325572089, now seen corresponding path program 1 times [2021-12-06 17:18:25,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:18:25,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104158201] [2021-12-06 17:18:25,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:25,940 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:18:25,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:18:25,942 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:18:25,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-06 17:18:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:26,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 17:18:26,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:26,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 17:18:26,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:26,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:18:26,055 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:18:26,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104158201] [2021-12-06 17:18:26,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104158201] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:26,055 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:26,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:18:26,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866673275] [2021-12-06 17:18:26,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:26,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:18:26,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:18:26,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:18:26,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:18:26,056 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:26,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:26,284 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2021-12-06 17:18:26,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 17:18:26,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-06 17:18:26,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:26,286 INFO L225 Difference]: With dead ends: 104 [2021-12-06 17:18:26,286 INFO L226 Difference]: Without dead ends: 104 [2021-12-06 17:18:26,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:18:26,286 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 5 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:26,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 331 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:18:26,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-06 17:18:26,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-12-06 17:18:26,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 60 states have (on average 1.8) internal successors, (108), 103 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2021-12-06 17:18:26,289 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 16 [2021-12-06 17:18:26,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:26,289 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2021-12-06 17:18:26,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2021-12-06 17:18:26,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-06 17:18:26,290 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:26,290 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:26,298 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-06 17:18:26,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:18:26,491 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:26,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:26,493 INFO L85 PathProgramCache]: Analyzing trace with hash 325572090, now seen corresponding path program 1 times [2021-12-06 17:18:26,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:18:26,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636642305] [2021-12-06 17:18:26,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:26,495 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:18:26,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:18:26,497 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:18:26,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-06 17:18:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:26,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-06 17:18:26,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:26,640 INFO L388 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 22 treesize of output 20 [2021-12-06 17:18:26,657 INFO L388 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 [2021-12-06 17:18:26,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:18:26,703 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 17:18:26,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2021-12-06 17:18:26,712 INFO L388 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 13 treesize of output 9 [2021-12-06 17:18:26,863 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:26,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2021-12-06 17:18:26,868 INFO L388 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 20 treesize of output 22 [2021-12-06 17:18:26,901 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:26,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2021-12-06 17:18:26,907 INFO L388 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 20 treesize of output 22 [2021-12-06 17:18:26,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 17:18:26,939 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-06 17:18:26,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2021-12-06 17:18:26,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:26,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:18:26,960 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:18:26,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636642305] [2021-12-06 17:18:26,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636642305] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:26,961 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:26,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:18:26,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179677449] [2021-12-06 17:18:26,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:26,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:18:26,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:18:26,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:18:26,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:18:26,962 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:27,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:27,329 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2021-12-06 17:18:27,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 17:18:27,330 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-06 17:18:27,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:27,331 INFO L225 Difference]: With dead ends: 103 [2021-12-06 17:18:27,331 INFO L226 Difference]: Without dead ends: 103 [2021-12-06 17:18:27,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-06 17:18:27,331 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 17 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:27,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 320 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:18:27,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-06 17:18:27,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-12-06 17:18:27,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 60 states have (on average 1.7833333333333334) internal successors, (107), 102 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:27,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2021-12-06 17:18:27,335 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 16 [2021-12-06 17:18:27,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:27,335 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2021-12-06 17:18:27,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:27,335 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2021-12-06 17:18:27,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-06 17:18:27,336 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:27,336 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:27,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-12-06 17:18:27,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:18:27,537 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:27,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:27,537 INFO L85 PathProgramCache]: Analyzing trace with hash -819039076, now seen corresponding path program 1 times [2021-12-06 17:18:27,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:18:27,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067822946] [2021-12-06 17:18:27,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:27,538 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:18:27,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:18:27,538 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:18:27,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-06 17:18:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:27,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 17:18:27,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:27,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:27,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:18:27,638 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:18:27,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067822946] [2021-12-06 17:18:27,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1067822946] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:27,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:27,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:18:27,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919694240] [2021-12-06 17:18:27,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:27,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:18:27,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:18:27,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:18:27,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:18:27,639 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:27,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:27,990 INFO L93 Difference]: Finished difference Result 163 states and 170 transitions. [2021-12-06 17:18:27,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:18:27,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-06 17:18:27,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:27,991 INFO L225 Difference]: With dead ends: 163 [2021-12-06 17:18:27,991 INFO L226 Difference]: Without dead ends: 163 [2021-12-06 17:18:27,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:18:27,992 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 339 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:27,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 145 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:18:27,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-06 17:18:27,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 101. [2021-12-06 17:18:27,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 60 states have (on average 1.75) internal successors, (105), 100 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2021-12-06 17:18:27,994 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 20 [2021-12-06 17:18:27,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:27,995 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2021-12-06 17:18:27,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2021-12-06 17:18:27,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-06 17:18:27,995 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:27,995 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:28,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-12-06 17:18:28,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:18:28,196 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:28,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:28,197 INFO L85 PathProgramCache]: Analyzing trace with hash -819039075, now seen corresponding path program 1 times [2021-12-06 17:18:28,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:18:28,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309670096] [2021-12-06 17:18:28,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:28,197 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:18:28,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:18:28,198 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:18:28,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-06 17:18:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:28,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 17:18:28,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:28,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:28,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:18:28,354 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:18:28,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309670096] [2021-12-06 17:18:28,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309670096] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:28,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:28,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:18:28,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175636733] [2021-12-06 17:18:28,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:28,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:18:28,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:18:28,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:18:28,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:18:28,355 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:28,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:28,764 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2021-12-06 17:18:28,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:18:28,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-06 17:18:28,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:28,766 INFO L225 Difference]: With dead ends: 134 [2021-12-06 17:18:28,766 INFO L226 Difference]: Without dead ends: 134 [2021-12-06 17:18:28,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:18:28,766 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 437 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:28,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 107 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:18:28,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-06 17:18:28,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 99. [2021-12-06 17:18:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 98 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2021-12-06 17:18:28,769 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 20 [2021-12-06 17:18:28,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:28,769 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2021-12-06 17:18:28,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:28,769 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2021-12-06 17:18:28,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-06 17:18:28,769 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:28,769 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:28,780 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-12-06 17:18:28,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:18:28,971 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:28,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:28,972 INFO L85 PathProgramCache]: Analyzing trace with hash 379593084, now seen corresponding path program 1 times [2021-12-06 17:18:28,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:18:28,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209625603] [2021-12-06 17:18:28,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:28,974 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:18:28,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:18:28,976 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:18:28,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-06 17:18:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:29,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 17:18:29,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:29,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:29,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:18:29,097 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:18:29,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209625603] [2021-12-06 17:18:29,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209625603] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:29,097 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:29,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:18:29,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885502562] [2021-12-06 17:18:29,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:29,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:18:29,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:18:29,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:18:29,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:18:29,098 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:29,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:29,468 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2021-12-06 17:18:29,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:18:29,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-06 17:18:29,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:29,469 INFO L225 Difference]: With dead ends: 120 [2021-12-06 17:18:29,469 INFO L226 Difference]: Without dead ends: 120 [2021-12-06 17:18:29,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:18:29,470 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 282 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:29,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 114 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:18:29,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-06 17:18:29,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 96. [2021-12-06 17:18:29,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 95 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:29,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2021-12-06 17:18:29,473 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 21 [2021-12-06 17:18:29,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:29,473 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2021-12-06 17:18:29,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:29,473 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2021-12-06 17:18:29,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-06 17:18:29,474 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:29,474 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:29,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-12-06 17:18:29,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:18:29,675 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:29,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:29,676 INFO L85 PathProgramCache]: Analyzing trace with hash 379593085, now seen corresponding path program 1 times [2021-12-06 17:18:29,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:18:29,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340997253] [2021-12-06 17:18:29,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:29,678 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:18:29,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:18:29,681 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:18:29,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-06 17:18:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:29,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 17:18:29,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:29,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:29,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:18:29,832 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:18:29,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340997253] [2021-12-06 17:18:29,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340997253] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:29,833 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:29,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:18:29,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121392074] [2021-12-06 17:18:29,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:29,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:18:29,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:18:29,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:18:29,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:18:29,834 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:30,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:30,218 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2021-12-06 17:18:30,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:18:30,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-06 17:18:30,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:30,219 INFO L225 Difference]: With dead ends: 91 [2021-12-06 17:18:30,220 INFO L226 Difference]: Without dead ends: 91 [2021-12-06 17:18:30,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:18:30,220 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 264 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:30,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 74 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:18:30,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-06 17:18:30,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-12-06 17:18:30,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 90 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:30,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2021-12-06 17:18:30,222 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 21 [2021-12-06 17:18:30,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:30,222 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2021-12-06 17:18:30,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2021-12-06 17:18:30,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-06 17:18:30,223 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:30,223 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:30,230 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-12-06 17:18:30,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:18:30,424 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:30,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1117536095, now seen corresponding path program 1 times [2021-12-06 17:18:30,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:18:30,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652581475] [2021-12-06 17:18:30,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:30,427 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:18:30,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:18:30,430 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:18:30,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-06 17:18:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:30,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-06 17:18:30,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:30,581 INFO L388 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 22 treesize of output 20 [2021-12-06 17:18:30,598 INFO L388 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 [2021-12-06 17:18:30,615 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:18:30,616 INFO L388 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 14 treesize of output 14 [2021-12-06 17:18:30,640 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 17:18:30,641 INFO L388 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 22 treesize of output 21 [2021-12-06 17:18:30,746 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:30,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 45 [2021-12-06 17:18:30,793 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:30,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2021-12-06 17:18:30,933 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:30,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2021-12-06 17:18:30,980 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:30,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2021-12-06 17:18:31,132 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-06 17:18:31,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 24 [2021-12-06 17:18:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:31,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:18:31,184 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:18:31,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652581475] [2021-12-06 17:18:31,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652581475] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:31,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:31,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-06 17:18:31,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538404946] [2021-12-06 17:18:31,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:31,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-06 17:18:31,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:18:31,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-06 17:18:31,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-12-06 17:18:31,185 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:33,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:33,595 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2021-12-06 17:18:33,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-06 17:18:33,596 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-06 17:18:33,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:33,596 INFO L225 Difference]: With dead ends: 154 [2021-12-06 17:18:33,596 INFO L226 Difference]: Without dead ends: 154 [2021-12-06 17:18:33,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2021-12-06 17:18:33,597 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 354 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:33,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 592 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-06 17:18:33,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-06 17:18:33,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 91. [2021-12-06 17:18:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 90 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2021-12-06 17:18:33,600 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 22 [2021-12-06 17:18:33,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:33,600 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2021-12-06 17:18:33,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:33,601 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2021-12-06 17:18:33,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-06 17:18:33,602 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:33,602 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:33,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-06 17:18:33,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:18:33,803 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:33,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:33,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1117536094, now seen corresponding path program 1 times [2021-12-06 17:18:33,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:18:33,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319612521] [2021-12-06 17:18:33,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:33,806 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:18:33,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:18:33,808 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:18:33,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-06 17:18:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:33,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-06 17:18:33,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:33,984 INFO L388 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 24 treesize of output 22 [2021-12-06 17:18:34,002 INFO L388 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 [2021-12-06 17:18:34,022 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:18:34,022 INFO L388 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 14 treesize of output 14 [2021-12-06 17:18:34,039 INFO L388 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 6 treesize of output 5 [2021-12-06 17:18:34,050 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 17:18:34,050 INFO L388 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 22 treesize of output 21 [2021-12-06 17:18:34,200 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:34,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 56 [2021-12-06 17:18:34,206 INFO L388 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 46 treesize of output 42 [2021-12-06 17:18:34,328 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:34,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 64 [2021-12-06 17:18:34,334 INFO L388 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 69 treesize of output 61 [2021-12-06 17:18:34,764 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:34,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 62 [2021-12-06 17:18:34,770 INFO L388 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 56 treesize of output 50 [2021-12-06 17:18:34,829 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:34,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2021-12-06 17:18:34,834 INFO L388 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 56 treesize of output 50 [2021-12-06 17:18:35,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:18:35,273 INFO L388 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 41 treesize of output 23 [2021-12-06 17:18:35,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2021-12-06 17:18:35,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:35,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:18:35,519 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:18:35,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319612521] [2021-12-06 17:18:35,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1319612521] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:35,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:35,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-06 17:18:35,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892132845] [2021-12-06 17:18:35,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:35,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-06 17:18:35,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:18:35,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-06 17:18:35,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-12-06 17:18:35,520 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:41,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:41,768 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2021-12-06 17:18:41,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-06 17:18:41,768 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-06 17:18:41,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:41,769 INFO L225 Difference]: With dead ends: 149 [2021-12-06 17:18:41,769 INFO L226 Difference]: Without dead ends: 149 [2021-12-06 17:18:41,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2021-12-06 17:18:41,770 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 366 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:41,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 506 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-12-06 17:18:41,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-06 17:18:41,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 100. [2021-12-06 17:18:41,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.5) internal successors, (111), 99 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:41,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2021-12-06 17:18:41,772 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 22 [2021-12-06 17:18:41,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:41,772 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2021-12-06 17:18:41,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:41,773 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2021-12-06 17:18:41,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-06 17:18:41,773 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:41,773 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:41,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-06 17:18:41,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:18:41,975 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:41,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:41,976 INFO L85 PathProgramCache]: Analyzing trace with hash -191213837, now seen corresponding path program 1 times [2021-12-06 17:18:41,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:18:41,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253453450] [2021-12-06 17:18:41,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:41,978 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:18:41,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:18:41,980 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:18:41,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-06 17:18:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:42,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 17:18:42,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:42,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:42,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:18:42,321 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:18:42,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253453450] [2021-12-06 17:18:42,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253453450] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:42,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:42,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:18:42,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236055356] [2021-12-06 17:18:42,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:42,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:18:42,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:18:42,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:18:42,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:18:42,322 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:42,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:42,328 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2021-12-06 17:18:42,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:18:42,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-06 17:18:42,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:42,329 INFO L225 Difference]: With dead ends: 106 [2021-12-06 17:18:42,329 INFO L226 Difference]: Without dead ends: 106 [2021-12-06 17:18:42,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:18:42,330 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 10 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:42,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 344 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 37 Unchecked, 0.0s Time] [2021-12-06 17:18:42,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-06 17:18:42,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2021-12-06 17:18:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 79 states have (on average 1.481012658227848) internal successors, (117), 104 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:42,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2021-12-06 17:18:42,333 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 24 [2021-12-06 17:18:42,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:42,333 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2021-12-06 17:18:42,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:42,333 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2021-12-06 17:18:42,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 17:18:42,333 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:42,334 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:42,341 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-12-06 17:18:42,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:18:42,534 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:42,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:42,534 INFO L85 PathProgramCache]: Analyzing trace with hash 928212027, now seen corresponding path program 1 times [2021-12-06 17:18:42,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:18:42,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370131451] [2021-12-06 17:18:42,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:42,535 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:18:42,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:18:42,536 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:18:42,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-06 17:18:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:42,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-06 17:18:42,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:42,672 INFO L388 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 28 treesize of output 26 [2021-12-06 17:18:42,691 INFO L388 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 [2021-12-06 17:18:42,714 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:18:42,715 INFO L388 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 16 treesize of output 16 [2021-12-06 17:18:42,746 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 17:18:42,746 INFO L388 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 22 treesize of output 21 [2021-12-06 17:18:42,903 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:42,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 45 [2021-12-06 17:18:42,959 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:42,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2021-12-06 17:18:43,126 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:43,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2021-12-06 17:18:43,170 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:43,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 48 [2021-12-06 17:18:43,385 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-06 17:18:43,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 24 [2021-12-06 17:18:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:43,414 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:18:43,414 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:18:43,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370131451] [2021-12-06 17:18:43,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370131451] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:43,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:43,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-06 17:18:43,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459261307] [2021-12-06 17:18:43,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:43,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-06 17:18:43,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:18:43,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-06 17:18:43,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:18:43,415 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:45,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:45,208 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2021-12-06 17:18:45,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-06 17:18:45,208 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-06 17:18:45,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:45,209 INFO L225 Difference]: With dead ends: 141 [2021-12-06 17:18:45,209 INFO L226 Difference]: Without dead ends: 141 [2021-12-06 17:18:45,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=160, Invalid=770, Unknown=0, NotChecked=0, Total=930 [2021-12-06 17:18:45,210 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 239 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:45,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 471 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-06 17:18:45,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-06 17:18:45,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 109. [2021-12-06 17:18:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 108 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2021-12-06 17:18:45,212 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 26 [2021-12-06 17:18:45,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:45,213 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2021-12-06 17:18:45,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:45,213 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2021-12-06 17:18:45,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 17:18:45,213 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:45,213 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:45,221 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-12-06 17:18:45,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:18:45,414 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:45,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:45,415 INFO L85 PathProgramCache]: Analyzing trace with hash 928212028, now seen corresponding path program 1 times [2021-12-06 17:18:45,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:18:45,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571564722] [2021-12-06 17:18:45,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:45,417 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:18:45,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:18:45,418 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:18:45,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-06 17:18:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:45,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-06 17:18:45,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:45,556 INFO L388 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 22 treesize of output 20 [2021-12-06 17:18:45,576 INFO L388 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 [2021-12-06 17:18:45,580 INFO L388 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 [2021-12-06 17:18:45,603 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:18:45,603 INFO L388 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 15 treesize of output 15 [2021-12-06 17:18:45,627 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 17:18:45,627 INFO L388 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 22 treesize of output 21 [2021-12-06 17:18:45,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:18:45,635 INFO L388 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 21 treesize of output 20 [2021-12-06 17:18:45,768 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:45,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 56 [2021-12-06 17:18:45,773 INFO L388 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 33 treesize of output 33 [2021-12-06 17:18:45,834 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:45,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2021-12-06 17:18:45,838 INFO L388 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 33 treesize of output 33 [2021-12-06 17:18:46,026 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:46,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 62 [2021-12-06 17:18:46,032 INFO L388 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 35 treesize of output 35 [2021-12-06 17:18:46,067 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:46,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2021-12-06 17:18:46,072 INFO L388 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 35 treesize of output 35 [2021-12-06 17:18:46,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:18:46,335 INFO L388 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 41 treesize of output 23 [2021-12-06 17:18:46,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-12-06 17:18:46,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:46,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:18:46,375 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:18:46,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571564722] [2021-12-06 17:18:46,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571564722] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:46,375 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:46,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-06 17:18:46,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74021482] [2021-12-06 17:18:46,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:46,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-06 17:18:46,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:18:46,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-06 17:18:46,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:18:46,376 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:48,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:48,707 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2021-12-06 17:18:48,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-06 17:18:48,708 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-06 17:18:48,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:48,708 INFO L225 Difference]: With dead ends: 141 [2021-12-06 17:18:48,708 INFO L226 Difference]: Without dead ends: 141 [2021-12-06 17:18:48,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=163, Invalid=767, Unknown=0, NotChecked=0, Total=930 [2021-12-06 17:18:48,709 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 237 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:48,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 414 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-06 17:18:48,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-06 17:18:48,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 109. [2021-12-06 17:18:48,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 108 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:48,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2021-12-06 17:18:48,712 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 26 [2021-12-06 17:18:48,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:48,712 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2021-12-06 17:18:48,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:48,712 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2021-12-06 17:18:48,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 17:18:48,712 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:48,712 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:48,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-06 17:18:48,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:18:48,913 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:48,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:48,915 INFO L85 PathProgramCache]: Analyzing trace with hash -294673205, now seen corresponding path program 1 times [2021-12-06 17:18:48,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:18:48,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744106135] [2021-12-06 17:18:48,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:48,916 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:18:48,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:18:48,919 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:18:48,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-06 17:18:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:49,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:18:49,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:49,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:49,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:18:49,055 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:18:49,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744106135] [2021-12-06 17:18:49,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744106135] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:49,055 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:49,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 17:18:49,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513207931] [2021-12-06 17:18:49,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:49,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 17:18:49,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:18:49,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 17:18:49,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 17:18:49,056 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:49,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:49,297 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2021-12-06 17:18:49,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 17:18:49,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-06 17:18:49,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:49,298 INFO L225 Difference]: With dead ends: 128 [2021-12-06 17:18:49,299 INFO L226 Difference]: Without dead ends: 128 [2021-12-06 17:18:49,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:18:49,299 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 104 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:49,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 121 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:18:49,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-12-06 17:18:49,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 108. [2021-12-06 17:18:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 85 states have (on average 1.423529411764706) internal successors, (121), 107 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2021-12-06 17:18:49,302 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 26 [2021-12-06 17:18:49,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:49,302 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2021-12-06 17:18:49,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2021-12-06 17:18:49,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 17:18:49,303 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:49,303 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:49,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-06 17:18:49,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:18:49,504 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:49,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:49,505 INFO L85 PathProgramCache]: Analyzing trace with hash -294673204, now seen corresponding path program 1 times [2021-12-06 17:18:49,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:18:49,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643037217] [2021-12-06 17:18:49,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:49,507 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:18:49,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:18:49,509 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:18:49,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-06 17:18:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:49,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-06 17:18:49,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:49,758 INFO L388 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 24 treesize of output 22 [2021-12-06 17:18:49,772 INFO L388 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 [2021-12-06 17:18:49,789 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:18:49,789 INFO L388 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 15 treesize of output 15 [2021-12-06 17:18:49,812 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 17:18:49,812 INFO L388 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 22 treesize of output 21 [2021-12-06 17:18:49,949 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:49,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 56 [2021-12-06 17:18:49,956 INFO L388 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 39 treesize of output 37 [2021-12-06 17:18:50,074 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:50,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2021-12-06 17:18:50,081 INFO L388 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 39 treesize of output 37 [2021-12-06 17:18:50,404 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:50,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 62 [2021-12-06 17:18:50,410 INFO L388 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 41 treesize of output 39 [2021-12-06 17:18:50,454 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:50,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2021-12-06 17:18:50,458 INFO L388 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 41 treesize of output 39 [2021-12-06 17:18:50,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:18:50,845 INFO L388 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 41 treesize of output 23 [2021-12-06 17:18:50,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2021-12-06 17:18:51,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:18:51,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:18:51,377 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:18:51,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643037217] [2021-12-06 17:18:51,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643037217] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:18:51,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:18:51,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-12-06 17:18:51,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748121173] [2021-12-06 17:18:51,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:18:51,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-06 17:18:51,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:18:51,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-06 17:18:51,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-12-06 17:18:51,378 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:59,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:59,011 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2021-12-06 17:18:59,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-06 17:18:59,011 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-06 17:18:59,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:59,012 INFO L225 Difference]: With dead ends: 148 [2021-12-06 17:18:59,012 INFO L226 Difference]: Without dead ends: 148 [2021-12-06 17:18:59,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=221, Invalid=1111, Unknown=0, NotChecked=0, Total=1332 [2021-12-06 17:18:59,013 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 399 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:59,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [399 Valid, 508 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2021-12-06 17:18:59,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-12-06 17:18:59,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 111. [2021-12-06 17:18:59,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 88 states have (on average 1.4090909090909092) internal successors, (124), 110 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:59,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2021-12-06 17:18:59,015 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 26 [2021-12-06 17:18:59,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:59,016 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2021-12-06 17:18:59,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:18:59,016 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2021-12-06 17:18:59,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-06 17:18:59,016 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:59,016 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:59,024 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2021-12-06 17:18:59,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:18:59,217 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:18:59,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:59,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1324582918, now seen corresponding path program 1 times [2021-12-06 17:18:59,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:18:59,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695131026] [2021-12-06 17:18:59,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:59,220 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:18:59,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:18:59,222 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:18:59,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-06 17:18:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:59,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-06 17:18:59,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:59,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-06 17:18:59,552 INFO L388 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 [2021-12-06 17:18:59,574 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:18:59,574 INFO L388 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 15 treesize of output 15 [2021-12-06 17:18:59,600 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 17:18:59,600 INFO L388 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 30 treesize of output 25 [2021-12-06 17:18:59,728 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:59,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2021-12-06 17:18:59,755 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:59,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2021-12-06 17:18:59,878 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:59,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 45 [2021-12-06 17:18:59,899 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:18:59,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2021-12-06 17:19:00,029 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-06 17:19:00,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2021-12-06 17:19:00,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:19:00,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:19:00,052 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:19:00,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695131026] [2021-12-06 17:19:00,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695131026] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:19:00,053 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:19:00,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-06 17:19:00,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25016918] [2021-12-06 17:19:00,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:19:00,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 17:19:00,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:19:00,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 17:19:00,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-12-06 17:19:00,054 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:01,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:19:01,514 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2021-12-06 17:19:01,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 17:19:01,515 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-06 17:19:01,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:19:01,515 INFO L225 Difference]: With dead ends: 135 [2021-12-06 17:19:01,515 INFO L226 Difference]: Without dead ends: 135 [2021-12-06 17:19:01,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2021-12-06 17:19:01,516 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 159 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:19:01,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 479 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-06 17:19:01,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-06 17:19:01,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 109. [2021-12-06 17:19:01,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 108 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:01,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2021-12-06 17:19:01,519 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 27 [2021-12-06 17:19:01,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:19:01,519 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2021-12-06 17:19:01,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:01,519 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2021-12-06 17:19:01,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-06 17:19:01,519 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:19:01,520 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:19:01,527 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-12-06 17:19:01,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:19:01,721 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:19:01,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:19:01,722 INFO L85 PathProgramCache]: Analyzing trace with hash -544882158, now seen corresponding path program 1 times [2021-12-06 17:19:01,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:19:01,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474392884] [2021-12-06 17:19:01,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:19:01,724 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:19:01,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:19:01,726 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:19:01,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-06 17:19:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:19:01,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 54 conjunts are in the unsatisfiable core [2021-12-06 17:19:01,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:19:01,921 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:19:01,927 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-06 17:19:01,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-12-06 17:19:01,951 INFO L388 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 [2021-12-06 17:19:01,983 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-12-06 17:19:01,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2021-12-06 17:19:02,008 INFO L388 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 13 treesize of output 9 [2021-12-06 17:19:02,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:19:02,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2021-12-06 17:19:02,289 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:19:02,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2021-12-06 17:19:02,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2021-12-06 17:19:02,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:19:02,417 INFO L354 Elim1Store]: treesize reduction 78, result has 17.9 percent of original size [2021-12-06 17:19:02,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 68 [2021-12-06 17:19:02,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:19:02,424 INFO L388 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 55 [2021-12-06 17:19:02,744 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 17:19:02,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 120 [2021-12-06 17:19:02,751 INFO L388 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 76 treesize of output 69 [2021-12-06 17:19:02,811 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 17:19:02,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 113 [2021-12-06 17:19:02,817 INFO L388 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 76 treesize of output 69 [2021-12-06 17:19:03,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:19:03,507 INFO L354 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2021-12-06 17:19:03,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 70 [2021-12-06 17:19:03,519 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-06 17:19:03,519 INFO L388 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 18 [2021-12-06 17:19:03,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:19:03,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:19:03,568 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:19:03,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474392884] [2021-12-06 17:19:03,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474392884] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:19:03,569 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:19:03,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-12-06 17:19:03,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310074513] [2021-12-06 17:19:03,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:19:03,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-06 17:19:03,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:19:03,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-06 17:19:03,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2021-12-06 17:19:03,570 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:05,789 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-06 17:19:07,850 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-06 17:19:09,967 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-06 17:19:13,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:19:13,698 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2021-12-06 17:19:13,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-06 17:19:13,699 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-06 17:19:13,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:19:13,699 INFO L225 Difference]: With dead ends: 118 [2021-12-06 17:19:13,699 INFO L226 Difference]: Without dead ends: 118 [2021-12-06 17:19:13,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=0, NotChecked=0, Total=1406 [2021-12-06 17:19:13,700 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 190 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 34 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2021-12-06 17:19:13,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 541 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 488 Invalid, 2 Unknown, 0 Unchecked, 7.5s Time] [2021-12-06 17:19:13,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-06 17:19:13,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2021-12-06 17:19:13,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 85 states have (on average 1.4) internal successors, (119), 107 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:13,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2021-12-06 17:19:13,703 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 27 [2021-12-06 17:19:13,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:19:13,703 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2021-12-06 17:19:13,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:13,703 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2021-12-06 17:19:13,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-06 17:19:13,703 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:19:13,703 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:19:13,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2021-12-06 17:19:13,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:19:13,904 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:19:13,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:19:13,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1365167937, now seen corresponding path program 1 times [2021-12-06 17:19:13,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:19:13,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564154717] [2021-12-06 17:19:13,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:19:13,907 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:19:13,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:19:13,909 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:19:13,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-06 17:19:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:19:14,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-06 17:19:14,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:19:14,099 INFO L388 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 28 treesize of output 26 [2021-12-06 17:19:14,120 INFO L388 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 [2021-12-06 17:19:14,124 INFO L388 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 [2021-12-06 17:19:14,151 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:19:14,151 INFO L388 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 15 treesize of output 15 [2021-12-06 17:19:14,180 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 17:19:14,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:19:14,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:19:14,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-06 17:19:14,325 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:19:14,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 43 [2021-12-06 17:19:14,329 INFO L388 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 18 treesize of output 20 [2021-12-06 17:19:14,355 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:19:14,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2021-12-06 17:19:14,359 INFO L388 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 18 treesize of output 20 [2021-12-06 17:19:14,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:19:14,413 INFO L388 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 37 treesize of output 15 [2021-12-06 17:19:14,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-06 17:19:14,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-06 17:19:14,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:19:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:19:14,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:19:14,584 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:19:14,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564154717] [2021-12-06 17:19:14,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564154717] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:19:14,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:19:14,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-06 17:19:14,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386825378] [2021-12-06 17:19:14,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:19:14,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-06 17:19:14,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:19:14,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-06 17:19:14,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-12-06 17:19:14,585 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:16,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:19:16,000 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2021-12-06 17:19:16,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 17:19:16,000 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-06 17:19:16,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:19:16,001 INFO L225 Difference]: With dead ends: 130 [2021-12-06 17:19:16,001 INFO L226 Difference]: Without dead ends: 130 [2021-12-06 17:19:16,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2021-12-06 17:19:16,002 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 143 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:19:16,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 650 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-06 17:19:16,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-06 17:19:16,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 111. [2021-12-06 17:19:16,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 110 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:16,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2021-12-06 17:19:16,004 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 29 [2021-12-06 17:19:16,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:19:16,004 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2021-12-06 17:19:16,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:16,004 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2021-12-06 17:19:16,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-06 17:19:16,005 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:19:16,005 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:19:16,013 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2021-12-06 17:19:16,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:19:16,206 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:19:16,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:19:16,207 INFO L85 PathProgramCache]: Analyzing trace with hash -629466722, now seen corresponding path program 1 times [2021-12-06 17:19:16,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:19:16,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013436504] [2021-12-06 17:19:16,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:19:16,209 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:19:16,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:19:16,211 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:19:16,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-06 17:19:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:19:16,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-06 17:19:16,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:19:16,403 INFO L388 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 22 treesize of output 20 [2021-12-06 17:19:16,428 INFO L388 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 [2021-12-06 17:19:16,460 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:19:16,460 INFO L388 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 14 treesize of output 14 [2021-12-06 17:19:16,492 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 17:19:16,492 INFO L388 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 29 treesize of output 24 [2021-12-06 17:19:16,657 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:19:16,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 40 [2021-12-06 17:19:16,686 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:19:16,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2021-12-06 17:19:16,810 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:19:16,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2021-12-06 17:19:16,840 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:19:16,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-06 17:19:17,035 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-06 17:19:17,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 15 [2021-12-06 17:19:17,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:19:17,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:19:17,109 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:19:17,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013436504] [2021-12-06 17:19:17,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013436504] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:19:17,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:19:17,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-06 17:19:17,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638226437] [2021-12-06 17:19:17,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:19:17,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-06 17:19:17,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:19:17,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-06 17:19:17,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-12-06 17:19:17,110 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:19:19,333 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2021-12-06 17:19:19,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 17:19:19,334 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-06 17:19:19,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:19:19,334 INFO L225 Difference]: With dead ends: 131 [2021-12-06 17:19:19,334 INFO L226 Difference]: Without dead ends: 131 [2021-12-06 17:19:19,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2021-12-06 17:19:19,335 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 143 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:19:19,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 519 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-06 17:19:19,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-12-06 17:19:19,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 112. [2021-12-06 17:19:19,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 111 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:19,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2021-12-06 17:19:19,338 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 30 [2021-12-06 17:19:19,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:19:19,338 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2021-12-06 17:19:19,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:19,338 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2021-12-06 17:19:19,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-06 17:19:19,338 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:19:19,338 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:19:19,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-12-06 17:19:19,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:19:19,540 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:19:19,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:19:19,541 INFO L85 PathProgramCache]: Analyzing trace with hash 826552754, now seen corresponding path program 1 times [2021-12-06 17:19:19,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:19:19,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287485649] [2021-12-06 17:19:19,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:19:19,543 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:19:19,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:19:19,545 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:19:19,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-06 17:19:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:19:19,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-06 17:19:19,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:19:19,771 INFO L388 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 22 treesize of output 20 [2021-12-06 17:19:19,785 INFO L388 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 [2021-12-06 17:19:19,804 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:19:19,804 INFO L388 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 15 treesize of output 15 [2021-12-06 17:19:19,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:19:19,833 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 17:19:19,834 INFO L388 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 22 treesize of output 21 [2021-12-06 17:19:19,978 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:19:19,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 54 [2021-12-06 17:19:19,983 INFO L388 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 18 treesize of output 20 [2021-12-06 17:19:20,051 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:19:20,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2021-12-06 17:19:20,056 INFO L388 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 26 treesize of output 26 [2021-12-06 17:19:20,306 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:19:20,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 63 [2021-12-06 17:19:20,312 INFO L388 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 28 treesize of output 28 [2021-12-06 17:19:20,357 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:19:20,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 56 [2021-12-06 17:19:20,362 INFO L388 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 28 treesize of output 28 [2021-12-06 17:19:20,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:19:20,666 INFO L388 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 42 treesize of output 24 [2021-12-06 17:19:20,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-12-06 17:19:21,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:19:21,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-06 17:19:21,331 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:19:21,331 INFO L388 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 19 treesize of output 19 [2021-12-06 17:19:21,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:19:21,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:19:21,477 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:19:21,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287485649] [2021-12-06 17:19:21,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287485649] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:19:21,477 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:19:21,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-12-06 17:19:21,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134167482] [2021-12-06 17:19:21,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:19:21,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-06 17:19:21,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:19:21,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-06 17:19:21,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2021-12-06 17:19:21,478 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:19:29,494 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2021-12-06 17:19:29,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-06 17:19:29,495 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-06 17:19:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:19:29,496 INFO L225 Difference]: With dead ends: 208 [2021-12-06 17:19:29,496 INFO L226 Difference]: Without dead ends: 208 [2021-12-06 17:19:29,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=262, Invalid=1460, Unknown=0, NotChecked=0, Total=1722 [2021-12-06 17:19:29,497 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 433 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:19:29,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [433 Valid, 678 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2021-12-06 17:19:29,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-12-06 17:19:29,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 108. [2021-12-06 17:19:29,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 107 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:29,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2021-12-06 17:19:29,499 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 30 [2021-12-06 17:19:29,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:19:29,499 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2021-12-06 17:19:29,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:29,500 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2021-12-06 17:19:29,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-06 17:19:29,500 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:19:29,500 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:19:29,508 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2021-12-06 17:19:29,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:19:29,701 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:19:29,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:19:29,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1961368291, now seen corresponding path program 1 times [2021-12-06 17:19:29,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:19:29,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964445532] [2021-12-06 17:19:29,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:19:29,703 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:19:29,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:19:29,704 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:19:29,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-06 17:19:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:19:29,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 17:19:29,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:19:29,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:19:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:19:29,859 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:19:29,859 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:19:29,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1964445532] [2021-12-06 17:19:29,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1964445532] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:19:29,859 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:19:29,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:19:29,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614683212] [2021-12-06 17:19:29,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:19:29,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:19:29,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:19:29,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:19:29,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:19:29,860 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:30,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:19:30,199 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2021-12-06 17:19:30,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 17:19:30,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-06 17:19:30,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:19:30,200 INFO L225 Difference]: With dead ends: 107 [2021-12-06 17:19:30,200 INFO L226 Difference]: Without dead ends: 107 [2021-12-06 17:19:30,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:19:30,201 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 9 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:19:30,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 258 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:19:30,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-06 17:19:30,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-12-06 17:19:30,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.303370786516854) internal successors, (116), 106 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:30,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2021-12-06 17:19:30,203 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 31 [2021-12-06 17:19:30,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:19:30,203 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2021-12-06 17:19:30,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:30,204 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2021-12-06 17:19:30,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-06 17:19:30,204 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:19:30,204 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:19:30,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-12-06 17:19:30,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:19:30,405 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:19:30,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:19:30,406 INFO L85 PathProgramCache]: Analyzing trace with hash -146668359, now seen corresponding path program 1 times [2021-12-06 17:19:30,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:19:30,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26041348] [2021-12-06 17:19:30,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:19:30,408 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:19:30,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:19:30,408 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:19:30,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-12-06 17:19:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:19:30,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:19:30,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:19:30,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:19:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:19:30,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:19:30,595 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:19:30,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26041348] [2021-12-06 17:19:30,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26041348] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:19:30,595 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:19:30,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 17:19:30,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934769977] [2021-12-06 17:19:30,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:19:30,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:19:30,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:19:30,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:19:30,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:19:30,596 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:30,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:19:30,758 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2021-12-06 17:19:30,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:19:30,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-06 17:19:30,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:19:30,759 INFO L225 Difference]: With dead ends: 123 [2021-12-06 17:19:30,759 INFO L226 Difference]: Without dead ends: 123 [2021-12-06 17:19:30,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:19:30,759 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 34 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:19:30,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 117 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:19:30,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-06 17:19:30,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2021-12-06 17:19:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 89 states have (on average 1.2696629213483146) internal successors, (113), 104 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2021-12-06 17:19:30,761 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 31 [2021-12-06 17:19:30,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:19:30,762 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2021-12-06 17:19:30,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2021-12-06 17:19:30,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-06 17:19:30,762 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:19:30,762 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:19:30,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2021-12-06 17:19:30,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:19:30,963 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:19:30,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:19:30,964 INFO L85 PathProgramCache]: Analyzing trace with hash -146668358, now seen corresponding path program 1 times [2021-12-06 17:19:30,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:19:30,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886102654] [2021-12-06 17:19:30,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:19:30,966 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:19:30,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:19:30,968 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:19:30,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-12-06 17:19:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:19:31,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 17:19:31,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:19:31,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:19:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:19:31,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:19:31,165 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:19:31,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886102654] [2021-12-06 17:19:31,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [886102654] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:19:31,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:19:31,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 17:19:31,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304795361] [2021-12-06 17:19:31,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:19:31,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:19:31,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:19:31,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:19:31,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:19:31,166 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:31,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:19:31,326 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2021-12-06 17:19:31,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:19:31,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-06 17:19:31,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:19:31,328 INFO L225 Difference]: With dead ends: 126 [2021-12-06 17:19:31,328 INFO L226 Difference]: Without dead ends: 126 [2021-12-06 17:19:31,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:19:31,329 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 37 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:19:31,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 123 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:19:31,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-06 17:19:31,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 103. [2021-12-06 17:19:31,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 102 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:31,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2021-12-06 17:19:31,331 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 31 [2021-12-06 17:19:31,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:19:31,331 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2021-12-06 17:19:31,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:31,331 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2021-12-06 17:19:31,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-06 17:19:31,331 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:19:31,331 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:19:31,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2021-12-06 17:19:31,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:19:31,532 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:19:31,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:19:31,532 INFO L85 PathProgramCache]: Analyzing trace with hash -146615681, now seen corresponding path program 1 times [2021-12-06 17:19:31,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:19:31,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056291548] [2021-12-06 17:19:31,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:19:31,532 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:19:31,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:19:31,533 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:19:31,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-12-06 17:19:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:19:31,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-06 17:19:31,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:19:31,734 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:19:31,740 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-06 17:19:31,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2021-12-06 17:19:31,775 INFO L388 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 [2021-12-06 17:19:31,781 INFO L388 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 [2021-12-06 17:19:31,817 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-12-06 17:19:31,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 33 [2021-12-06 17:19:31,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:19:31,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2021-12-06 17:19:31,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:19:31,871 INFO L388 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 21 treesize of output 20 [2021-12-06 17:19:32,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:19:32,161 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-06 17:19:32,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 61 [2021-12-06 17:19:32,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:19:32,169 INFO L388 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 46 [2021-12-06 17:19:32,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:19:32,270 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:19:32,282 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-06 17:19:32,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 76 [2021-12-06 17:19:32,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:19:32,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2021-12-06 17:19:32,634 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 17:19:32,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 88 [2021-12-06 17:19:32,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:19:32,648 INFO L388 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 51 treesize of output 48 [2021-12-06 17:19:32,716 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 17:19:32,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 81 [2021-12-06 17:19:32,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:19:32,728 INFO L388 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 51 treesize of output 48 [2021-12-06 17:19:33,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:19:33,721 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:19:33,741 INFO L354 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2021-12-06 17:19:33,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 126 treesize of output 69 [2021-12-06 17:19:33,759 INFO L354 Elim1Store]: treesize reduction 34, result has 17.1 percent of original size [2021-12-06 17:19:33,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 33 [2021-12-06 17:19:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:19:33,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:19:33,816 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:19:33,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056291548] [2021-12-06 17:19:33,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056291548] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:19:33,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:19:33,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-12-06 17:19:33,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299087330] [2021-12-06 17:19:33,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:19:33,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-06 17:19:33,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:19:33,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-06 17:19:33,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2021-12-06 17:19:33,817 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:37,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:19:37,301 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2021-12-06 17:19:37,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 17:19:37,302 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-06 17:19:37,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:19:37,302 INFO L225 Difference]: With dead ends: 105 [2021-12-06 17:19:37,302 INFO L226 Difference]: Without dead ends: 105 [2021-12-06 17:19:37,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=193, Invalid=1139, Unknown=0, NotChecked=0, Total=1332 [2021-12-06 17:19:37,303 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 71 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:19:37,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 569 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 360 Invalid, 0 Unknown, 84 Unchecked, 1.2s Time] [2021-12-06 17:19:37,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-06 17:19:37,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-12-06 17:19:37,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.2307692307692308) internal successors, (112), 104 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:37,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2021-12-06 17:19:37,305 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 31 [2021-12-06 17:19:37,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:19:37,306 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2021-12-06 17:19:37,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:37,306 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2021-12-06 17:19:37,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-06 17:19:37,306 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:19:37,306 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:19:37,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2021-12-06 17:19:37,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:19:37,506 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:19:37,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:19:37,507 INFO L85 PathProgramCache]: Analyzing trace with hash 672875045, now seen corresponding path program 1 times [2021-12-06 17:19:37,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:19:37,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029464795] [2021-12-06 17:19:37,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:19:37,507 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:19:37,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:19:37,508 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:19:37,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-12-06 17:19:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:19:37,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-06 17:19:37,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:19:37,671 INFO L388 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 22 treesize of output 20 [2021-12-06 17:19:37,686 INFO L388 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 [2021-12-06 17:19:37,703 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:19:37,703 INFO L388 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 17 treesize of output 17 [2021-12-06 17:19:37,727 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 17:19:37,727 INFO L388 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 22 treesize of output 21 [2021-12-06 17:19:37,844 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:19:37,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2021-12-06 17:19:37,865 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:19:37,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-06 17:19:37,976 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:19:37,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2021-12-06 17:19:38,004 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:19:38,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2021-12-06 17:19:38,186 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-06 17:19:38,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 12 [2021-12-06 17:19:38,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-06 17:19:38,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:19:38,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:19:38,491 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1410 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1410) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (_ bv1 1)))) is different from false [2021-12-06 17:19:38,499 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (_ bv1 1))) (forall ((v_ArrVal_1409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1410 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1409) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1410) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)))) is different from false [2021-12-06 17:19:38,509 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1410 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1409) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1410) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (_ bv1 1)))) is different from false [2021-12-06 17:19:38,515 INFO L388 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 9 treesize of output 7 [2021-12-06 17:19:38,521 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1410 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1410) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) is different from false [2021-12-06 17:19:38,533 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1410 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1408))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1410)) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-06 17:19:38,545 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1410 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1407) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1408))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1410)) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) is different from false [2021-12-06 17:19:38,561 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1410 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) v_ArrVal_1407) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1408))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1410)) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) is different from false [2021-12-06 17:19:38,572 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1410 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) v_ArrVal_1408))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) v_ArrVal_1410)) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) is different from false [2021-12-06 17:19:38,590 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1410 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (select (select (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse0 (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse2) (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) v_ArrVal_1408)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse1) v_ArrVal_1410))) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) is different from false [2021-12-06 17:19:38,799 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:19:38,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 58 [2021-12-06 17:19:38,822 INFO L354 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-06 17:19:38,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 79 [2021-12-06 17:19:38,833 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-06 17:19:38,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 549 treesize of output 403 [2021-12-06 17:19:38,852 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-06 17:19:38,853 INFO L388 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 184 treesize of output 156 [2021-12-06 17:19:38,858 INFO L388 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 156 treesize of output 148 [2021-12-06 17:19:38,873 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-06 17:19:38,873 INFO L388 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 16 treesize of output 15 [2021-12-06 17:19:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:19:38,913 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:19:38,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029464795] [2021-12-06 17:19:38,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029464795] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:19:38,913 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:19:38,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 29 [2021-12-06 17:19:38,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748398077] [2021-12-06 17:19:38,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:19:38,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-06 17:19:38,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:19:38,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-06 17:19:38,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=355, Unknown=21, NotChecked=414, Total=870 [2021-12-06 17:19:38,915 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:41,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:19:41,057 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2021-12-06 17:19:41,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-06 17:19:41,058 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-06 17:19:41,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:19:41,058 INFO L225 Difference]: With dead ends: 117 [2021-12-06 17:19:41,058 INFO L226 Difference]: Without dead ends: 117 [2021-12-06 17:19:41,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 32 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=182, Invalid=761, Unknown=23, NotChecked=594, Total=1560 [2021-12-06 17:19:41,059 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 109 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 743 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:19:41,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 667 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 587 Invalid, 0 Unknown, 743 Unchecked, 1.3s Time] [2021-12-06 17:19:41,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-06 17:19:41,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 106. [2021-12-06 17:19:41,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.2282608695652173) internal successors, (113), 105 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:41,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2021-12-06 17:19:41,061 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 32 [2021-12-06 17:19:41,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:19:41,061 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2021-12-06 17:19:41,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:41,061 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2021-12-06 17:19:41,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-06 17:19:41,062 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:19:41,062 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:19:41,070 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (32)] Ended with exit code 0 [2021-12-06 17:19:41,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:19:41,262 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:19:41,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:19:41,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1008206250, now seen corresponding path program 1 times [2021-12-06 17:19:41,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:19:41,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319952052] [2021-12-06 17:19:41,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:19:41,263 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:19:41,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:19:41,264 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:19:41,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-12-06 17:19:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:19:41,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 17:19:41,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:19:41,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 17:19:41,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:19:41,700 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:19:41,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319952052] [2021-12-06 17:19:41,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1319952052] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:19:41,700 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:19:41,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:19:41,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949193654] [2021-12-06 17:19:41,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:19:41,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:19:41,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:19:41,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:19:41,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:19:41,701 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:41,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:19:41,707 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2021-12-06 17:19:41,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:19:41,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-06 17:19:41,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:19:41,709 INFO L225 Difference]: With dead ends: 123 [2021-12-06 17:19:41,709 INFO L226 Difference]: Without dead ends: 123 [2021-12-06 17:19:41,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:19:41,709 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 36 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:19:41,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 221 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 32 Unchecked, 0.0s Time] [2021-12-06 17:19:41,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-06 17:19:41,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2021-12-06 17:19:41,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 106 states have (on average 1.2547169811320755) internal successors, (133), 119 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:41,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2021-12-06 17:19:41,711 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 35 [2021-12-06 17:19:41,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:19:41,711 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2021-12-06 17:19:41,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:19:41,712 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2021-12-06 17:19:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-06 17:19:41,712 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:19:41,712 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:19:41,719 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (33)] Ended with exit code 0 [2021-12-06 17:19:41,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:19:41,912 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-12-06 17:19:41,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:19:41,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1775286990, now seen corresponding path program 1 times [2021-12-06 17:19:41,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:19:41,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805636532] [2021-12-06 17:19:41,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:19:41,913 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:19:41,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:19:41,914 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:19:41,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2021-12-06 17:19:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:19:42,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 55 conjunts are in the unsatisfiable core [2021-12-06 17:19:42,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:19:42,100 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-06 17:19:42,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2021-12-06 17:19:42,121 INFO L388 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 [2021-12-06 17:19:42,161 INFO L354 Elim1Store]: treesize reduction 42, result has 44.0 percent of original size [2021-12-06 17:19:42,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 56 [2021-12-06 17:19:42,209 INFO L388 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 6 treesize of output 5 [2021-12-06 17:19:42,224 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 17:19:42,224 INFO L388 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 44 treesize of output 35 [2021-12-06 17:19:42,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:19:42,674 INFO L354 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2021-12-06 17:19:42,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 74 [2021-12-06 17:19:42,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2021-12-06 17:19:42,844 INFO L354 Elim1Store]: treesize reduction 162, result has 14.7 percent of original size [2021-12-06 17:19:42,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 91 [2021-12-06 17:19:42,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2021-12-06 17:19:43,248 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 17:19:43,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 130 [2021-12-06 17:19:43,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2021-12-06 17:19:43,369 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 17:19:43,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 119 [2021-12-06 17:19:43,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2021-12-06 17:19:44,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2021-12-06 17:19:44,495 INFO L354 Elim1Store]: treesize reduction 82, result has 17.2 percent of original size [2021-12-06 17:19:44,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 129 treesize of output 88 [2021-12-06 17:19:44,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 79 treesize of output 82 [2021-12-06 17:19:45,124 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-06 17:19:45,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 30 [2021-12-06 17:19:45,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:19:45,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:19:46,171 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1533 (_ BitVec 1))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1530) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1529))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (select (store |c_#valid| .cse0 v_ArrVal_1533) (select (select .cse1 .cse0) .cse2)))))))))) (_ bv1 1))) (not (= .cse2 (_ bv0 32)))))) is different from false [2021-12-06 17:19:46,197 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1528 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1533 (_ BitVec 1)) (v_ArrVal_1527 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1528) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1530) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (or (not (= (_ bv0 32) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1527) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1529))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (select (store |c_#valid| .cse1 v_ArrVal_1533) (select (select .cse2 .cse1) .cse0))))))))))) (_ bv1 1)))))) is different from false [2021-12-06 17:19:46,224 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1528 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1533 (_ BitVec 1)) (v_ArrVal_1527 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1528) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1530) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (or (not (= (_ bv0 32) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1527) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_1529))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (select (store |c_#valid| .cse1 v_ArrVal_1533) (select (select .cse2 .cse1) .cse0))))))))))) (_ bv1 1))))))) is different from false [2021-12-06 17:19:46,245 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1533 (_ BitVec 1))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1530) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (or (not (= .cse0 (_ bv0 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1529))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (select (store |c_#valid| .cse1 v_ArrVal_1533) (select (select .cse2 .cse1) .cse0))))))))))))) (_ bv1 1))))))) is different from false [2021-12-06 17:19:46,293 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1526 (_ BitVec 32)) (v_ArrVal_1533 (_ BitVec 1)) (v_ArrVal_1524 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset|) v_ArrVal_1526)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1524) .cse4 v_ArrVal_1530) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (or (not (= .cse0 (_ bv0 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (let ((.cse2 (store .cse3 .cse4 v_ArrVal_1529))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (select (store |c_#valid| .cse1 v_ArrVal_1533) (select (select .cse2 .cse1) .cse0))))))))))))))) (_ bv1 1)))))))) is different from false [2021-12-06 17:19:46,361 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1526 (_ BitVec 32)) (v_ArrVal_1522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1533 (_ BitVec 1)) (v_ArrVal_1524 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|)))) (store .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset|) v_ArrVal_1526))))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) (let ((.cse2 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1522) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1524) .cse4 v_ArrVal_1530) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (let ((.cse1 (store .cse3 .cse4 v_ArrVal_1529))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (select (store |c_#valid| .cse0 v_ArrVal_1533) (select (select .cse1 .cse0) .cse2)))))))))))))))) (_ bv1 1))) (not (= .cse2 (_ bv0 32)))))))) is different from false [2021-12-06 17:19:46,416 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1526 (_ BitVec 32)) (v_ArrVal_1522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1533 (_ BitVec 1)) (v_ArrVal_1524 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse3 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))))) (store .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset|) v_ArrVal_1526))))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (let ((.cse0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1522) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1524) .cse4 v_ArrVal_1530) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (or (not (= .cse0 (_ bv0 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (let ((.cse2 (store .cse3 .cse4 v_ArrVal_1529))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (select (store |c_#valid| .cse1 v_ArrVal_1533) (select (select .cse2 .cse1) .cse0))))))))))))))))))) (_ bv1 1))))))))) is different from false [2021-12-06 17:19:46,593 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1526 (_ BitVec 32)) (v_ArrVal_1522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1533 (_ BitVec 1)) (v_ArrVal_1524 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) (.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse3 (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) (select .cse8 .cse6))))) (store .cse7 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse7 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset|) v_ArrVal_1526))))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse6))) (let ((.cse2 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_1522) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1524) .cse4 v_ArrVal_1530) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (let ((.cse1 (store .cse3 .cse4 v_ArrVal_1529))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (select (store |c_#valid| .cse0 v_ArrVal_1533) (select (select .cse1 .cse0) .cse2)))))))))))))))))))) (_ bv1 1))) (not (= .cse2 (_ bv0 32)))))))))) is different from false [2021-12-06 17:19:46,650 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1526 (_ BitVec 32)) (v_ArrVal_1533 (_ BitVec 1)) (v_ArrVal_1524 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) (.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse5 (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (store (store (select |c_#memory_$Pointer$.base| .cse5) .cse7 (select .cse8 .cse6)) (bvadd (_ bv4 32) .cse7) v_ArrVal_1526))))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse6))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_1524) .cse4 v_ArrVal_1530) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (or (not (= (_ bv0 32) .cse0)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (let ((.cse2 (store .cse3 .cse4 v_ArrVal_1529))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (select (store |c_#valid| .cse1 v_ArrVal_1533) (select (select .cse2 .cse1) .cse0)))))))))))))))))))))) (_ bv1 1)))))))))) is different from false [2021-12-06 17:19:46,702 INFO L388 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 4264 treesize of output 4016 [2021-12-06 17:19:46,708 INFO L388 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 4016 treesize of output 4008 [2021-12-06 17:19:46,714 INFO L388 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 4008 treesize of output 3992 [2021-12-06 17:19:51,520 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1526 (_ BitVec 32)) (v_ArrVal_1533 (_ BitVec 1)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse2 (let ((.cse7 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse7)) (.cse6 (select .cse7 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (store .cse5 .cse6 (store (store (select .cse5 .cse6) v_arrayElimCell_273 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|) (bvadd v_arrayElimCell_273 (_ bv4 32)) v_ArrVal_1526)))))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (or (= (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (let ((.cse1 (store .cse2 .cse3 v_ArrVal_1529))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (select (store |c_#valid| .cse0 v_ArrVal_1533) (select (select .cse1 .cse0) (_ bv0 32))))))))))))))))))))))))) (_ bv1 1)) (_ bv0 1)) (not (= .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))))))) (forall ((v_ArrVal_1529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1526 (_ BitVec 32)) (v_ArrVal_1533 (_ BitVec 1)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse17 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse19 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse17 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))) (let ((.cse15 (select .cse19 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse16 (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse19))) (store .cse18 .cse15 (store (store (select .cse18 .cse15) v_arrayElimCell_273 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|) (bvadd v_arrayElimCell_273 (_ bv4 32)) v_ArrVal_1526))))) (let ((.cse12 (select (select .cse16 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse17))) (let ((.cse13 (store .cse16 .cse12 v_ArrVal_1529))) (let ((.cse8 (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse15)) (.cse14 (select (select .cse13 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse9 (store |c_#valid| .cse14 v_ArrVal_1533)) (.cse10 (select .cse13 .cse14)) (.cse11 (not .cse8))) (or (and (or .cse8 (not (= v_arrayElimCell_273 (_ bv0 32)))) (or (= (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select .cse9 (select .cse10 (_ bv0 32)))))))))))))))))))))))) (_ bv1 1)) (_ bv0 1)) .cse11)) (= .cse12 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select .cse9 (select .cse10 v_arrayElimCell_273))))))))))))))))))))) (_ bv1 1))) .cse11)))))))))))) is different from false [2021-12-06 17:20:05,833 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1517 (_ BitVec 1)) (|v_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base_9| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvadd (bvneg (bvneg v_ArrVal_1517)) (_ bv1 1)))) (and (forall ((v_ArrVal_1529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1526 (_ BitVec 32)) (v_ArrVal_1533 (_ BitVec 1)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse9 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse11 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse9 |v_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base_9|))) (let ((.cse7 (select .cse11 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse8 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse11))) (store .cse10 .cse7 (store (store (select .cse10 .cse7) v_arrayElimCell_273 |v_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base_9|) (bvadd v_arrayElimCell_273 (_ bv4 32)) v_ArrVal_1526))))) (let ((.cse3 (select (select .cse8 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse9))) (let ((.cse5 (store .cse8 .cse3 v_ArrVal_1529))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) (.cse4 (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse7))) (let ((.cse0 (not .cse4)) (.cse1 (store (store |c_#valid| |v_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base_9| v_ArrVal_1517) .cse6 v_ArrVal_1533)) (.cse2 (select .cse5 .cse6))) (or (and .cse0 (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select .cse1 (select .cse2 v_arrayElimCell_273)))))))))))))))))))))))) (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse3) (and (or .cse4 (not (= v_arrayElimCell_273 (_ bv0 32)))) (or .cse0 (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select .cse1 (select .cse2 (_ bv0 32)))))))))))))))))))))))))))))))))))))) (forall ((v_ArrVal_1529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1526 (_ BitVec 32)) (v_ArrVal_1533 (_ BitVec 1)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse16 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse14 (let ((.cse19 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse16 |v_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base_9|))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse19)) (.cse18 (select .cse19 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (store .cse17 .cse18 (store (store (select .cse17 .cse18) v_arrayElimCell_273 |v_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base_9|) (bvadd v_arrayElimCell_273 (_ bv4 32)) v_ArrVal_1526)))))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse16))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (let ((.cse13 (store .cse14 .cse15 v_ArrVal_1529))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (select (store (store |c_#valid| |v_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base_9| v_ArrVal_1517) .cse12 v_ArrVal_1533) (select (select .cse13 .cse12) (_ bv0 32)))))))))))))))))))))))))))) (not (= |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| .cse15)))))))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base_9|))))))) is different from false [2021-12-06 17:20:06,014 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:20:06,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1787 treesize of output 1250 [2021-12-06 17:20:06,267 INFO L354 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-06 17:20:06,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 1467 treesize of output 1465 [2021-12-06 17:20:06,277 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:20:06,281 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:20:07,115 INFO L354 Elim1Store]: treesize reduction 266, result has 33.3 percent of original size [2021-12-06 17:20:07,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 25 case distinctions, treesize of input 1615 treesize of output 1358 [2021-12-06 17:20:07,135 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:20:07,483 INFO L354 Elim1Store]: treesize reduction 10, result has 78.7 percent of original size [2021-12-06 17:20:07,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 1546 treesize of output 1566 [2021-12-06 17:20:07,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:20:07,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:20:08,243 INFO L354 Elim1Store]: treesize reduction 26, result has 67.9 percent of original size [2021-12-06 17:20:08,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 1805 treesize of output 1827 [2021-12-06 17:20:08,307 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:20:08,311 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:20:09,176 INFO L354 Elim1Store]: treesize reduction 26, result has 67.9 percent of original size [2021-12-06 17:20:09,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 2287 treesize of output 2277 [2021-12-06 17:20:09,266 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:20:09,831 INFO L354 Elim1Store]: treesize reduction 10, result has 78.7 percent of original size [2021-12-06 17:20:09,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 2638 treesize of output 2640 [2021-12-06 17:20:09,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2640 treesize of output 2634 [2021-12-06 17:20:10,100 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:20:10,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805636532] [2021-12-06 17:20:10,101 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-12-06 17:20:10,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1103571885] [2021-12-06 17:20:10,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:20:10,101 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 17:20:10,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 17:20:10,102 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 17:20:10,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2021-12-06 17:20:10,268 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@3fbea091 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:119) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:274) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1226) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:388) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-06 17:20:10,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630397527] [2021-12-06 17:20:10,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:20:10,269 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:20:10,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:20:10,270 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:20:10,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-12-06 17:20:10,321 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@3fbea091 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:119) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:274) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1226) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:388) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-06 17:20:10,321 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:20:10,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-12-06 17:20:10,321 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-12-06 17:20:10,322 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-12-06 17:20:10,326 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION (64 of 65 remaining) [2021-12-06 17:20:10,327 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (63 of 65 remaining) [2021-12-06 17:20:10,327 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (62 of 65 remaining) [2021-12-06 17:20:10,327 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (61 of 65 remaining) [2021-12-06 17:20:10,327 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (60 of 65 remaining) [2021-12-06 17:20:10,327 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (59 of 65 remaining) [2021-12-06 17:20:10,327 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (58 of 65 remaining) [2021-12-06 17:20:10,327 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (57 of 65 remaining) [2021-12-06 17:20:10,327 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (56 of 65 remaining) [2021-12-06 17:20:10,327 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (55 of 65 remaining) [2021-12-06 17:20:10,327 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (54 of 65 remaining) [2021-12-06 17:20:10,327 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (53 of 65 remaining) [2021-12-06 17:20:10,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (52 of 65 remaining) [2021-12-06 17:20:10,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (51 of 65 remaining) [2021-12-06 17:20:10,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (50 of 65 remaining) [2021-12-06 17:20:10,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (49 of 65 remaining) [2021-12-06 17:20:10,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (48 of 65 remaining) [2021-12-06 17:20:10,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (47 of 65 remaining) [2021-12-06 17:20:10,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (46 of 65 remaining) [2021-12-06 17:20:10,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (45 of 65 remaining) [2021-12-06 17:20:10,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (44 of 65 remaining) [2021-12-06 17:20:10,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (43 of 65 remaining) [2021-12-06 17:20:10,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (42 of 65 remaining) [2021-12-06 17:20:10,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (41 of 65 remaining) [2021-12-06 17:20:10,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (40 of 65 remaining) [2021-12-06 17:20:10,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (39 of 65 remaining) [2021-12-06 17:20:10,328 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (38 of 65 remaining) [2021-12-06 17:20:10,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (37 of 65 remaining) [2021-12-06 17:20:10,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (36 of 65 remaining) [2021-12-06 17:20:10,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (35 of 65 remaining) [2021-12-06 17:20:10,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (34 of 65 remaining) [2021-12-06 17:20:10,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (33 of 65 remaining) [2021-12-06 17:20:10,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (32 of 65 remaining) [2021-12-06 17:20:10,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (31 of 65 remaining) [2021-12-06 17:20:10,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (30 of 65 remaining) [2021-12-06 17:20:10,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (29 of 65 remaining) [2021-12-06 17:20:10,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (28 of 65 remaining) [2021-12-06 17:20:10,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (27 of 65 remaining) [2021-12-06 17:20:10,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (26 of 65 remaining) [2021-12-06 17:20:10,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (25 of 65 remaining) [2021-12-06 17:20:10,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (24 of 65 remaining) [2021-12-06 17:20:10,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (23 of 65 remaining) [2021-12-06 17:20:10,329 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (22 of 65 remaining) [2021-12-06 17:20:10,330 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (21 of 65 remaining) [2021-12-06 17:20:10,330 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (20 of 65 remaining) [2021-12-06 17:20:10,330 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION (19 of 65 remaining) [2021-12-06 17:20:10,330 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (18 of 65 remaining) [2021-12-06 17:20:10,330 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (17 of 65 remaining) [2021-12-06 17:20:10,330 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (16 of 65 remaining) [2021-12-06 17:20:10,330 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION (15 of 65 remaining) [2021-12-06 17:20:10,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (14 of 65 remaining) [2021-12-06 17:20:10,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION (13 of 65 remaining) [2021-12-06 17:20:10,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION (12 of 65 remaining) [2021-12-06 17:20:10,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION (11 of 65 remaining) [2021-12-06 17:20:10,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION (10 of 65 remaining) [2021-12-06 17:20:10,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (9 of 65 remaining) [2021-12-06 17:20:10,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION (8 of 65 remaining) [2021-12-06 17:20:10,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION (7 of 65 remaining) [2021-12-06 17:20:10,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE (6 of 65 remaining) [2021-12-06 17:20:10,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE (5 of 65 remaining) [2021-12-06 17:20:10,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE (4 of 65 remaining) [2021-12-06 17:20:10,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE (3 of 65 remaining) [2021-12-06 17:20:10,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE (2 of 65 remaining) [2021-12-06 17:20:10,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (1 of 65 remaining) [2021-12-06 17:20:10,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK (0 of 65 remaining) [2021-12-06 17:20:10,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (34)] Ended with exit code 0 [2021-12-06 17:20:10,534 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2021-12-06 17:20:10,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-12-06 17:20:10,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:20:10,943 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:20:10,951 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 17:20:10,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:20:10 BoogieIcfgContainer [2021-12-06 17:20:10,979 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 17:20:10,980 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 17:20:10,980 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 17:20:10,980 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 17:20:10,980 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:18:18" (3/4) ... [2021-12-06 17:20:10,983 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-06 17:20:10,983 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 17:20:10,984 INFO L158 Benchmark]: Toolchain (without parser) took 113293.81ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 38.0MB in the beginning and 48.5MB in the end (delta: -10.6MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2021-12-06 17:20:10,984 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 58.7MB. Free memory was 40.0MB in the beginning and 39.9MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:20:10,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.28ms. Allocated memory is still 58.7MB. Free memory was 37.8MB in the beginning and 33.6MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-06 17:20:10,984 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.51ms. Allocated memory is still 58.7MB. Free memory was 33.6MB in the beginning and 31.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:20:10,984 INFO L158 Benchmark]: Boogie Preprocessor took 27.14ms. Allocated memory is still 58.7MB. Free memory was 31.3MB in the beginning and 29.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:20:10,985 INFO L158 Benchmark]: RCFGBuilder took 620.95ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 29.2MB in the beginning and 41.9MB in the end (delta: -12.7MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2021-12-06 17:20:10,985 INFO L158 Benchmark]: TraceAbstraction took 112292.82ms. Allocated memory is still 75.5MB. Free memory was 41.3MB in the beginning and 49.2MB in the end (delta: -7.9MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2021-12-06 17:20:10,985 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 75.5MB. Free memory was 49.2MB in the beginning and 48.5MB in the end (delta: 694.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:20:10,986 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.12ms. Allocated memory is still 58.7MB. Free memory was 40.0MB in the beginning and 39.9MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.28ms. Allocated memory is still 58.7MB. Free memory was 37.8MB in the beginning and 33.6MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.51ms. Allocated memory is still 58.7MB. Free memory was 33.6MB in the beginning and 31.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.14ms. Allocated memory is still 58.7MB. Free memory was 31.3MB in the beginning and 29.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 620.95ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 29.2MB in the beginning and 41.9MB in the end (delta: -12.7MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * TraceAbstraction took 112292.82ms. Allocated memory is still 75.5MB. Free memory was 41.3MB in the beginning and 49.2MB in the end (delta: -7.9MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 75.5MB. Free memory was 49.2MB in the beginning and 48.5MB in the end (delta: 694.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 567]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L574] CALL, EXPR create_sl_with_head_and_tail() [L537] struct sl *sl = malloc(sizeof(*sl)); [L538] sl->head = malloc(sizeof(struct sl_item)) [L539] sl->tail = malloc(sizeof(struct sl_item)) [L540] EXPR sl->head [L540] EXPR sl->head [L540] EXPR sl->tail [L540] EXPR sl->head->n1 = sl->tail [L540] sl->head->n2 = sl->head->n1 = sl->tail [L541] EXPR sl->tail [L541] EXPR sl->tail [L541] EXPR sl->tail->n1 = ((void *)0) [L541] sl->tail->n2 = sl->tail->n1 = ((void *)0) [L542] return sl; [L574] RET, EXPR create_sl_with_head_and_tail() [L574] struct sl *sl = create_sl_with_head_and_tail(); [L575] COND FALSE !(__VERIFIER_nondet_int()) [L577] CALL destroy_sl(sl) [L564] struct sl_item *tmp; [L565] sl->head [L565] COND TRUE sl->head [L566] EXPR sl->head [L566] tmp = sl->head [L567] EXPR sl->head [L567] EXPR sl->head->n1 [L567] sl->head = sl->head->n1 [L568] free(tmp) [L568] free(tmp) [L568] free(tmp) [L565] sl->head [L565] COND TRUE sl->head [L566] EXPR sl->head [L566] tmp = sl->head [L567] EXPR sl->head [L567] sl->head->n1 - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 559]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 559]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 566]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 566]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 567]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 567]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 567]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 567]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 567]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 65 error locations. Started 1 CEGAR loops. OverallTime: 112.2s, OverallIterations: 33, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 55.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 4700 SdHoareTripleChecker+Valid, 34.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4700 mSDsluCounter, 11038 SdHoareTripleChecker+Invalid, 31.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 896 IncrementalHoareTripleChecker+Unchecked, 8823 mSDsCounter, 481 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9270 IncrementalHoareTripleChecker+Invalid, 10649 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 481 mSolverCounterUnsat, 2215 mSDtfsCounter, 9270 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 922 GetRequests, 415 SyntacticMatches, 14 SemanticMatches, 493 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2337 ImplicationChecksByTransitivity, 28.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=0, InterpolantAutomatonStates: 363, 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, 32 MinimizatonAttempts, 614 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 44.6s InterpolantComputationTime, 735 NumberOfCodeBlocks, 735 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 733 ConstructedInterpolants, 108 QuantifiedInterpolants, 18136 SizeOfPredicates, 365 NumberOfNonLiveVariables, 5184 ConjunctsInSsa, 739 ConjunctsInUnsatCore, 34 InterpolantComputations, 31 PerfectInterpolantSequences, 4/12 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 could not prove your program: unable to determine feasibility of some traces [2021-12-06 17:20:11,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1de9f9fe-aace-4604-a73a-cf09bca5d83a/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN