./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.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_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/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_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/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_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/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 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 21:50:35,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 21:50:35,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 21:50:35,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 21:50:35,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 21:50:35,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 21:50:35,367 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 21:50:35,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 21:50:35,372 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 21:50:35,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 21:50:35,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 21:50:35,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 21:50:35,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 21:50:35,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 21:50:35,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 21:50:35,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 21:50:35,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 21:50:35,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 21:50:35,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 21:50:35,386 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 21:50:35,388 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 21:50:35,389 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 21:50:35,391 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 21:50:35,392 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 21:50:35,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 21:50:35,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 21:50:35,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 21:50:35,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 21:50:35,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 21:50:35,399 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 21:50:35,399 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 21:50:35,400 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 21:50:35,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 21:50:35,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 21:50:35,404 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 21:50:35,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 21:50:35,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 21:50:35,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 21:50:35,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 21:50:35,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 21:50:35,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 21:50:35,407 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-06 21:50:35,430 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 21:50:35,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 21:50:35,431 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 21:50:35,431 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 21:50:35,431 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 21:50:35,432 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 21:50:35,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 21:50:35,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 21:50:35,432 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 21:50:35,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 21:50:35,433 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 21:50:35,433 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-06 21:50:35,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 21:50:35,433 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 21:50:35,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 21:50:35,433 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-06 21:50:35,433 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-06 21:50:35,433 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-06 21:50:35,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 21:50:35,433 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-06 21:50:35,434 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 21:50:35,434 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 21:50:35,434 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 21:50:35,434 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 21:50:35,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 21:50:35,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 21:50:35,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 21:50:35,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 21:50:35,435 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 21:50:35,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 21:50:35,435 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 21:50:35,435 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_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/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_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/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 -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2021-12-06 21:50:35,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 21:50:35,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 21:50:35,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 21:50:35,637 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 21:50:35,638 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 21:50:35,639 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2021-12-06 21:50:35,679 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/data/e07755c1d/33493bf60639444bab07aae3baf43fcc/FLAG47189e1fb [2021-12-06 21:50:36,129 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 21:50:36,129 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2021-12-06 21:50:36,139 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/data/e07755c1d/33493bf60639444bab07aae3baf43fcc/FLAG47189e1fb [2021-12-06 21:50:36,151 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/data/e07755c1d/33493bf60639444bab07aae3baf43fcc [2021-12-06 21:50:36,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 21:50:36,154 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 21:50:36,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 21:50:36,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 21:50:36,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 21:50:36,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 09:50:36" (1/1) ... [2021-12-06 21:50:36,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2124031d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:50:36, skipping insertion in model container [2021-12-06 21:50:36,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 09:50:36" (1/1) ... [2021-12-06 21:50:36,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 21:50:36,202 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 21:50:36,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2021-12-06 21:50:36,395 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 21:50:36,403 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 21:50:36,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2021-12-06 21:50:36,442 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 21:50:36,467 INFO L208 MainTranslator]: Completed translation [2021-12-06 21:50:36,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:50:36 WrapperNode [2021-12-06 21:50:36,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 21:50:36,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 21:50:36,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 21:50:36,469 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 21:50:36,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:50:36" (1/1) ... [2021-12-06 21:50:36,488 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:50:36" (1/1) ... [2021-12-06 21:50:36,510 INFO L137 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2021-12-06 21:50:36,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 21:50:36,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 21:50:36,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 21:50:36,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 21:50:36,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:50:36" (1/1) ... [2021-12-06 21:50:36,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:50:36" (1/1) ... [2021-12-06 21:50:36,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:50:36" (1/1) ... [2021-12-06 21:50:36,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:50:36" (1/1) ... [2021-12-06 21:50:36,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:50:36" (1/1) ... [2021-12-06 21:50:36,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:50:36" (1/1) ... [2021-12-06 21:50:36,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:50:36" (1/1) ... [2021-12-06 21:50:36,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 21:50:36,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 21:50:36,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 21:50:36,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 21:50:36,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:50:36" (1/1) ... [2021-12-06 21:50:36,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 21:50:36,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:50:36,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 21:50:36,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 21:50:36,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-06 21:50:36,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 21:50:36,614 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-06 21:50:36,614 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-06 21:50:36,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 21:50:36,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 21:50:36,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-06 21:50:36,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-06 21:50:36,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 21:50:36,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 21:50:36,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 21:50:36,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 21:50:36,697 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 21:50:36,698 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 21:50:36,919 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 21:50:36,926 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 21:50:36,926 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-06 21:50:36,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 09:50:36 BoogieIcfgContainer [2021-12-06 21:50:36,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 21:50:36,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 21:50:36,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 21:50:36,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 21:50:36,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 09:50:36" (1/3) ... [2021-12-06 21:50:36,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42695701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 09:50:36, skipping insertion in model container [2021-12-06 21:50:36,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:50:36" (2/3) ... [2021-12-06 21:50:36,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42695701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 09:50:36, skipping insertion in model container [2021-12-06 21:50:36,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 09:50:36" (3/3) ... [2021-12-06 21:50:36,936 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2021-12-06 21:50:36,942 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 21:50:36,942 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2021-12-06 21:50:36,975 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 21:50:36,981 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 21:50:36,982 INFO L340 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2021-12-06 21:50:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:50:37,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-06 21:50:37,002 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:50:37,003 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-06 21:50:37,003 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:50:37,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:37,009 INFO L85 PathProgramCache]: Analyzing trace with hash 894505749, now seen corresponding path program 1 times [2021-12-06 21:50:37,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:37,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240901113] [2021-12-06 21:50:37,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:37,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:37,148 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 21:50:37,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:37,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240901113] [2021-12-06 21:50:37,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240901113] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:50:37,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:50:37,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 21:50:37,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026322018] [2021-12-06 21:50:37,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:50:37,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 21:50:37,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:37,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 21:50:37,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 21:50:37,177 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:50:37,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:50:37,245 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2021-12-06 21:50:37,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 21:50:37,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-06 21:50:37,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:50:37,255 INFO L225 Difference]: With dead ends: 81 [2021-12-06 21:50:37,255 INFO L226 Difference]: Without dead ends: 78 [2021-12-06 21:50:37,257 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 21:50:37,260 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:50:37,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 135 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:50:37,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-06 21:50:37,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-12-06 21:50:37,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:50:37,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2021-12-06 21:50:37,300 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2021-12-06 21:50:37,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:50:37,300 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2021-12-06 21:50:37,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:50:37,300 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2021-12-06 21:50:37,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-06 21:50:37,301 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:50:37,301 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-06 21:50:37,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 21:50:37,301 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:50:37,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:37,302 INFO L85 PathProgramCache]: Analyzing trace with hash 894505750, now seen corresponding path program 1 times [2021-12-06 21:50:37,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:37,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337561823] [2021-12-06 21:50:37,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:37,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:37,352 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 21:50:37,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:37,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337561823] [2021-12-06 21:50:37,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337561823] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:50:37,353 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:50:37,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 21:50:37,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412526459] [2021-12-06 21:50:37,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:50:37,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 21:50:37,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:37,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 21:50:37,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 21:50:37,356 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:50:37,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:50:37,393 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2021-12-06 21:50:37,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 21:50:37,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-06 21:50:37,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:50:37,395 INFO L225 Difference]: With dead ends: 76 [2021-12-06 21:50:37,395 INFO L226 Difference]: Without dead ends: 76 [2021-12-06 21:50:37,395 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 21:50:37,397 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:50:37,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:50:37,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-06 21:50:37,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-12-06 21:50:37,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:50:37,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-12-06 21:50:37,407 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 6 [2021-12-06 21:50:37,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:50:37,408 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-12-06 21:50:37,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:50:37,408 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-12-06 21:50:37,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-06 21:50:37,409 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:50:37,409 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:50:37,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 21:50:37,410 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:50:37,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:37,410 INFO L85 PathProgramCache]: Analyzing trace with hash -835957545, now seen corresponding path program 1 times [2021-12-06 21:50:37,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:37,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651141302] [2021-12-06 21:50:37,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:37,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:37,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:50:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:37,475 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 21:50:37,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:37,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651141302] [2021-12-06 21:50:37,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651141302] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:50:37,476 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:50:37,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 21:50:37,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281873291] [2021-12-06 21:50:37,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:50:37,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 21:50:37,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:37,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 21:50:37,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 21:50:37,477 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 21:50:37,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:50:37,529 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2021-12-06 21:50:37,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 21:50:37,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-12-06 21:50:37,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:50:37,531 INFO L225 Difference]: With dead ends: 83 [2021-12-06 21:50:37,531 INFO L226 Difference]: Without dead ends: 83 [2021-12-06 21:50:37,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 21:50:37,532 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:50:37,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:50:37,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-06 21:50:37,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2021-12-06 21:50:37,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:50:37,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2021-12-06 21:50:37,540 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 13 [2021-12-06 21:50:37,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:50:37,540 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2021-12-06 21:50:37,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 21:50:37,541 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2021-12-06 21:50:37,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-06 21:50:37,541 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:50:37,541 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:50:37,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 21:50:37,542 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:50:37,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:37,542 INFO L85 PathProgramCache]: Analyzing trace with hash -125034980, now seen corresponding path program 1 times [2021-12-06 21:50:37,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:37,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405273692] [2021-12-06 21:50:37,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:37,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:37,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:50:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:37,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:50:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 21:50:37,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:37,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405273692] [2021-12-06 21:50:37,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405273692] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:50:37,653 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:50:37,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 21:50:37,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476054327] [2021-12-06 21:50:37,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:50:37,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 21:50:37,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:37,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 21:50:37,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:50:37,654 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:50:37,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:50:37,756 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2021-12-06 21:50:37,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 21:50:37,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-12-06 21:50:37,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:50:37,759 INFO L225 Difference]: With dead ends: 97 [2021-12-06 21:50:37,760 INFO L226 Difference]: Without dead ends: 97 [2021-12-06 21:50:37,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-06 21:50:37,761 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 69 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:50:37,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 268 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:50:37,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-06 21:50:37,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2021-12-06 21:50:37,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:50:37,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-12-06 21:50:37,767 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2021-12-06 21:50:37,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:50:37,768 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-12-06 21:50:37,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:50:37,768 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-12-06 21:50:37,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-06 21:50:37,768 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:50:37,768 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:50:37,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 21:50:37,769 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:50:37,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:37,769 INFO L85 PathProgramCache]: Analyzing trace with hash -125034979, now seen corresponding path program 1 times [2021-12-06 21:50:37,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:37,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54665706] [2021-12-06 21:50:37,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:37,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:37,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:50:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:37,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:50:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:37,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 21:50:37,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:37,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54665706] [2021-12-06 21:50:37,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54665706] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:50:37,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:50:37,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 21:50:37,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372669514] [2021-12-06 21:50:37,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:50:37,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 21:50:37,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:37,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 21:50:37,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:50:37,878 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:50:37,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:50:37,961 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2021-12-06 21:50:37,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 21:50:37,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-12-06 21:50:37,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:50:37,962 INFO L225 Difference]: With dead ends: 76 [2021-12-06 21:50:37,963 INFO L226 Difference]: Without dead ends: 76 [2021-12-06 21:50:37,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-06 21:50:37,964 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 69 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:50:37,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 277 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:50:37,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-06 21:50:37,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2021-12-06 21:50:37,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:50:37,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2021-12-06 21:50:37,971 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 22 [2021-12-06 21:50:37,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:50:37,971 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2021-12-06 21:50:37,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:50:37,972 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2021-12-06 21:50:37,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-06 21:50:37,973 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:50:37,973 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:50:37,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 21:50:37,973 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:50:37,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:37,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454715, now seen corresponding path program 1 times [2021-12-06 21:50:37,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:37,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715261530] [2021-12-06 21:50:37,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:37,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:38,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:50:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:38,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:50:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:38,110 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 21:50:38,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:38,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715261530] [2021-12-06 21:50:38,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715261530] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:50:38,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239377802] [2021-12-06 21:50:38,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:38,111 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:50:38,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:50:38,112 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:50:38,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 21:50:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:38,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-06 21:50:38,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:50:38,226 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 21:50:38,376 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-06 21:50:38,377 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 17 treesize of output 21 [2021-12-06 21:50:38,389 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 21:50:38,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:50:38,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239377802] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:50:38,442 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:50:38,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2021-12-06 21:50:38,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361964591] [2021-12-06 21:50:38,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:50:38,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 21:50:38,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:38,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 21:50:38,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-06 21:50:38,443 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 21:50:38,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:50:38,534 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2021-12-06 21:50:38,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 21:50:38,534 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2021-12-06 21:50:38,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:50:38,535 INFO L225 Difference]: With dead ends: 94 [2021-12-06 21:50:38,535 INFO L226 Difference]: Without dead ends: 94 [2021-12-06 21:50:38,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-12-06 21:50:38,536 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 67 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:50:38,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 355 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 34 Unchecked, 0.1s Time] [2021-12-06 21:50:38,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-06 21:50:38,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 74. [2021-12-06 21:50:38,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.54) internal successors, (77), 70 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:50:38,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2021-12-06 21:50:38,541 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 25 [2021-12-06 21:50:38,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:50:38,542 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2021-12-06 21:50:38,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 21:50:38,542 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2021-12-06 21:50:38,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-06 21:50:38,543 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:50:38,543 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:50:38,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 21:50:38,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-06 21:50:38,744 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:50:38,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:38,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454714, now seen corresponding path program 1 times [2021-12-06 21:50:38,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:38,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775120094] [2021-12-06 21:50:38,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:38,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:38,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:50:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:38,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:50:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:39,008 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 21:50:39,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:39,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775120094] [2021-12-06 21:50:39,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775120094] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:50:39,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657601546] [2021-12-06 21:50:39,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:39,009 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:50:39,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:50:39,010 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:50:39,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 21:50:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:39,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-06 21:50:39,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:50:39,083 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 21:50:39,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:50:39,295 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 21:50:39,301 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:50:39,301 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 21:50:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:50:39,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:50:39,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657601546] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:50:39,432 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:50:39,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2021-12-06 21:50:39,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631749044] [2021-12-06 21:50:39,432 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:50:39,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-06 21:50:39,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:39,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-06 21:50:39,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2021-12-06 21:50:39,434 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-06 21:50:39,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:50:39,613 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2021-12-06 21:50:39,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 21:50:39,614 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2021-12-06 21:50:39,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:50:39,615 INFO L225 Difference]: With dead ends: 94 [2021-12-06 21:50:39,615 INFO L226 Difference]: Without dead ends: 94 [2021-12-06 21:50:39,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2021-12-06 21:50:39,616 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 176 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:50:39,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 450 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 324 Invalid, 0 Unknown, 33 Unchecked, 0.1s Time] [2021-12-06 21:50:39,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-06 21:50:39,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2021-12-06 21:50:39,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:50:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2021-12-06 21:50:39,624 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 25 [2021-12-06 21:50:39,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:50:39,625 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2021-12-06 21:50:39,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-06 21:50:39,625 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2021-12-06 21:50:39,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-06 21:50:39,626 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:50:39,626 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:50:39,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-06 21:50:39,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-06 21:50:39,828 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:50:39,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:39,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866825, now seen corresponding path program 1 times [2021-12-06 21:50:39,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:39,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834176100] [2021-12-06 21:50:39,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:39,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:39,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:50:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:39,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:50:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:40,005 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 21:50:40,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:40,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834176100] [2021-12-06 21:50:40,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834176100] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:50:40,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:50:40,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 21:50:40,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205150157] [2021-12-06 21:50:40,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:50:40,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 21:50:40,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:40,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 21:50:40,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-06 21:50:40,008 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:50:40,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:50:40,185 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2021-12-06 21:50:40,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 21:50:40,185 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-06 21:50:40,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:50:40,186 INFO L225 Difference]: With dead ends: 142 [2021-12-06 21:50:40,186 INFO L226 Difference]: Without dead ends: 142 [2021-12-06 21:50:40,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-06 21:50:40,187 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 312 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:50:40,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 479 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:50:40,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-06 21:50:40,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 76. [2021-12-06 21:50:40,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 72 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:50:40,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2021-12-06 21:50:40,193 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 30 [2021-12-06 21:50:40,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:50:40,194 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2021-12-06 21:50:40,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:50:40,194 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2021-12-06 21:50:40,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-06 21:50:40,195 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:50:40,195 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:50:40,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 21:50:40,195 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:50:40,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:40,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866826, now seen corresponding path program 1 times [2021-12-06 21:50:40,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:40,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466041449] [2021-12-06 21:50:40,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:40,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:40,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:50:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:40,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:50:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:40,263 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 21:50:40,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:40,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466041449] [2021-12-06 21:50:40,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466041449] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:50:40,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:50:40,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 21:50:40,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543915592] [2021-12-06 21:50:40,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:50:40,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 21:50:40,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:40,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 21:50:40,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:50:40,265 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:50:40,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:50:40,328 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2021-12-06 21:50:40,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 21:50:40,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-06 21:50:40,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:50:40,329 INFO L225 Difference]: With dead ends: 104 [2021-12-06 21:50:40,329 INFO L226 Difference]: Without dead ends: 104 [2021-12-06 21:50:40,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-06 21:50:40,330 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 90 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:50:40,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 249 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:50:40,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-06 21:50:40,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 79. [2021-12-06 21:50:40,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 75 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:50:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2021-12-06 21:50:40,334 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 30 [2021-12-06 21:50:40,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:50:40,334 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2021-12-06 21:50:40,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:50:40,334 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2021-12-06 21:50:40,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-06 21:50:40,335 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:50:40,335 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:50:40,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 21:50:40,335 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:50:40,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:40,336 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866881, now seen corresponding path program 1 times [2021-12-06 21:50:40,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:40,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465930739] [2021-12-06 21:50:40,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:40,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:40,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:50:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:40,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:50:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:40,447 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 21:50:40,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:40,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465930739] [2021-12-06 21:50:40,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465930739] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:50:40,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:50:40,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 21:50:40,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347067554] [2021-12-06 21:50:40,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:50:40,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 21:50:40,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:40,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 21:50:40,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-06 21:50:40,448 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:50:40,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:50:40,654 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2021-12-06 21:50:40,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 21:50:40,654 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-06 21:50:40,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:50:40,656 INFO L225 Difference]: With dead ends: 127 [2021-12-06 21:50:40,656 INFO L226 Difference]: Without dead ends: 127 [2021-12-06 21:50:40,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-06 21:50:40,657 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 307 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:50:40,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 500 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:50:40,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-06 21:50:40,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 79. [2021-12-06 21:50:40,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 75 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:50:40,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2021-12-06 21:50:40,662 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 30 [2021-12-06 21:50:40,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:50:40,663 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2021-12-06 21:50:40,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:50:40,663 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2021-12-06 21:50:40,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-06 21:50:40,664 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:50:40,664 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:50:40,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 21:50:40,664 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:50:40,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:40,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829059, now seen corresponding path program 1 times [2021-12-06 21:50:40,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:40,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955281755] [2021-12-06 21:50:40,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:40,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:40,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:50:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:40,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:50:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:40,865 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 21:50:40,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:40,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955281755] [2021-12-06 21:50:40,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955281755] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:50:40,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634417959] [2021-12-06 21:50:40,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:40,866 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:50:40,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:50:40,867 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:50:40,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 21:50:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:40,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 53 conjunts are in the unsatisfiable core [2021-12-06 21:50:40,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:50:40,946 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 21:50:40,992 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:50:40,992 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 21:50:41,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 21:50:41,021 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:50:41,021 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 28 treesize of output 29 [2021-12-06 21:50:41,097 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 25 treesize of output 13 [2021-12-06 21:50:41,102 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:50:41,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:50:41,123 INFO L354 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2021-12-06 21:50:41,123 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 18 [2021-12-06 21:50:41,127 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_662 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_662) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2021-12-06 21:50:41,133 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_662 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_662) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2021-12-06 21:50:41,138 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:50:41,139 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-06 21:50:41,141 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 30 treesize of output 22 [2021-12-06 21:50:41,144 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 21:50:41,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634417959] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:50:41,189 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:50:41,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 23 [2021-12-06 21:50:41,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578006367] [2021-12-06 21:50:41,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:50:41,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-06 21:50:41,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:41,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-06 21:50:41,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=549, Unknown=2, NotChecked=94, Total=702 [2021-12-06 21:50:41,191 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:50:41,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:50:41,625 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2021-12-06 21:50:41,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-06 21:50:41,626 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2021-12-06 21:50:41,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:50:41,627 INFO L225 Difference]: With dead ends: 125 [2021-12-06 21:50:41,627 INFO L226 Difference]: Without dead ends: 125 [2021-12-06 21:50:41,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=1039, Unknown=2, NotChecked=134, Total=1332 [2021-12-06 21:50:41,628 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 179 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 21:50:41,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 938 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 21:50:41,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-06 21:50:41,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 94. [2021-12-06 21:50:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 89 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 21:50:41,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2021-12-06 21:50:41,632 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 33 [2021-12-06 21:50:41,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:50:41,632 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2021-12-06 21:50:41,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:50:41,633 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2021-12-06 21:50:41,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-06 21:50:41,633 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:50:41,633 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:50:41,658 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 21:50:41,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-06 21:50:41,835 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:50:41,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:41,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829058, now seen corresponding path program 1 times [2021-12-06 21:50:41,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:41,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327372979] [2021-12-06 21:50:41,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:41,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:42,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:50:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:42,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:50:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:42,166 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 21:50:42,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:42,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327372979] [2021-12-06 21:50:42,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327372979] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:50:42,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404857992] [2021-12-06 21:50:42,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:42,167 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:50:42,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:50:42,168 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:50:42,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 21:50:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:42,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 69 conjunts are in the unsatisfiable core [2021-12-06 21:50:42,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:50:42,262 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 21:50:42,483 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:50:42,483 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 21:50:42,486 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 11 [2021-12-06 21:50:42,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, 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 21:50:42,556 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 21:50:42,643 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:50:42,643 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 21:50:42,646 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 21:50:42,774 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 31 treesize of output 19 [2021-12-06 21:50:42,777 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 21:50:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:50:42,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:50:43,189 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:50:43,189 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2021-12-06 21:50:43,192 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 34 treesize of output 26 [2021-12-06 21:50:43,194 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 11 treesize of output 9 [2021-12-06 21:50:43,202 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:50:43,202 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-06 21:50:43,206 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:50:43,207 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-06 21:50:43,209 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:50:43,210 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 27 treesize of output 19 [2021-12-06 21:50:43,212 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:50:43,213 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 20 treesize of output 12 [2021-12-06 21:50:43,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404857992] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:50:43,377 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:50:43,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 37 [2021-12-06 21:50:43,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103821000] [2021-12-06 21:50:43,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:50:43,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-06 21:50:43,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:43,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-06 21:50:43,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2218, Unknown=1, NotChecked=0, Total=2352 [2021-12-06 21:50:43,379 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 38 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 32 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-06 21:50:44,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:50:44,335 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2021-12-06 21:50:44,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 21:50:44,336 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 32 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2021-12-06 21:50:44,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:50:44,337 INFO L225 Difference]: With dead ends: 150 [2021-12-06 21:50:44,337 INFO L226 Difference]: Without dead ends: 150 [2021-12-06 21:50:44,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=296, Invalid=3363, Unknown=1, NotChecked=0, Total=3660 [2021-12-06 21:50:44,338 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 259 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 21:50:44,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 1551 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 21:50:44,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-06 21:50:44,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 91. [2021-12-06 21:50:44,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 86 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 21:50:44,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2021-12-06 21:50:44,342 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 33 [2021-12-06 21:50:44,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:50:44,342 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2021-12-06 21:50:44,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 32 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-06 21:50:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2021-12-06 21:50:44,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 21:50:44,344 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:50:44,344 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:50:44,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 21:50:44,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-06 21:50:44,545 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:50:44,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:44,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1020012727, now seen corresponding path program 2 times [2021-12-06 21:50:44,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:44,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867188360] [2021-12-06 21:50:44,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:44,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:44,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:50:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:44,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:50:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:44,644 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 21:50:44,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:44,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867188360] [2021-12-06 21:50:44,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867188360] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:50:44,644 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:50:44,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 21:50:44,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190923970] [2021-12-06 21:50:44,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:50:44,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 21:50:44,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:44,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 21:50:44,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:50:44,646 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:50:44,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:50:44,699 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2021-12-06 21:50:44,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 21:50:44,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2021-12-06 21:50:44,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:50:44,700 INFO L225 Difference]: With dead ends: 89 [2021-12-06 21:50:44,700 INFO L226 Difference]: Without dead ends: 89 [2021-12-06 21:50:44,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-06 21:50:44,700 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 103 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:50:44,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 164 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:50:44,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-06 21:50:44,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-12-06 21:50:44,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.373134328358209) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 21:50:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2021-12-06 21:50:44,703 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 36 [2021-12-06 21:50:44,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:50:44,704 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2021-12-06 21:50:44,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:50:44,704 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2021-12-06 21:50:44,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-06 21:50:44,704 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:50:44,705 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:50:44,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 21:50:44,705 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:50:44,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:44,705 INFO L85 PathProgramCache]: Analyzing trace with hash 999795886, now seen corresponding path program 1 times [2021-12-06 21:50:44,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:44,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234546484] [2021-12-06 21:50:44,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:44,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:44,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:50:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:44,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:50:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:44,781 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 21:50:44,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:44,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234546484] [2021-12-06 21:50:44,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234546484] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:50:44,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:50:44,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 21:50:44,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199788261] [2021-12-06 21:50:44,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:50:44,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 21:50:44,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:44,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 21:50:44,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-06 21:50:44,782 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:50:44,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:50:44,921 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2021-12-06 21:50:44,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 21:50:44,922 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2021-12-06 21:50:44,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:50:44,923 INFO L225 Difference]: With dead ends: 114 [2021-12-06 21:50:44,923 INFO L226 Difference]: Without dead ends: 114 [2021-12-06 21:50:44,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-06 21:50:44,923 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 280 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:50:44,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 314 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:50:44,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-06 21:50:44,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 92. [2021-12-06 21:50:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.4) internal successors, (98), 87 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 21:50:44,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2021-12-06 21:50:44,926 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 40 [2021-12-06 21:50:44,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:50:44,927 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2021-12-06 21:50:44,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:50:44,927 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2021-12-06 21:50:44,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-06 21:50:44,927 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:50:44,927 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:50:44,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 21:50:44,928 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:50:44,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:44,928 INFO L85 PathProgramCache]: Analyzing trace with hash 999795887, now seen corresponding path program 1 times [2021-12-06 21:50:44,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:44,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940499956] [2021-12-06 21:50:44,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:44,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:44,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:50:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:44,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:50:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:44,995 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:50:44,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:44,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940499956] [2021-12-06 21:50:44,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940499956] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:50:44,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129924305] [2021-12-06 21:50:44,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:44,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:50:44,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:50:44,996 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:50:44,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 21:50:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:45,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 21:50:45,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:50:45,119 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:50:45,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:50:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:50:45,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129924305] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:50:45,156 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:50:45,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2021-12-06 21:50:45,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921627603] [2021-12-06 21:50:45,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:50:45,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 21:50:45,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:45,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 21:50:45,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-06 21:50:45,158 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 21:50:45,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:50:45,209 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2021-12-06 21:50:45,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 21:50:45,210 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2021-12-06 21:50:45,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:50:45,210 INFO L225 Difference]: With dead ends: 120 [2021-12-06 21:50:45,210 INFO L226 Difference]: Without dead ends: 120 [2021-12-06 21:50:45,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-06 21:50:45,211 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 142 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:50:45,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 261 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:50:45,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-06 21:50:45,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2021-12-06 21:50:45,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 107 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 21:50:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2021-12-06 21:50:45,215 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 40 [2021-12-06 21:50:45,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:50:45,215 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2021-12-06 21:50:45,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 21:50:45,216 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2021-12-06 21:50:45,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-06 21:50:45,216 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:50:45,217 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:50:45,236 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 21:50:45,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-06 21:50:45,418 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:50:45,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:45,419 INFO L85 PathProgramCache]: Analyzing trace with hash 968760597, now seen corresponding path program 1 times [2021-12-06 21:50:45,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:45,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575583225] [2021-12-06 21:50:45,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:45,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:45,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:50:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:45,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:50:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:45,522 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:50:45,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:45,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575583225] [2021-12-06 21:50:45,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575583225] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:50:45,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091449929] [2021-12-06 21:50:45,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:45,523 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:50:45,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:50:45,524 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:50:45,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 21:50:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:45,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 21:50:45,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:50:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:50:45,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:50:45,686 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:50:45,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091449929] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:50:45,686 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:50:45,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2021-12-06 21:50:45,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032705924] [2021-12-06 21:50:45,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:50:45,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 21:50:45,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:45,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 21:50:45,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-06 21:50:45,688 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 21:50:45,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:50:45,740 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2021-12-06 21:50:45,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 21:50:45,740 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-06 21:50:45,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:50:45,741 INFO L225 Difference]: With dead ends: 114 [2021-12-06 21:50:45,741 INFO L226 Difference]: Without dead ends: 114 [2021-12-06 21:50:45,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-12-06 21:50:45,742 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 201 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:50:45,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 226 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:50:45,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-06 21:50:45,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2021-12-06 21:50:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 103 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 21:50:45,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2021-12-06 21:50:45,746 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 41 [2021-12-06 21:50:45,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:50:45,747 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2021-12-06 21:50:45,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 21:50:45,747 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2021-12-06 21:50:45,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-06 21:50:45,748 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:50:45,748 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:50:45,768 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-06 21:50:45,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:50:45,950 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:50:45,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:45,951 INFO L85 PathProgramCache]: Analyzing trace with hash -192932373, now seen corresponding path program 3 times [2021-12-06 21:50:45,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:45,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443192275] [2021-12-06 21:50:45,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:45,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:46,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:50:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:46,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:50:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:46,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 21:50:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:46,042 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-06 21:50:46,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:46,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443192275] [2021-12-06 21:50:46,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443192275] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:50:46,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492938075] [2021-12-06 21:50:46,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 21:50:46,043 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:50:46,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:50:46,044 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:50:46,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 21:50:46,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-06 21:50:46,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:50:46,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 21:50:46,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:50:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 21:50:46,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:50:46,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492938075] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:50:46,171 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 21:50:46,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-12-06 21:50:46,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895339033] [2021-12-06 21:50:46,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:50:46,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 21:50:46,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:46,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 21:50:46,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:50:46,173 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 21:50:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:50:46,186 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2021-12-06 21:50:46,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 21:50:46,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2021-12-06 21:50:46,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:50:46,187 INFO L225 Difference]: With dead ends: 92 [2021-12-06 21:50:46,187 INFO L226 Difference]: Without dead ends: 92 [2021-12-06 21:50:46,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:50:46,187 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 116 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:50:46,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 84 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:50:46,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-06 21:50:46,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-12-06 21:50:46,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 88 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:50:46,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2021-12-06 21:50:46,191 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 45 [2021-12-06 21:50:46,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:50:46,192 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2021-12-06 21:50:46,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 21:50:46,192 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2021-12-06 21:50:46,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-06 21:50:46,192 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:50:46,193 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:50:46,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-06 21:50:46,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-06 21:50:46,394 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:50:46,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:46,394 INFO L85 PathProgramCache]: Analyzing trace with hash 884092027, now seen corresponding path program 2 times [2021-12-06 21:50:46,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:46,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397418221] [2021-12-06 21:50:46,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:46,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:46,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:50:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:46,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:50:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:46,503 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 21:50:46,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:46,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397418221] [2021-12-06 21:50:46,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397418221] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:50:46,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:50:46,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 21:50:46,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618554867] [2021-12-06 21:50:46,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:50:46,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 21:50:46,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:46,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 21:50:46,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-06 21:50:46,505 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:50:46,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:50:46,647 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2021-12-06 21:50:46,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 21:50:46,648 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2021-12-06 21:50:46,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:50:46,649 INFO L225 Difference]: With dead ends: 132 [2021-12-06 21:50:46,649 INFO L226 Difference]: Without dead ends: 132 [2021-12-06 21:50:46,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-06 21:50:46,649 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 409 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:50:46,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 294 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:50:46,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-12-06 21:50:46,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 92. [2021-12-06 21:50:46,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 88 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:50:46,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2021-12-06 21:50:46,653 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 45 [2021-12-06 21:50:46,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:50:46,653 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2021-12-06 21:50:46,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:50:46,653 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2021-12-06 21:50:46,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-06 21:50:46,653 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:50:46,653 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:50:46,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-06 21:50:46,654 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:50:46,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:46,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140989, now seen corresponding path program 1 times [2021-12-06 21:50:46,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:46,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308855272] [2021-12-06 21:50:46,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:46,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:46,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:50:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:46,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:50:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:46,709 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-06 21:50:46,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:46,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308855272] [2021-12-06 21:50:46,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308855272] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:50:46,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:50:46,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 21:50:46,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841518175] [2021-12-06 21:50:46,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:50:46,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 21:50:46,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:46,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 21:50:46,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:50:46,710 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:50:46,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:50:46,753 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2021-12-06 21:50:46,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 21:50:46,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2021-12-06 21:50:46,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:50:46,754 INFO L225 Difference]: With dead ends: 88 [2021-12-06 21:50:46,754 INFO L226 Difference]: Without dead ends: 88 [2021-12-06 21:50:46,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-06 21:50:46,755 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 121 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:50:46,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 147 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:50:46,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-06 21:50:46,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-12-06 21:50:46,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 84 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:50:46,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2021-12-06 21:50:46,757 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 48 [2021-12-06 21:50:46,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:50:46,758 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2021-12-06 21:50:46,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:50:46,758 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2021-12-06 21:50:46,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-06 21:50:46,758 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:50:46,758 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:50:46,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-06 21:50:46,758 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:50:46,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:46,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140934, now seen corresponding path program 1 times [2021-12-06 21:50:46,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:46,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570421758] [2021-12-06 21:50:46,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:46,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:46,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:50:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:47,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:50:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:47,055 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 21:50:47,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:47,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570421758] [2021-12-06 21:50:47,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570421758] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:50:47,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085579978] [2021-12-06 21:50:47,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:47,056 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:50:47,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:50:47,057 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:50:47,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 21:50:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:47,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 82 conjunts are in the unsatisfiable core [2021-12-06 21:50:47,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:50:47,172 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 21:50:47,225 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:50:47,225 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 21:50:47,236 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 21:50:47,261 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:50:47,261 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 28 treesize of output 29 [2021-12-06 21:50:47,385 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:50:47,386 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 28 treesize of output 29 [2021-12-06 21:50:47,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:50:47,445 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 31 treesize of output 26 [2021-12-06 21:50:47,502 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 25 treesize of output 13 [2021-12-06 21:50:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 21:50:47,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:50:49,430 INFO L354 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2021-12-06 21:50:49,430 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 29 treesize of output 28 [2021-12-06 21:50:49,434 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1622 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1621))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1622)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2021-12-06 21:50:49,442 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1622 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1621))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1622)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2021-12-06 21:50:49,447 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:50:49,447 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2021-12-06 21:50:49,449 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 136 treesize of output 112 [2021-12-06 21:50:49,452 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 108 treesize of output 98 [2021-12-06 21:50:49,455 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 98 treesize of output 94 [2021-12-06 21:50:49,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085579978] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:50:49,587 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:50:49,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 30 [2021-12-06 21:50:49,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797834925] [2021-12-06 21:50:49,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:50:49,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-06 21:50:49,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:49,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-06 21:50:49,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1412, Unknown=99, NotChecked=158, Total=1806 [2021-12-06 21:50:49,589 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 31 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 27 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:50:50,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:50:50,144 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2021-12-06 21:50:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 21:50:50,145 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 27 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2021-12-06 21:50:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:50:50,145 INFO L225 Difference]: With dead ends: 145 [2021-12-06 21:50:50,146 INFO L226 Difference]: Without dead ends: 145 [2021-12-06 21:50:50,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=320, Invalid=2553, Unknown=105, NotChecked=214, Total=3192 [2021-12-06 21:50:50,147 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 326 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 21:50:50,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 822 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 21:50:50,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-12-06 21:50:50,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 87. [2021-12-06 21:50:50,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:50:50,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-12-06 21:50:50,151 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 48 [2021-12-06 21:50:50,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:50:50,151 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-12-06 21:50:50,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 27 states have internal predecessors, (64), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:50:50,151 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-12-06 21:50:50,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-06 21:50:50,152 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:50:50,152 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:50:50,171 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-06 21:50:50,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:50:50,353 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:50:50,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:50,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140935, now seen corresponding path program 1 times [2021-12-06 21:50:50,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:50,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999161156] [2021-12-06 21:50:50,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:50,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:50,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:50:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:50,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:50:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:50,808 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 21:50:50,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:50,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999161156] [2021-12-06 21:50:50,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999161156] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:50:50,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573648646] [2021-12-06 21:50:50,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:50,808 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:50:50,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:50:50,809 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:50:50,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 21:50:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:50,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 103 conjunts are in the unsatisfiable core [2021-12-06 21:50:50,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:50:50,913 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 21:50:51,153 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:50:51,153 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 21:50:51,230 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 21:50:51,234 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 21:50:51,320 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:50:51,320 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 21:50:51,323 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 21:50:51,589 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:50:51,589 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 21:50:51,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:50:51,592 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 21:50:51,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:50:51,671 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 37 treesize of output 32 [2021-12-06 21:50:51,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:50:51,675 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 36 treesize of output 31 [2021-12-06 21:50:51,745 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 31 treesize of output 19 [2021-12-06 21:50:51,747 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 21:50:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 21:50:51,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:50:54,709 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (and (forall ((v_ArrVal_1770 Int) (v_ArrVal_1769 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1769) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1770) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1769 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1769) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-06 21:50:54,768 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (and (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1770 Int) (v_ArrVal_1769 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1769) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1766) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1770) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1769 Int)) (<= 0 (+ 4 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1769) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-06 21:50:54,812 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (and (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1770 Int) (v_ArrVal_1769 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1769) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1766) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1770) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1769 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1769) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-06 21:50:54,837 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1769 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1769) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1770 Int) (v_ArrVal_1769 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_1769) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1766) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_1770) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) is different from false [2021-12-06 21:50:54,889 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (and (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1770 Int) (v_ArrVal_1769 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_1769) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1766) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_1770) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1769 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1769) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-06 21:50:54,912 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (and (forall ((v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1769 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1765) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1769) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 4))) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1770 Int) (v_ArrVal_1769 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1765) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse1 v_ArrVal_1769) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1766) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse1 v_ArrVal_1770) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) is different from false [2021-12-06 21:50:54,935 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (and (forall ((v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1769 Int)) (<= 0 (+ 4 (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1765) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1769) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1770 Int) (v_ArrVal_1769 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1765) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1769) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1766) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1770) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2021-12-06 21:50:54,967 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (and (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1770 Int) (v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int)) (v_ArrVal_1769 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1763))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ 8 (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1764) .cse0 v_ArrVal_1765) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1769) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (store (select (store .cse2 .cse0 v_ArrVal_1766) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1770) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int)) (v_ArrVal_1769 Int)) (<= 0 (+ 4 (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1764) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1763) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1765) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1769) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2021-12-06 21:50:55,028 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (and (forall ((v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int)) (v_ArrVal_1769 Int)) (<= 0 (+ (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1764) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1763) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1765) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1769) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4))) (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1770 Int) (v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int)) (v_ArrVal_1769 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1763))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1764) .cse0 v_ArrVal_1765) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_1769) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 8) (select |c_#length| (select (store (select (store .cse2 .cse0 v_ArrVal_1766) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_1770) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2021-12-06 21:50:55,040 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:50:55,041 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 120 [2021-12-06 21:50:55,046 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:50:55,046 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 96 [2021-12-06 21:50:55,050 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 480 treesize of output 456 [2021-12-06 21:50:55,058 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 2372 treesize of output 2334 [2021-12-06 21:50:55,070 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:50:55,074 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 2244 treesize of output 2206 [2021-12-06 21:50:55,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:50:55,088 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 2126 treesize of output 2028 [2021-12-06 21:50:55,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:50:55,109 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 1859 treesize of output 1795 [2021-12-06 21:50:55,120 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:50:55,123 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 1635 treesize of output 1571 [2021-12-06 21:50:55,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:50:55,140 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 1491 treesize of output 1459 [2021-12-06 21:50:55,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:50:55,156 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 1379 treesize of output 1291 [2021-12-06 21:50:55,170 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:50:55,173 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 1271 treesize of output 1263 [2021-12-06 21:50:55,208 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:50:55,211 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 1253 treesize of output 1249 [2021-12-06 21:51:11,059 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 62 treesize of output 54 [2021-12-06 21:51:11,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573648646] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:51:11,240 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:51:11,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 45 [2021-12-06 21:51:11,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295037985] [2021-12-06 21:51:11,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:51:11,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-06 21:51:11,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:51:11,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-06 21:51:11,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2701, Unknown=9, NotChecked=1008, Total=3906 [2021-12-06 21:51:11,242 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 46 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 40 states have internal predecessors, (79), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-06 21:51:12,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:51:12,500 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2021-12-06 21:51:12,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-06 21:51:12,500 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 40 states have internal predecessors, (79), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2021-12-06 21:51:12,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:51:12,501 INFO L225 Difference]: With dead ends: 124 [2021-12-06 21:51:12,501 INFO L226 Difference]: Without dead ends: 124 [2021-12-06 21:51:12,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=415, Invalid=4304, Unknown=9, NotChecked=1278, Total=6006 [2021-12-06 21:51:12,503 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 568 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 21:51:12,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [568 Valid, 1880 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 21:51:12,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-06 21:51:12,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 84. [2021-12-06 21:51:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 80 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:51:12,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2021-12-06 21:51:12,506 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 48 [2021-12-06 21:51:12,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:51:12,506 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2021-12-06 21:51:12,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 40 states have internal predecessors, (79), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-06 21:51:12,506 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2021-12-06 21:51:12,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-06 21:51:12,506 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:51:12,506 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:51:12,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-06 21:51:12,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:51:12,708 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:51:12,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:51:12,709 INFO L85 PathProgramCache]: Analyzing trace with hash -74907051, now seen corresponding path program 1 times [2021-12-06 21:51:12,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:51:12,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319142296] [2021-12-06 21:51:12,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:51:12,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:51:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:12,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:51:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:12,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:51:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-06 21:51:12,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:51:12,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319142296] [2021-12-06 21:51:12,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319142296] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:51:12,798 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:51:12,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 21:51:12,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081205370] [2021-12-06 21:51:12,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:51:12,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 21:51:12,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:51:12,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 21:51:12,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:51:12,799 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:51:12,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:51:12,842 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2021-12-06 21:51:12,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 21:51:12,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2021-12-06 21:51:12,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:51:12,843 INFO L225 Difference]: With dead ends: 86 [2021-12-06 21:51:12,843 INFO L226 Difference]: Without dead ends: 86 [2021-12-06 21:51:12,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-06 21:51:12,844 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 70 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:51:12,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 216 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:51:12,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-06 21:51:12,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2021-12-06 21:51:12,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:51:12,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2021-12-06 21:51:12,847 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 49 [2021-12-06 21:51:12,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:51:12,847 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2021-12-06 21:51:12,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:51:12,847 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2021-12-06 21:51:12,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-06 21:51:12,847 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:51:12,847 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:51:12,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-06 21:51:12,848 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:51:12,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:51:12,848 INFO L85 PathProgramCache]: Analyzing trace with hash 836425368, now seen corresponding path program 1 times [2021-12-06 21:51:12,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:51:12,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319561439] [2021-12-06 21:51:12,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:51:12,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:51:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:13,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:51:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:13,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:51:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:13,502 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 21:51:13,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:51:13,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319561439] [2021-12-06 21:51:13,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319561439] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:51:13,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560334364] [2021-12-06 21:51:13,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:51:13,503 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:51:13,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:51:13,504 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:51:13,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-06 21:51:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:13,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 114 conjunts are in the unsatisfiable core [2021-12-06 21:51:13,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:51:13,623 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 21:51:13,761 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:51:13,761 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 21:51:13,817 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 21:51:13,885 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:51:13,885 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 19 treesize of output 22 [2021-12-06 21:51:14,133 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:51:14,134 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 21:51:14,137 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 29 treesize of output 21 [2021-12-06 21:51:14,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:51:14,140 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 32 treesize of output 34 [2021-12-06 21:51:14,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:51:14,267 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2021-12-06 21:51:14,271 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 30 [2021-12-06 21:51:14,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:51:14,274 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 34 [2021-12-06 21:51:14,503 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 46 treesize of output 34 [2021-12-06 21:51:14,507 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 34 treesize of output 26 [2021-12-06 21:51:14,646 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 32 treesize of output 20 [2021-12-06 21:51:14,832 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 21:51:14,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:51:15,140 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1996 Int) (v_ArrVal_1998 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1995) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_1998)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_1996)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1))) (forall ((v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1996 Int) (v_ArrVal_1998 Int)) (<= (+ (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1995) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse1 v_ArrVal_1998)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse1 v_ArrVal_1996)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|)))) is different from false [2021-12-06 21:51:15,176 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (and (forall ((v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1996 Int) (v_ArrVal_1998 Int)) (<= (+ (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1995) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1998) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1996) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (forall ((v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1996 Int) (v_ArrVal_1998 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1995) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_1998) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_1996) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-06 21:51:15,231 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:51:15,231 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 92 [2021-12-06 21:51:15,254 INFO L354 Elim1Store]: treesize reduction 102, result has 28.2 percent of original size [2021-12-06 21:51:15,254 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 200 treesize of output 173 [2021-12-06 21:51:15,260 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 129 treesize of output 113 [2021-12-06 21:51:15,264 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 113 treesize of output 97 [2021-12-06 21:51:15,347 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (let ((.cse1 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (<= .cse0 .cse1) (forall ((v_ArrVal_1991 (Array Int Int)) (v_ArrVal_1996 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1991) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_1996) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (<= .cse1 .cse0) (forall ((v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1998 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1993) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_1998) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1998 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1993) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_1998) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-06 21:51:15,423 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (let ((.cse1 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (<= .cse0 .cse1) (forall ((v_ArrVal_1991 (Array Int Int)) (v_ArrVal_1996 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1991) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_1996) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|)) (forall ((v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1998 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1993) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_1998) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1998 Int)) (= |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1993) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_1998) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= .cse1 .cse0))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-06 21:51:15,437 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:51:15,437 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 106 treesize of output 109 [2021-12-06 21:51:15,441 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:51:15,443 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 95 treesize of output 93 [2021-12-06 21:51:15,468 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:51:15,470 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 7 treesize of output 5 [2021-12-06 21:51:15,474 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:51:15,478 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-06 21:51:15,478 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 7 treesize of output 7 [2021-12-06 21:51:15,719 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1989) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2021-12-06 21:51:15,725 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1989) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) is different from false [2021-12-06 21:51:15,730 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:51:15,730 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2021-12-06 21:51:15,731 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 33 treesize of output 25 [2021-12-06 21:51:15,735 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 21:51:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-06 21:51:16,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560334364] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:51:16,203 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:51:16,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 29] total 78 [2021-12-06 21:51:16,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4564970] [2021-12-06 21:51:16,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:51:16,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2021-12-06 21:51:16,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:51:16,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-12-06 21:51:16,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=4914, Unknown=6, NotChecked=870, Total=6006 [2021-12-06 21:51:16,205 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 78 states, 78 states have (on average 1.641025641025641) internal successors, (128), 69 states have internal predecessors, (128), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-06 21:51:17,610 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1)) (.cse2 (select .cse3 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse6 (select .cse7 |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|))) (and (= .cse0 .cse1) (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~s~0#1.offset|)) (<= |c_ULTIMATE.start_main_~len~0#1| .cse4) (= (select .cse5 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= .cse4 |c_ULTIMATE.start_main_~len~0#1|) (not (= .cse6 |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (<= .cse1 .cse0) (= |c_ULTIMATE.start_main_~s~0#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 0) (not (= (select .cse7 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (let ((.cse9 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse8 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (<= .cse8 .cse9) (forall ((v_ArrVal_1991 (Array Int Int)) (v_ArrVal_1996 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1991) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_1996) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|)) (forall ((v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1998 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1993) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_1998) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1998 Int)) (= |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1993) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_1998) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= .cse9 .cse8))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) (= |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset| 0) (<= .cse0 .cse1) (not (= .cse2 |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| .cse6) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select .cse5 |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-06 21:51:18,322 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (<= .cse0 .cse1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (<= .cse1 .cse0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (let ((.cse3 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse2 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (<= .cse2 .cse3) (forall ((v_ArrVal_1991 (Array Int Int)) (v_ArrVal_1996 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1991) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_1996) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (<= .cse3 .cse2) (forall ((v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1998 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1993) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_1998) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1998 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1993) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_1998) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2021-12-06 21:51:18,328 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse1 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse0 (+ (select (select |c_#memory_int| .cse4) 4) 1))) (and (<= .cse0 .cse1) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (and (forall ((v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1996 Int) (v_ArrVal_1998 Int)) (<= (+ (let ((.cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1995) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_1998) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_1996) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (forall ((v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1996 Int) (v_ArrVal_1998 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1995) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_1998) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_1996) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= .cse4 |c_ULTIMATE.start_main_~s~0#1.base|)) (<= .cse1 .cse0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-06 21:51:19,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:51:19,657 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2021-12-06 21:51:19,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-06 21:51:19,658 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 1.641025641025641) internal successors, (128), 69 states have internal predecessors, (128), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 52 [2021-12-06 21:51:19,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:51:19,658 INFO L225 Difference]: With dead ends: 86 [2021-12-06 21:51:19,658 INFO L226 Difference]: Without dead ends: 86 [2021-12-06 21:51:19,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 99 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=465, Invalid=7934, Unknown=9, NotChecked=1692, Total=10100 [2021-12-06 21:51:19,661 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 177 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1821 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 486 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 21:51:19,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 1821 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1308 Invalid, 0 Unknown, 486 Unchecked, 0.5s Time] [2021-12-06 21:51:19,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-06 21:51:19,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2021-12-06 21:51:19,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 80 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:51:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2021-12-06 21:51:19,663 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 52 [2021-12-06 21:51:19,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:51:19,664 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2021-12-06 21:51:19,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 1.641025641025641) internal successors, (128), 69 states have internal predecessors, (128), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-06 21:51:19,664 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2021-12-06 21:51:19,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 21:51:19,664 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:51:19,664 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:51:19,684 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-06 21:51:19,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-06 21:51:19,865 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:51:19,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:51:19,865 INFO L85 PathProgramCache]: Analyzing trace with hash -368684005, now seen corresponding path program 1 times [2021-12-06 21:51:19,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:51:19,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773095992] [2021-12-06 21:51:19,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:51:19,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:51:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:20,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:51:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:20,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:51:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:20,136 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 21:51:20,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:51:20,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773095992] [2021-12-06 21:51:20,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773095992] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:51:20,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350988141] [2021-12-06 21:51:20,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:51:20,137 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:51:20,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:51:20,138 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:51:20,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-06 21:51:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:20,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-06 21:51:20,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:51:20,338 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 17 treesize of output 13 [2021-12-06 21:51:20,453 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 21:51:20,490 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 21:51:20,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:51:20,619 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 46 treesize of output 40 [2021-12-06 21:51:20,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:51:20,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:51:20,715 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 21:51:20,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350988141] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:51:20,715 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:51:20,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 12] total 37 [2021-12-06 21:51:20,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914382405] [2021-12-06 21:51:20,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:51:20,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-06 21:51:20,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:51:20,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-06 21:51:20,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1215, Unknown=0, NotChecked=0, Total=1332 [2021-12-06 21:51:20,717 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 37 states, 37 states have (on average 3.5675675675675675) internal successors, (132), 35 states have internal predecessors, (132), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 21:51:21,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:51:21,471 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2021-12-06 21:51:21,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-06 21:51:21,471 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.5675675675675675) internal successors, (132), 35 states have internal predecessors, (132), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2021-12-06 21:51:21,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:51:21,472 INFO L225 Difference]: With dead ends: 118 [2021-12-06 21:51:21,472 INFO L226 Difference]: Without dead ends: 118 [2021-12-06 21:51:21,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=390, Invalid=2160, Unknown=0, NotChecked=0, Total=2550 [2021-12-06 21:51:21,473 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 1117 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 21:51:21,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1117 Valid, 946 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 21:51:21,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-06 21:51:21,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 88. [2021-12-06 21:51:21,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 84 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:51:21,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2021-12-06 21:51:21,476 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 59 [2021-12-06 21:51:21,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:51:21,476 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2021-12-06 21:51:21,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.5675675675675675) internal successors, (132), 35 states have internal predecessors, (132), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 21:51:21,476 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2021-12-06 21:51:21,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-06 21:51:21,476 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:51:21,477 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:51:21,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-06 21:51:21,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-06 21:51:21,678 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:51:21,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:51:21,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2070538002, now seen corresponding path program 2 times [2021-12-06 21:51:21,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:51:21,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749303586] [2021-12-06 21:51:21,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:51:21,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:51:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:21,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:51:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:21,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:51:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:21,778 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-06 21:51:21,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:51:21,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749303586] [2021-12-06 21:51:21,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749303586] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:51:21,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393555686] [2021-12-06 21:51:21,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 21:51:21,779 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:51:21,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:51:21,779 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:51:21,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-06 21:51:21,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 21:51:21,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:51:21,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 21:51:21,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:51:21,969 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-06 21:51:21,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:51:22,022 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-06 21:51:22,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393555686] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:51:22,022 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:51:22,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2021-12-06 21:51:22,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050029909] [2021-12-06 21:51:22,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:51:22,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 21:51:22,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:51:22,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 21:51:22,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-06 21:51:22,024 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 10 states, 10 states have (on average 7.9) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 21:51:22,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:51:22,077 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2021-12-06 21:51:22,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 21:51:22,078 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 62 [2021-12-06 21:51:22,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:51:22,079 INFO L225 Difference]: With dead ends: 79 [2021-12-06 21:51:22,079 INFO L226 Difference]: Without dead ends: 79 [2021-12-06 21:51:22,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-12-06 21:51:22,080 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 153 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:51:22,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 202 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:51:22,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-12-06 21:51:22,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-12-06 21:51:22,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 75 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:51:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2021-12-06 21:51:22,083 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 62 [2021-12-06 21:51:22,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:51:22,083 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2021-12-06 21:51:22,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 21:51:22,083 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2021-12-06 21:51:22,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-06 21:51:22,084 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:51:22,084 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:51:22,104 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-06 21:51:22,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-06 21:51:22,286 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:51:22,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:51:22,287 INFO L85 PathProgramCache]: Analyzing trace with hash 424234897, now seen corresponding path program 1 times [2021-12-06 21:51:22,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:51:22,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159357041] [2021-12-06 21:51:22,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:51:22,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:51:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:22,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:51:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:22,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:51:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:22,411 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-06 21:51:22,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:51:22,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159357041] [2021-12-06 21:51:22,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159357041] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:51:22,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:51:22,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 21:51:22,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739625551] [2021-12-06 21:51:22,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:51:22,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 21:51:22,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:51:22,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 21:51:22,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-06 21:51:22,414 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:51:22,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:51:22,538 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2021-12-06 21:51:22,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 21:51:22,539 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2021-12-06 21:51:22,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:51:22,539 INFO L225 Difference]: With dead ends: 97 [2021-12-06 21:51:22,539 INFO L226 Difference]: Without dead ends: 97 [2021-12-06 21:51:22,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-06 21:51:22,540 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 187 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:51:22,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 258 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:51:22,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-06 21:51:22,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 82. [2021-12-06 21:51:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 78 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:51:22,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2021-12-06 21:51:22,542 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 63 [2021-12-06 21:51:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:51:22,543 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2021-12-06 21:51:22,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:51:22,543 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2021-12-06 21:51:22,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-06 21:51:22,543 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:51:22,543 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:51:22,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-06 21:51:22,544 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:51:22,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:51:22,544 INFO L85 PathProgramCache]: Analyzing trace with hash 424234898, now seen corresponding path program 1 times [2021-12-06 21:51:22,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:51:22,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207729116] [2021-12-06 21:51:22,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:51:22,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:51:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:22,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:51:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:22,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:51:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 21:51:22,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:51:22,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207729116] [2021-12-06 21:51:22,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207729116] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:51:22,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:51:22,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 21:51:22,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256360746] [2021-12-06 21:51:22,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:51:22,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 21:51:22,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:51:22,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 21:51:22,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-06 21:51:22,642 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:51:22,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:51:22,772 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2021-12-06 21:51:22,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 21:51:22,772 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2021-12-06 21:51:22,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:51:22,772 INFO L225 Difference]: With dead ends: 80 [2021-12-06 21:51:22,773 INFO L226 Difference]: Without dead ends: 80 [2021-12-06 21:51:22,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-06 21:51:22,773 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 191 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:51:22,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 201 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:51:22,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-06 21:51:22,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-12-06 21:51:22,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:51:22,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2021-12-06 21:51:22,775 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 63 [2021-12-06 21:51:22,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:51:22,776 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2021-12-06 21:51:22,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:51:22,776 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2021-12-06 21:51:22,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-06 21:51:22,776 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:51:22,776 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:51:22,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-06 21:51:22,776 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:51:22,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:51:22,777 INFO L85 PathProgramCache]: Analyzing trace with hash 266413795, now seen corresponding path program 1 times [2021-12-06 21:51:22,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:51:22,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952927232] [2021-12-06 21:51:22,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:51:22,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:51:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:22,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:51:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:22,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:51:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 21:51:22,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:51:22,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952927232] [2021-12-06 21:51:22,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952927232] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:51:22,851 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:51:22,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 21:51:22,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500920664] [2021-12-06 21:51:22,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:51:22,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 21:51:22,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:51:22,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 21:51:22,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-06 21:51:22,853 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:51:22,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:51:22,946 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2021-12-06 21:51:22,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 21:51:22,946 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 64 [2021-12-06 21:51:22,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:51:22,947 INFO L225 Difference]: With dead ends: 80 [2021-12-06 21:51:22,947 INFO L226 Difference]: Without dead ends: 80 [2021-12-06 21:51:22,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-06 21:51:22,947 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 187 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:51:22,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 259 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:51:22,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-06 21:51:22,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-12-06 21:51:22,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.173913043478261) internal successors, (81), 76 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:51:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2021-12-06 21:51:22,952 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 64 [2021-12-06 21:51:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:51:22,952 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2021-12-06 21:51:22,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:51:22,952 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2021-12-06 21:51:22,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-06 21:51:22,953 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:51:22,953 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:51:22,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-06 21:51:22,953 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:51:22,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:51:22,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1706854879, now seen corresponding path program 1 times [2021-12-06 21:51:22,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:51:22,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605372304] [2021-12-06 21:51:22,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:51:22,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:51:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:23,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:51:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:23,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:51:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:23,022 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-06 21:51:23,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:51:23,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605372304] [2021-12-06 21:51:23,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605372304] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:51:23,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330466167] [2021-12-06 21:51:23,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:51:23,023 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:51:23,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:51:23,023 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:51:23,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-06 21:51:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:23,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 51 conjunts are in the unsatisfiable core [2021-12-06 21:51:23,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:51:23,317 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 21:51:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-06 21:51:23,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:51:23,386 INFO L354 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2021-12-06 21:51:23,386 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 21:51:23,422 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-06 21:51:23,422 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 11 treesize of output 11 [2021-12-06 21:51:23,473 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-06 21:51:23,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330466167] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:51:23,473 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:51:23,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 8] total 26 [2021-12-06 21:51:23,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224070634] [2021-12-06 21:51:23,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:51:23,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-06 21:51:23,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:51:23,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-06 21:51:23,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2021-12-06 21:51:23,474 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 25 states have internal predecessors, (105), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-06 21:51:23,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:51:23,788 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2021-12-06 21:51:23,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-06 21:51:23,788 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 25 states have internal predecessors, (105), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 66 [2021-12-06 21:51:23,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:51:23,789 INFO L225 Difference]: With dead ends: 88 [2021-12-06 21:51:23,789 INFO L226 Difference]: Without dead ends: 88 [2021-12-06 21:51:23,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=1317, Unknown=0, NotChecked=0, Total=1560 [2021-12-06 21:51:23,790 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 356 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 21:51:23,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [356 Valid, 575 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 21:51:23,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-06 21:51:23,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2021-12-06 21:51:23,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:51:23,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2021-12-06 21:51:23,793 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 66 [2021-12-06 21:51:23,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:51:23,793 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2021-12-06 21:51:23,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 25 states have internal predecessors, (105), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-06 21:51:23,793 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2021-12-06 21:51:23,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-06 21:51:23,794 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:51:23,794 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:51:23,813 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-06 21:51:23,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:51:23,996 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:51:23,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:51:23,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1706854878, now seen corresponding path program 1 times [2021-12-06 21:51:23,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:51:23,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526036867] [2021-12-06 21:51:23,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:51:23,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:51:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:24,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:51:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:24,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:51:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:24,422 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 21:51:24,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:51:24,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526036867] [2021-12-06 21:51:24,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526036867] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:51:24,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010841436] [2021-12-06 21:51:24,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:51:24,422 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:51:24,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:51:24,423 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:51:24,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-06 21:51:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:24,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 109 conjunts are in the unsatisfiable core [2021-12-06 21:51:24,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:51:24,544 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 21:51:24,635 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:51:24,635 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 21:51:24,687 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 21:51:24,689 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 21:51:24,761 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:51:24,761 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 21:51:24,763 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 21:51:24,889 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 16 treesize of output 8 [2021-12-06 21:51:24,952 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 21:51:25,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:51:25,035 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 21:51:25,321 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 23 treesize of output 15 [2021-12-06 21:51:25,323 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 26 treesize of output 14 [2021-12-06 21:51:25,381 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 21:51:25,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:51:25,600 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:51:25,601 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 31 treesize of output 35 [2021-12-06 21:51:25,731 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:51:25,731 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 28 treesize of output 32 [2021-12-06 21:51:26,727 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:51:26,727 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2021-12-06 21:51:26,730 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:51:26,730 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-06 21:51:26,732 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 50 treesize of output 42 [2021-12-06 21:51:26,735 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 196 treesize of output 180 [2021-12-06 21:51:26,738 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 176 treesize of output 170 [2021-12-06 21:51:26,741 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 170 treesize of output 158 [2021-12-06 21:51:26,744 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 110 treesize of output 98 [2021-12-06 21:51:26,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010841436] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:51:26,954 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:51:26,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 51 [2021-12-06 21:51:26,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710290966] [2021-12-06 21:51:26,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:51:26,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-12-06 21:51:26,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:51:26,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-06 21:51:26,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=4825, Unknown=10, NotChecked=0, Total=5112 [2021-12-06 21:51:26,957 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 52 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 47 states have internal predecessors, (107), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 21:51:28,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:51:28,200 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2021-12-06 21:51:28,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-06 21:51:28,200 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 47 states have internal predecessors, (107), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2021-12-06 21:51:28,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:51:28,201 INFO L225 Difference]: With dead ends: 89 [2021-12-06 21:51:28,201 INFO L226 Difference]: Without dead ends: 89 [2021-12-06 21:51:28,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1805 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=669, Invalid=7511, Unknown=10, NotChecked=0, Total=8190 [2021-12-06 21:51:28,204 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 535 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 21:51:28,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [535 Valid, 970 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 21:51:28,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-06 21:51:28,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2021-12-06 21:51:28,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 78 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:51:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2021-12-06 21:51:28,206 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 66 [2021-12-06 21:51:28,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:51:28,206 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2021-12-06 21:51:28,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 47 states have internal predecessors, (107), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 21:51:28,206 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2021-12-06 21:51:28,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 21:51:28,206 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:51:28,207 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:51:28,226 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-06 21:51:28,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:51:28,407 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:51:28,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:51:28,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1372895080, now seen corresponding path program 1 times [2021-12-06 21:51:28,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:51:28,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645433596] [2021-12-06 21:51:28,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:51:28,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:51:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:28,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:51:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:28,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:51:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:28,522 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 21:51:28,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:51:28,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645433596] [2021-12-06 21:51:28,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645433596] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:51:28,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:51:28,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 21:51:28,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753009017] [2021-12-06 21:51:28,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:51:28,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 21:51:28,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:51:28,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 21:51:28,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-06 21:51:28,523 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:51:28,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:51:28,634 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2021-12-06 21:51:28,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 21:51:28,635 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2021-12-06 21:51:28,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:51:28,636 INFO L225 Difference]: With dead ends: 81 [2021-12-06 21:51:28,636 INFO L226 Difference]: Without dead ends: 81 [2021-12-06 21:51:28,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-06 21:51:28,637 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 172 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:51:28,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 222 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:51:28,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-06 21:51:28,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-12-06 21:51:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.125) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:51:28,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2021-12-06 21:51:28,639 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 67 [2021-12-06 21:51:28,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:51:28,639 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2021-12-06 21:51:28,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:51:28,639 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2021-12-06 21:51:28,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 21:51:28,640 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:51:28,640 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:51:28,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-06 21:51:28,640 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:51:28,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:51:28,640 INFO L85 PathProgramCache]: Analyzing trace with hash -795789539, now seen corresponding path program 1 times [2021-12-06 21:51:28,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:51:28,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487207887] [2021-12-06 21:51:28,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:51:28,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:51:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:28,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:51:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:29,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:51:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 21:51:29,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:51:29,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487207887] [2021-12-06 21:51:29,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487207887] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:51:29,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437418900] [2021-12-06 21:51:29,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:51:29,051 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:51:29,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:51:29,052 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:51:29,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-06 21:51:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:29,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 85 conjunts are in the unsatisfiable core [2021-12-06 21:51:29,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:51:29,192 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 21:51:29,240 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 5 treesize of output 3 [2021-12-06 21:51:29,278 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:51:29,278 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 21:51:29,291 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 21:51:29,341 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:51:29,341 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 28 treesize of output 29 [2021-12-06 21:51:29,465 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:51:29,465 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 28 treesize of output 29 [2021-12-06 21:51:29,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:51:29,520 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 31 treesize of output 26 [2021-12-06 21:51:29,645 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 25 treesize of output 13 [2021-12-06 21:51:29,673 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 21:51:29,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:51:30,210 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_2997 Int)) (or (<= (+ (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_2997) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-06 21:51:30,230 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_2996 (Array Int Int)) (v_ArrVal_2997 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2996) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_2997) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2021-12-06 21:51:30,243 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_2996 (Array Int Int)) (v_ArrVal_2997 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2996) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_2997) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-06 21:51:30,251 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_2996 (Array Int Int)) (v_ArrVal_2997 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_2996) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_2997) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2021-12-06 21:51:30,266 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_2996 (Array Int Int)) (v_ArrVal_2997 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2996) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_2997) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-06 21:51:30,274 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_2996 (Array Int Int)) (v_ArrVal_2997 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_2996) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_2997) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) is different from false [2021-12-06 21:51:30,281 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_2996 (Array Int Int)) (v_ArrVal_2997 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2996) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_2997) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2021-12-06 21:51:30,290 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_2996 (Array Int Int)) (v_ArrVal_2995 (Array Int Int)) (v_ArrVal_2997 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2995))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2996)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_2997) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2021-12-06 21:51:30,307 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_2996 (Array Int Int)) (v_ArrVal_2995 (Array Int Int)) (v_ArrVal_2997 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (<= (+ (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2995))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2996)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_2997) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2021-12-06 21:51:30,316 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:51:30,316 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2021-12-06 21:51:30,320 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 164 treesize of output 152 [2021-12-06 21:51:30,322 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:51:30,324 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 147 treesize of output 135 [2021-12-06 21:51:30,328 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:51:30,329 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 126 treesize of output 116 [2021-12-06 21:51:30,332 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:51:30,333 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 106 treesize of output 102 [2021-12-06 21:51:30,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437418900] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:51:30,478 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:51:30,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 33 [2021-12-06 21:51:30,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311773257] [2021-12-06 21:51:30,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:51:30,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-06 21:51:30,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:51:30,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-06 21:51:30,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1370, Unknown=9, NotChecked=738, Total=2256 [2021-12-06 21:51:30,480 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 34 states, 33 states have (on average 2.878787878787879) internal successors, (95), 30 states have internal predecessors, (95), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:51:31,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:51:31,180 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2021-12-06 21:51:31,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-06 21:51:31,181 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.878787878787879) internal successors, (95), 30 states have internal predecessors, (95), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 69 [2021-12-06 21:51:31,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:51:31,181 INFO L225 Difference]: With dead ends: 86 [2021-12-06 21:51:31,181 INFO L226 Difference]: Without dead ends: 86 [2021-12-06 21:51:31,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 93 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=296, Invalid=2383, Unknown=9, NotChecked=972, Total=3660 [2021-12-06 21:51:31,183 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 201 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 21:51:31,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 570 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 21:51:31,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-06 21:51:31,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2021-12-06 21:51:31,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 78 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:51:31,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2021-12-06 21:51:31,185 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 69 [2021-12-06 21:51:31,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:51:31,186 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2021-12-06 21:51:31,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.878787878787879) internal successors, (95), 30 states have internal predecessors, (95), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:51:31,186 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2021-12-06 21:51:31,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-06 21:51:31,186 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:51:31,186 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:51:31,206 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-12-06 21:51:31,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:51:31,388 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:51:31,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:51:31,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1056399479, now seen corresponding path program 1 times [2021-12-06 21:51:31,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:51:31,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641289422] [2021-12-06 21:51:31,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:51:31,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:51:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:31,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:51:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:31,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:51:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-06 21:51:31,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:51:31,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641289422] [2021-12-06 21:51:31,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641289422] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:51:31,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69128955] [2021-12-06 21:51:31,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:51:31,665 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:51:31,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:51:31,666 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:51:31,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-06 21:51:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:31,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 85 conjunts are in the unsatisfiable core [2021-12-06 21:51:31,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:51:31,806 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 21:51:31,861 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:51:31,861 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 21:51:31,897 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 21:51:31,942 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:51:31,942 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 19 treesize of output 22 [2021-12-06 21:51:32,029 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:51:32,029 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 19 treesize of output 22 [2021-12-06 21:51:32,061 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 19 [2021-12-06 21:51:32,112 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:51:32,112 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 16 treesize of output 16 [2021-12-06 21:51:32,179 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 21:51:32,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:51:32,345 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3139 Int) (v_ArrVal_3137 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3137) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_3139) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2021-12-06 21:51:32,352 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3139 Int) (v_ArrVal_3137 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_3137) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_3139) 0)))) is different from false [2021-12-06 21:51:32,357 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3139 Int) (v_ArrVal_3137 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_3137) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_3139) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2021-12-06 21:51:32,363 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3139 Int) (v_ArrVal_3137 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3137) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_3139) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2021-12-06 21:51:32,366 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3139 Int) (v_ArrVal_3137 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_3137) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 4) v_ArrVal_3139) 0)))) is different from false [2021-12-06 21:51:32,370 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3139 Int) (v_ArrVal_3137 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3137) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4) v_ArrVal_3139) 0)))) is different from false [2021-12-06 21:51:32,374 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3139 Int) (v_ArrVal_3136 (Array Int Int)) (v_ArrVal_3137 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3136))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3137)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4) v_ArrVal_3139) 0)))) is different from false [2021-12-06 21:51:32,381 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3139 Int) (v_ArrVal_3136 (Array Int Int)) (v_ArrVal_3137 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3136))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_3137)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4) v_ArrVal_3139) 0)))) is different from false [2021-12-06 21:51:32,387 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:51:32,388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2021-12-06 21:51:32,390 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 161 treesize of output 149 [2021-12-06 21:51:32,394 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:51:32,395 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 162 treesize of output 158 [2021-12-06 21:51:32,401 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:51:32,402 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 158 treesize of output 157 [2021-12-06 21:51:32,405 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 174 treesize of output 170 [2021-12-06 21:51:32,883 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 7 not checked. [2021-12-06 21:51:32,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69128955] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:51:32,883 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:51:32,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 26] total 58 [2021-12-06 21:51:32,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124900387] [2021-12-06 21:51:32,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:51:32,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2021-12-06 21:51:32,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:51:32,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-12-06 21:51:32,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2296, Unknown=8, NotChecked=824, Total=3306 [2021-12-06 21:51:32,884 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 58 states, 58 states have (on average 2.310344827586207) internal successors, (134), 51 states have internal predecessors, (134), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-06 21:51:33,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:51:33,475 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2021-12-06 21:51:33,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-06 21:51:33,476 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.310344827586207) internal successors, (134), 51 states have internal predecessors, (134), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 70 [2021-12-06 21:51:33,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:51:33,476 INFO L225 Difference]: With dead ends: 80 [2021-12-06 21:51:33,476 INFO L226 Difference]: Without dead ends: 80 [2021-12-06 21:51:33,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 108 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=291, Invalid=3273, Unknown=8, NotChecked=984, Total=4556 [2021-12-06 21:51:33,477 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 207 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 657 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 21:51:33,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 840 Invalid, 1449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 767 Invalid, 0 Unknown, 657 Unchecked, 0.2s Time] [2021-12-06 21:51:33,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-06 21:51:33,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2021-12-06 21:51:33,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 75 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:51:33,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2021-12-06 21:51:33,479 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 70 [2021-12-06 21:51:33,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:51:33,479 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2021-12-06 21:51:33,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.310344827586207) internal successors, (134), 51 states have internal predecessors, (134), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-06 21:51:33,479 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2021-12-06 21:51:33,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-06 21:51:33,480 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:51:33,480 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:51:33,500 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-06 21:51:33,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-12-06 21:51:33,680 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:51:33,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:51:33,681 INFO L85 PathProgramCache]: Analyzing trace with hash 853476134, now seen corresponding path program 1 times [2021-12-06 21:51:33,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:51:33,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170385274] [2021-12-06 21:51:33,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:51:33,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:51:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:34,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 21:51:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:34,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 21:51:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:34,232 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 21:51:34,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:51:34,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170385274] [2021-12-06 21:51:34,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170385274] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:51:34,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204217055] [2021-12-06 21:51:34,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:51:34,233 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:51:34,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:51:34,233 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:51:34,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-06 21:51:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:34,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 127 conjunts are in the unsatisfiable core [2021-12-06 21:51:34,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:51:34,391 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 21:51:34,529 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:51:34,530 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 21:51:34,583 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 21:51:34,586 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 21:51:34,662 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-12-06 21:51:34,662 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 55 treesize of output 41 [2021-12-06 21:51:34,664 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2021-12-06 21:51:34,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:51:34,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:51:34,967 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-06 21:51:34,967 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 2 case distinctions, treesize of input 89 treesize of output 73 [2021-12-06 21:51:34,973 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-12-06 21:51:34,974 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 1 case distinctions, treesize of input 63 treesize of output 55 [2021-12-06 21:51:35,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:51:35,123 INFO L354 Elim1Store]: treesize reduction 57, result has 16.2 percent of original size [2021-12-06 21:51:35,124 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 52 treesize of output 49 [2021-12-06 21:51:35,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:51:35,127 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2021-12-06 21:51:35,484 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:51:35,488 INFO L354 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2021-12-06 21:51:35,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 38 [2021-12-06 21:51:35,493 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-06 21:51:35,493 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 19 [2021-12-06 21:51:35,636 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 21:51:35,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:52:16,763 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3290 Int) (v_ArrVal_3287 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_3287)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3290) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (< 0 .cse0) (< .cse0 0) (and (forall ((v_ArrVal_3291 Int) (v_ArrVal_3286 Int)) (= (let ((.cse4 (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4))) (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse4 v_ArrVal_3286)))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_3291))) (select (store .cse1 |c_ULTIMATE.start_main_~s~0#1.base| .cse2) (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|)))) (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse4 v_ArrVal_3287)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_3290) |c_ULTIMATE.start_main_~s~0#1.offset|))) |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((v_ArrVal_3291 Int) (v_ArrVal_3286 Int)) (= (let ((.cse7 (+ 4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse7 v_ArrVal_3287))) (.cse8 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) .cse8 v_ArrVal_3290))) (select (select (store .cse5 |c_ULTIMATE.start_main_~s~0#1.base| .cse6) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse7 v_ArrVal_3286)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse8 v_ArrVal_3291) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select .cse6 |c_ULTIMATE.start_main_~s~0#1.offset|))))) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2021-12-06 21:52:18,948 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3290 Int) (v_ArrVal_3287 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|) v_ArrVal_3287)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3290) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (< .cse0 0) (< 0 .cse0) (and (forall ((v_ArrVal_3291 Int) (v_ArrVal_3286 Int)) (= (let ((.cse4 (+ 4 |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4))) (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|) .cse4 v_ArrVal_3286)))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_3291))) (select (store .cse1 |c_ULTIMATE.start_main_~s~0#1.base| .cse2) (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|)))) (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|) .cse4 v_ArrVal_3287)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_3290) |c_ULTIMATE.start_main_~s~0#1.offset|))) |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((v_ArrVal_3291 Int) (v_ArrVal_3286 Int)) (= (let ((.cse7 (+ 4 |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|) .cse7 v_ArrVal_3287))) (.cse8 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) .cse8 v_ArrVal_3290))) (select (select (store .cse5 |c_ULTIMATE.start_main_~s~0#1.base| .cse6) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|) .cse7 v_ArrVal_3286)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse8 v_ArrVal_3291) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select .cse6 |c_ULTIMATE.start_main_~s~0#1.offset|))))) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2021-12-06 21:52:49,467 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:52:51,026 INFO L354 Elim1Store]: treesize reduction 6211, result has 22.5 percent of original size [2021-12-06 21:52:51,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 88130 treesize of output 50753 [2021-12-06 21:52:51,239 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:52:52,619 INFO L354 Elim1Store]: treesize reduction 4164, result has 14.2 percent of original size [2021-12-06 21:52:52,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 5 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 13 new quantified variables, introduced 40 case distinctions, treesize of input 166168 treesize of output 78637 [2021-12-06 21:52:54,714 INFO L354 Elim1Store]: treesize reduction 28, result has 65.4 percent of original size [2021-12-06 21:52:54,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 75317 treesize of output 74881 [2021-12-06 21:52:55,265 INFO L354 Elim1Store]: treesize reduction 297, result has 33.3 percent of original size [2021-12-06 21:52:55,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 74881 treesize of output 73860 [2021-12-06 21:52:55,711 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:52:55,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73860 treesize of output 70916 [2021-12-06 21:52:56,334 INFO L354 Elim1Store]: treesize reduction 28, result has 65.4 percent of original size [2021-12-06 21:52:56,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70916 treesize of output 70480 [2021-12-06 21:52:57,039 INFO L354 Elim1Store]: treesize reduction 281, result has 33.3 percent of original size [2021-12-06 21:52:57,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 70480 treesize of output 67681 [2021-12-06 21:52:57,725 INFO L354 Elim1Store]: treesize reduction 28, result has 65.4 percent of original size [2021-12-06 21:52:57,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67681 treesize of output 67239 [2021-12-06 21:52:58,448 INFO L354 Elim1Store]: treesize reduction 28, result has 65.4 percent of original size [2021-12-06 21:52:58,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67239 treesize of output 67145 [2021-12-06 21:52:59,114 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-12-06 21:52:59,114 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-06 21:52:59,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2021-12-06 21:52:59,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833717536] [2021-12-06 21:52:59,114 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-06 21:52:59,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-06 21:52:59,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:52:59,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-06 21:52:59,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=4714, Unknown=34, NotChecked=278, Total=5256 [2021-12-06 21:52:59,115 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 27 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:52:59,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 21:52:59,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 73.3s TimeCoverageRelationStatistics Valid=230, Invalid=4714, Unknown=34, NotChecked=278, Total=5256 [2021-12-06 21:52:59,117 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 21:52:59,117 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 21:52:59,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-06 21:52:59,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-12-06 21:52:59,320 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@4d0b3546 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 21:52:59,332 INFO L158 Benchmark]: Toolchain (without parser) took 143177.15ms. Allocated memory was 142.6MB in the beginning and 249.6MB in the end (delta: 107.0MB). Free memory was 120.2MB in the beginning and 210.2MB in the end (delta: -90.0MB). Peak memory consumption was 164.4MB. Max. memory is 16.1GB. [2021-12-06 21:52:59,332 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 77.6MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 21:52:59,333 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.73ms. Allocated memory is still 142.6MB. Free memory was 120.0MB in the beginning and 105.1MB in the end (delta: 14.9MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2021-12-06 21:52:59,334 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.75ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 102.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 21:52:59,335 INFO L158 Benchmark]: Boogie Preprocessor took 31.36ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 100.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 21:52:59,335 INFO L158 Benchmark]: RCFGBuilder took 385.37ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 105.0MB in the end (delta: -4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-06 21:52:59,336 INFO L158 Benchmark]: TraceAbstraction took 142400.35ms. Allocated memory was 142.6MB in the beginning and 249.6MB in the end (delta: 107.0MB). Free memory was 104.2MB in the beginning and 210.2MB in the end (delta: -106.0MB). Peak memory consumption was 150.1MB. Max. memory is 16.1GB. [2021-12-06 21:52:59,339 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.11ms. Allocated memory is still 77.6MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.73ms. Allocated memory is still 142.6MB. Free memory was 120.0MB in the beginning and 105.1MB in the end (delta: 14.9MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.75ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 102.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.36ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 100.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 385.37ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 105.0MB in the end (delta: -4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 142400.35ms. Allocated memory was 142.6MB in the beginning and 249.6MB in the end (delta: 107.0MB). Free memory was 104.2MB in the beginning and 210.2MB in the end (delta: -106.0MB). Peak memory consumption was 150.1MB. 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@4d0b3546 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@4d0b3546: 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 21:52:59,379 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/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_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/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_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/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_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/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 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 21:53:00,835 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 21:53:00,837 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 21:53:00,859 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 21:53:00,859 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 21:53:00,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 21:53:00,861 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 21:53:00,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 21:53:00,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 21:53:00,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 21:53:00,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 21:53:00,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 21:53:00,868 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 21:53:00,869 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 21:53:00,870 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 21:53:00,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 21:53:00,872 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 21:53:00,873 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 21:53:00,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 21:53:00,877 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 21:53:00,878 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 21:53:00,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 21:53:00,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 21:53:00,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 21:53:00,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 21:53:00,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 21:53:00,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 21:53:00,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 21:53:00,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 21:53:00,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 21:53:00,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 21:53:00,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 21:53:00,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 21:53:00,892 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 21:53:00,893 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 21:53:00,894 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 21:53:00,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 21:53:00,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 21:53:00,895 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 21:53:00,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 21:53:00,896 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 21:53:00,897 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-06 21:53:00,922 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 21:53:00,922 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 21:53:00,922 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 21:53:00,923 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 21:53:00,923 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 21:53:00,923 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 21:53:00,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 21:53:00,924 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 21:53:00,924 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 21:53:00,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 21:53:00,925 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 21:53:00,925 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-06 21:53:00,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 21:53:00,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 21:53:00,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 21:53:00,926 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-06 21:53:00,926 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-06 21:53:00,926 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-06 21:53:00,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 21:53:00,926 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-06 21:53:00,926 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-06 21:53:00,927 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-06 21:53:00,927 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 21:53:00,927 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 21:53:00,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 21:53:00,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 21:53:00,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 21:53:00,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 21:53:00,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 21:53:00,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 21:53:00,928 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-06 21:53:00,928 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-06 21:53:00,928 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 21:53:00,928 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-06 21:53:00,928 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_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/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_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/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 -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2021-12-06 21:53:01,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 21:53:01,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 21:53:01,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 21:53:01,192 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 21:53:01,193 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 21:53:01,194 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2021-12-06 21:53:01,240 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/data/9cb65ac68/51e559f23e8e47b6a4685d94440db4ed/FLAG2d69d7c4a [2021-12-06 21:53:01,679 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 21:53:01,680 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2021-12-06 21:53:01,692 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/data/9cb65ac68/51e559f23e8e47b6a4685d94440db4ed/FLAG2d69d7c4a [2021-12-06 21:53:01,701 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/data/9cb65ac68/51e559f23e8e47b6a4685d94440db4ed [2021-12-06 21:53:01,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 21:53:01,704 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 21:53:01,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 21:53:01,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 21:53:01,708 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 21:53:01,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 09:53:01" (1/1) ... [2021-12-06 21:53:01,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e52b653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:53:01, skipping insertion in model container [2021-12-06 21:53:01,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 09:53:01" (1/1) ... [2021-12-06 21:53:01,714 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 21:53:01,737 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 21:53:01,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2021-12-06 21:53:01,940 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 21:53:01,949 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 21:53:01,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2021-12-06 21:53:01,979 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 21:53:02,003 INFO L208 MainTranslator]: Completed translation [2021-12-06 21:53:02,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:53:02 WrapperNode [2021-12-06 21:53:02,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 21:53:02,004 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 21:53:02,004 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 21:53:02,004 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 21:53:02,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:53:02" (1/1) ... [2021-12-06 21:53:02,022 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:53:02" (1/1) ... [2021-12-06 21:53:02,040 INFO L137 Inliner]: procedures = 129, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2021-12-06 21:53:02,040 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 21:53:02,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 21:53:02,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 21:53:02,041 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 21:53:02,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:53:02" (1/1) ... [2021-12-06 21:53:02,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:53:02" (1/1) ... [2021-12-06 21:53:02,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:53:02" (1/1) ... [2021-12-06 21:53:02,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:53:02" (1/1) ... [2021-12-06 21:53:02,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:53:02" (1/1) ... [2021-12-06 21:53:02,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:53:02" (1/1) ... [2021-12-06 21:53:02,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:53:02" (1/1) ... [2021-12-06 21:53:02,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 21:53:02,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 21:53:02,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 21:53:02,067 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 21:53:02,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:53:02" (1/1) ... [2021-12-06 21:53:02,072 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 21:53:02,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:53:02,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 21:53:02,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 21:53:02,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-06 21:53:02,120 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-06 21:53:02,120 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-06 21:53:02,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 21:53:02,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 21:53:02,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-06 21:53:02,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-06 21:53:02,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 21:53:02,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-06 21:53:02,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-06 21:53:02,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 21:53:02,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 21:53:02,204 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 21:53:02,205 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 21:53:02,500 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 21:53:02,507 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 21:53:02,508 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-06 21:53:02,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 09:53:02 BoogieIcfgContainer [2021-12-06 21:53:02,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 21:53:02,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 21:53:02,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 21:53:02,514 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 21:53:02,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 09:53:01" (1/3) ... [2021-12-06 21:53:02,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698778d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 09:53:02, skipping insertion in model container [2021-12-06 21:53:02,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:53:02" (2/3) ... [2021-12-06 21:53:02,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698778d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 09:53:02, skipping insertion in model container [2021-12-06 21:53:02,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 09:53:02" (3/3) ... [2021-12-06 21:53:02,517 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2021-12-06 21:53:02,522 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 21:53:02,523 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2021-12-06 21:53:02,557 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 21:53:02,563 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 21:53:02,563 INFO L340 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2021-12-06 21:53:02,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:53:02,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-06 21:53:02,579 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:53:02,580 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-06 21:53:02,580 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:53:02,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:53:02,584 INFO L85 PathProgramCache]: Analyzing trace with hash 894505749, now seen corresponding path program 1 times [2021-12-06 21:53:02,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:53:02,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1580814485] [2021-12-06 21:53:02,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:53:02,594 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:53:02,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:53:02,595 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:53:02,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-06 21:53:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:53:02,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 21:53:02,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:02,727 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 21:53:02,740 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 21:53:02,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:53:02,740 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:53:02,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1580814485] [2021-12-06 21:53:02,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1580814485] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:53:02,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:53:02,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 21:53:02,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827687299] [2021-12-06 21:53:02,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:53:02,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 21:53:02,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:53:02,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 21:53:02,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 21:53:02,778 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:53:02,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:53:02,897 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2021-12-06 21:53:02,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 21:53:02,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-06 21:53:02,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:53:02,907 INFO L225 Difference]: With dead ends: 81 [2021-12-06 21:53:02,907 INFO L226 Difference]: Without dead ends: 78 [2021-12-06 21:53:02,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 21:53:02,912 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:53:02,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 135 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:53:02,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-06 21:53:02,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-12-06 21:53:02,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:53:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2021-12-06 21:53:02,951 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2021-12-06 21:53:02,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:53:02,951 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2021-12-06 21:53:02,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:53:02,952 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2021-12-06 21:53:02,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-06 21:53:02,952 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:53:02,952 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-06 21:53:02,960 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-06 21:53:03,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:53:03,153 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:53:03,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:53:03,155 INFO L85 PathProgramCache]: Analyzing trace with hash 894505750, now seen corresponding path program 1 times [2021-12-06 21:53:03,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:53:03,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451583824] [2021-12-06 21:53:03,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:53:03,157 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:53:03,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:53:03,158 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:53:03,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-06 21:53:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:53:03,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 21:53:03,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:03,298 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 21:53:03,318 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 21:53:03,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:53:03,319 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:53:03,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451583824] [2021-12-06 21:53:03,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451583824] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:53:03,319 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:53:03,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 21:53:03,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658278034] [2021-12-06 21:53:03,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:53:03,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 21:53:03,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:53:03,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 21:53:03,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 21:53:03,321 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:53:03,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:53:03,426 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2021-12-06 21:53:03,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 21:53:03,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-06 21:53:03,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:53:03,428 INFO L225 Difference]: With dead ends: 76 [2021-12-06 21:53:03,428 INFO L226 Difference]: Without dead ends: 76 [2021-12-06 21:53:03,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 21:53:03,430 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:53:03,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:53:03,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-06 21:53:03,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-12-06 21:53:03,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:53:03,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-12-06 21:53:03,437 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 6 [2021-12-06 21:53:03,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:53:03,437 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-12-06 21:53:03,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:53:03,437 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-12-06 21:53:03,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-06 21:53:03,437 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:53:03,438 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:53:03,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-06 21:53:03,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:53:03,639 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:53:03,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:53:03,641 INFO L85 PathProgramCache]: Analyzing trace with hash -835957545, now seen corresponding path program 1 times [2021-12-06 21:53:03,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:53:03,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477249976] [2021-12-06 21:53:03,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:53:03,645 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:53:03,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:53:03,648 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:53:03,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-06 21:53:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:53:03,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 21:53:03,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:03,823 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 21:53:03,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:53:03,824 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:53:03,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477249976] [2021-12-06 21:53:03,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477249976] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:53:03,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:53:03,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 21:53:03,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484854858] [2021-12-06 21:53:03,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:53:03,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 21:53:03,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:53:03,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 21:53:03,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 21:53:03,825 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 21:53:03,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:53:03,835 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2021-12-06 21:53:03,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 21:53:03,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-12-06 21:53:03,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:53:03,836 INFO L225 Difference]: With dead ends: 83 [2021-12-06 21:53:03,836 INFO L226 Difference]: Without dead ends: 83 [2021-12-06 21:53:03,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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 21:53:03,838 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:53:03,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 159 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:53:03,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-06 21:53:03,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2021-12-06 21:53:03,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:53:03,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2021-12-06 21:53:03,845 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 13 [2021-12-06 21:53:03,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:53:03,846 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2021-12-06 21:53:03,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 21:53:03,846 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2021-12-06 21:53:03,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-06 21:53:03,846 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:53:03,846 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:53:03,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-06 21:53:04,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:53:04,048 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:53:04,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:53:04,050 INFO L85 PathProgramCache]: Analyzing trace with hash -125034980, now seen corresponding path program 1 times [2021-12-06 21:53:04,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:53:04,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145831563] [2021-12-06 21:53:04,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:53:04,053 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:53:04,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:53:04,055 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:53:04,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-06 21:53:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:53:04,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 21:53:04,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:04,201 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 21:53:04,240 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 21:53:04,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:53:04,240 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:53:04,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145831563] [2021-12-06 21:53:04,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145831563] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:53:04,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:53:04,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 21:53:04,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200205997] [2021-12-06 21:53:04,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:53:04,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 21:53:04,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:53:04,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 21:53:04,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:53:04,242 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:53:04,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:53:04,454 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2021-12-06 21:53:04,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 21:53:04,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-12-06 21:53:04,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:53:04,456 INFO L225 Difference]: With dead ends: 97 [2021-12-06 21:53:04,456 INFO L226 Difference]: Without dead ends: 97 [2021-12-06 21:53:04,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:53:04,457 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 68 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 21:53:04,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 227 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 21:53:04,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-06 21:53:04,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2021-12-06 21:53:04,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:53:04,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-12-06 21:53:04,463 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2021-12-06 21:53:04,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:53:04,464 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-12-06 21:53:04,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:53:04,464 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-12-06 21:53:04,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-06 21:53:04,465 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:53:04,465 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:53:04,472 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-06 21:53:04,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:53:04,666 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:53:04,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:53:04,678 INFO L85 PathProgramCache]: Analyzing trace with hash -125034979, now seen corresponding path program 1 times [2021-12-06 21:53:04,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:53:04,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831240460] [2021-12-06 21:53:04,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:53:04,680 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:53:04,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:53:04,682 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:53:04,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-06 21:53:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:53:04,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-06 21:53:04,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:04,878 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 21:53:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 21:53:04,947 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:53:04,947 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:53:04,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831240460] [2021-12-06 21:53:04,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831240460] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:53:04,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:53:04,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 21:53:04,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33924463] [2021-12-06 21:53:04,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:53:04,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 21:53:04,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:53:04,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 21:53:04,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:53:04,948 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:53:05,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:53:05,154 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2021-12-06 21:53:05,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 21:53:05,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2021-12-06 21:53:05,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:53:05,155 INFO L225 Difference]: With dead ends: 76 [2021-12-06 21:53:05,155 INFO L226 Difference]: Without dead ends: 76 [2021-12-06 21:53:05,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:53:05,156 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 69 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 21:53:05,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 236 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 21:53:05,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-06 21:53:05,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2021-12-06 21:53:05,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:53:05,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2021-12-06 21:53:05,161 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 22 [2021-12-06 21:53:05,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:53:05,161 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2021-12-06 21:53:05,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:53:05,162 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2021-12-06 21:53:05,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-06 21:53:05,162 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:53:05,162 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:53:05,170 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-06 21:53:05,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:53:05,364 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:53:05,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:53:05,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454715, now seen corresponding path program 1 times [2021-12-06 21:53:05,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:53:05,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8589773] [2021-12-06 21:53:05,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:53:05,368 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:53:05,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:53:05,371 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:53:05,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-06 21:53:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:53:05,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 21:53:05,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:05,474 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 21:53:05,635 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 21:53:05,635 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 23 treesize of output 30 [2021-12-06 21:53:05,665 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 21:53:05,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:53:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 21:53:05,866 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:53:05,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8589773] [2021-12-06 21:53:05,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8589773] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:53:05,867 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:53:05,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-12-06 21:53:05,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34211932] [2021-12-06 21:53:05,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:53:05,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 21:53:05,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:53:05,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 21:53:05,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-06 21:53:05,868 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 21:53:06,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:53:06,082 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2021-12-06 21:53:06,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 21:53:06,082 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2021-12-06 21:53:06,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:53:06,083 INFO L225 Difference]: With dead ends: 101 [2021-12-06 21:53:06,083 INFO L226 Difference]: Without dead ends: 101 [2021-12-06 21:53:06,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-06 21:53:06,084 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 62 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 21:53:06,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 314 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 36 Unchecked, 0.2s Time] [2021-12-06 21:53:06,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-06 21:53:06,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2021-12-06 21:53:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 76 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:53:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2021-12-06 21:53:06,089 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 25 [2021-12-06 21:53:06,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:53:06,089 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2021-12-06 21:53:06,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 21:53:06,090 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2021-12-06 21:53:06,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-06 21:53:06,090 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:53:06,090 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:53:06,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-06 21:53:06,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:53:06,292 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:53:06,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:53:06,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454714, now seen corresponding path program 1 times [2021-12-06 21:53:06,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:53:06,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943000208] [2021-12-06 21:53:06,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:53:06,296 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:53:06,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:53:06,298 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:53:06,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-06 21:53:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:53:06,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-06 21:53:06,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:06,432 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 21:53:06,436 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 21:53:08,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:53:08,665 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 21:53:08,675 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:53:08,675 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 21:53:08,715 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:53:08,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:53:08,956 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:53:08,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943000208] [2021-12-06 21:53:08,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943000208] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:53:08,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [732719181] [2021-12-06 21:53:08,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:53:08,957 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 21:53:08,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 21:53:08,958 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 21:53:08,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2021-12-06 21:53:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:53:09,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-06 21:53:09,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:09,104 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 21:53:09,111 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 21:53:11,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:53:11,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 12 treesize of output 14 [2021-12-06 21:53:11,307 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:53:11,307 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 21:53:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:53:11,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:53:11,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [732719181] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:53:11,537 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:53:11,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2021-12-06 21:53:11,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103105236] [2021-12-06 21:53:11,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:53:11,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 21:53:11,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:53:11,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 21:53:11,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=86, Unknown=1, NotChecked=0, Total=110 [2021-12-06 21:53:11,538 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:53:11,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:53:11,896 INFO L93 Difference]: Finished difference Result 163 states and 177 transitions. [2021-12-06 21:53:11,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 21:53:11,897 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-12-06 21:53:11,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:53:11,898 INFO L225 Difference]: With dead ends: 163 [2021-12-06 21:53:11,898 INFO L226 Difference]: Without dead ends: 163 [2021-12-06 21:53:11,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=31, Invalid=124, Unknown=1, NotChecked=0, Total=156 [2021-12-06 21:53:11,899 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 139 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 21:53:11,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 331 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 177 Invalid, 0 Unknown, 47 Unchecked, 0.3s Time] [2021-12-06 21:53:11,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-06 21:53:11,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 87. [2021-12-06 21:53:11,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.459016393442623) internal successors, (89), 81 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 21:53:11,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-12-06 21:53:11,906 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 25 [2021-12-06 21:53:11,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:53:11,906 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-12-06 21:53:11,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:53:11,907 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-12-06 21:53:11,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-06 21:53:11,907 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:53:11,907 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:53:11,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2021-12-06 21:53:12,121 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-06 21:53:12,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:53:12,310 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:53:12,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:53:12,311 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866825, now seen corresponding path program 1 times [2021-12-06 21:53:12,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:53:12,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875802283] [2021-12-06 21:53:12,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:53:12,313 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:53:12,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:53:12,315 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:53:12,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-06 21:53:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:53:12,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 21:53:12,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 21:53:12,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:53:12,450 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:53:12,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875802283] [2021-12-06 21:53:12,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [875802283] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:53:12,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:53:12,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 21:53:12,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032873080] [2021-12-06 21:53:12,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:53:12,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 21:53:12,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:53:12,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 21:53:12,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 21:53:12,452 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:53:12,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:53:12,495 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2021-12-06 21:53:12,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 21:53:12,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-06 21:53:12,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:53:12,497 INFO L225 Difference]: With dead ends: 118 [2021-12-06 21:53:12,497 INFO L226 Difference]: Without dead ends: 118 [2021-12-06 21:53:12,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:53:12,498 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 124 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:53:12,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 223 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:53:12,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-06 21:53:12,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 90. [2021-12-06 21:53:12,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.4375) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 21:53:12,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2021-12-06 21:53:12,503 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 30 [2021-12-06 21:53:12,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:53:12,503 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2021-12-06 21:53:12,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:53:12,503 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2021-12-06 21:53:12,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-06 21:53:12,504 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:53:12,504 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:53:12,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-06 21:53:12,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:53:12,706 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:53:12,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:53:12,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866881, now seen corresponding path program 1 times [2021-12-06 21:53:12,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:53:12,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109514764] [2021-12-06 21:53:12,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:53:12,709 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:53:12,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:53:12,711 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:53:12,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-06 21:53:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:53:12,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-06 21:53:12,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:12,852 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 21:53:12,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 21:53:12,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:53:12,998 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:53:12,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1109514764] [2021-12-06 21:53:12,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1109514764] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:53:12,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:53:12,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 21:53:12,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413242917] [2021-12-06 21:53:12,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:53:12,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 21:53:12,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:53:12,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 21:53:12,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-06 21:53:12,999 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:53:13,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:53:13,578 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2021-12-06 21:53:13,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 21:53:13,579 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-06 21:53:13,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:53:13,580 INFO L225 Difference]: With dead ends: 142 [2021-12-06 21:53:13,580 INFO L226 Difference]: Without dead ends: 142 [2021-12-06 21:53:13,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-06 21:53:13,581 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 315 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 21:53:13,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 430 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 21:53:13,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-06 21:53:13,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 93. [2021-12-06 21:53:13,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.462686567164179) internal successors, (98), 87 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 21:53:13,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2021-12-06 21:53:13,585 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 30 [2021-12-06 21:53:13,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:53:13,585 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2021-12-06 21:53:13,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:53:13,585 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2021-12-06 21:53:13,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-06 21:53:13,586 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:53:13,586 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:53:13,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-06 21:53:13,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:53:13,788 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:53:13,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:53:13,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866880, now seen corresponding path program 1 times [2021-12-06 21:53:13,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:53:13,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394836929] [2021-12-06 21:53:13,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:53:13,791 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:53:13,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:53:13,792 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:53:13,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-06 21:53:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:53:13,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 21:53:13,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:13,950 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 21:53:14,022 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 21:53:14,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:53:14,022 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:53:14,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394836929] [2021-12-06 21:53:14,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394836929] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:53:14,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:53:14,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 21:53:14,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869993013] [2021-12-06 21:53:14,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:53:14,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 21:53:14,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:53:14,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 21:53:14,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-06 21:53:14,024 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:53:14,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:53:14,463 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2021-12-06 21:53:14,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 21:53:14,464 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-06 21:53:14,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:53:14,465 INFO L225 Difference]: With dead ends: 113 [2021-12-06 21:53:14,465 INFO L226 Difference]: Without dead ends: 113 [2021-12-06 21:53:14,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-06 21:53:14,466 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 294 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 293 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.4s IncrementalHoareTripleChecker+Time [2021-12-06 21:53:14,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 293 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 21:53:14,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-06 21:53:14,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 93. [2021-12-06 21:53:14,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 87 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 21:53:14,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2021-12-06 21:53:14,471 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 30 [2021-12-06 21:53:14,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:53:14,472 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2021-12-06 21:53:14,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:53:14,472 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2021-12-06 21:53:14,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-06 21:53:14,473 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:53:14,473 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:53:14,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-12-06 21:53:14,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:53:14,674 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:53:14,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:53:14,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829059, now seen corresponding path program 1 times [2021-12-06 21:53:14,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:53:14,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1198926192] [2021-12-06 21:53:14,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:53:14,675 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:53:14,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:53:14,676 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:53:14,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-06 21:53:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:53:14,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-06 21:53:14,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:14,803 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 21:53:14,886 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:53:14,886 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 21:53:14,928 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 21:53:14,995 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:53:14,995 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 30 treesize of output 31 [2021-12-06 21:53:15,142 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 30 treesize of output 18 [2021-12-06 21:53:15,193 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:53:15,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:53:15,367 INFO L354 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2021-12-06 21:53:15,367 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 33 treesize of output 32 [2021-12-06 21:53:15,372 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2021-12-06 21:53:15,382 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2021-12-06 21:53:15,389 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:53:15,389 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-06 21:53:15,391 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 30 treesize of output 22 [2021-12-06 21:53:15,394 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 21:53:15,510 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:53:15,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1198926192] [2021-12-06 21:53:15,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1198926192] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:53:15,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [818039071] [2021-12-06 21:53:15,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:53:15,510 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 21:53:15,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 21:53:15,511 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 21:53:15,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2021-12-06 21:53:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:53:15,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-06 21:53:15,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:15,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 21:53:15,872 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 21:53:15,873 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 25 treesize of output 32 [2021-12-06 21:53:15,993 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 21:53:16,149 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:53:16,149 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 37 [2021-12-06 21:53:16,401 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 21:53:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:53:16,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:53:16,628 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_409) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))))))))))) is different from false [2021-12-06 21:53:16,727 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:53:16,727 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2021-12-06 21:53:16,729 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 60 treesize of output 52 [2021-12-06 21:53:16,733 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 21:53:24,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [818039071] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:53:24,059 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:53:24,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 30 [2021-12-06 21:53:24,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166865805] [2021-12-06 21:53:24,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:53:24,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-06 21:53:24,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:53:24,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-06 21:53:24,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1442, Unknown=7, NotChecked=234, Total=1806 [2021-12-06 21:53:24,060 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 31 states, 30 states have (on average 1.6) internal successors, (48), 27 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 21:53:25,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:53:25,524 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2021-12-06 21:53:25,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 21:53:25,525 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6) internal successors, (48), 27 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2021-12-06 21:53:25,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:53:25,526 INFO L225 Difference]: With dead ends: 133 [2021-12-06 21:53:25,526 INFO L226 Difference]: Without dead ends: 133 [2021-12-06 21:53:25,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=262, Invalid=1905, Unknown=7, NotChecked=276, Total=2450 [2021-12-06 21:53:25,528 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 208 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-06 21:53:25,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 1056 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 511 Invalid, 0 Unknown, 168 Unchecked, 0.7s Time] [2021-12-06 21:53:25,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-06 21:53:25,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 102. [2021-12-06 21:53:25,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 96 states have internal predecessors, (108), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 21:53:25,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2021-12-06 21:53:25,532 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 33 [2021-12-06 21:53:25,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:53:25,532 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2021-12-06 21:53:25,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6) internal successors, (48), 27 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 21:53:25,532 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2021-12-06 21:53:25,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-06 21:53:25,533 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:53:25,533 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:53:25,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-06 21:53:25,741 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2021-12-06 21:53:25,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt [2021-12-06 21:53:25,935 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:53:25,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:53:25,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829058, now seen corresponding path program 1 times [2021-12-06 21:53:25,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:53:25,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960789872] [2021-12-06 21:53:25,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:53:25,938 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:53:25,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:53:25,939 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:53:25,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-06 21:53:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:53:26,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-06 21:53:26,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:26,062 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 21:53:26,067 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 21:53:26,247 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:53:26,248 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 21:53:26,254 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 21:53:26,314 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 21:53:26,318 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 21:53:26,418 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:53:26,418 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 21:53:26,422 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 21:53:26,598 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 21:53:26,601 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 25 treesize of output 13 [2021-12-06 21:53:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:53:26,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:53:27,418 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_458) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_459) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_458) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2021-12-06 21:53:27,456 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_458) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_459) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_458) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32)))))) is different from false [2021-12-06 21:53:27,468 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:53:27,469 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-06 21:53:27,475 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:53:27,476 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-06 21:53:27,479 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 52 treesize of output 44 [2021-12-06 21:53:27,481 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 82 treesize of output 70 [2021-12-06 21:53:27,484 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 66 treesize of output 62 [2021-12-06 21:53:27,489 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 32 treesize of output 28 [2021-12-06 21:53:27,590 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:53:27,591 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2021-12-06 21:53:27,593 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 44 treesize of output 32 [2021-12-06 21:53:27,603 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 15 treesize of output 11 [2021-12-06 21:53:28,205 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:53:28,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960789872] [2021-12-06 21:53:28,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960789872] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:53:28,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1831561519] [2021-12-06 21:53:28,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:53:28,205 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 21:53:28,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 21:53:28,206 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 21:53:28,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2021-12-06 21:53:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:53:28,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-06 21:53:28,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:28,400 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 21:53:28,405 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 21:53:28,697 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 21:53:28,697 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 12 treesize of output 18 [2021-12-06 21:53:28,709 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:53:28,710 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 21:53:28,886 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 21:53:28,892 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 21:53:29,108 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:53:29,109 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 21:53:29,112 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 21:53:29,467 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 21:53:29,469 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 25 treesize of output 13 [2021-12-06 21:53:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:53:29,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:53:29,571 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_511 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_510) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_511 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32)))))) is different from false [2021-12-06 21:53:29,608 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_511 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_510) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_511 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32)))))) is different from false [2021-12-06 21:53:29,622 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:53:29,622 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-06 21:53:29,628 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:53:29,629 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-06 21:53:29,632 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 52 treesize of output 44 [2021-12-06 21:53:29,634 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 82 treesize of output 70 [2021-12-06 21:53:29,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 34 treesize of output 30 [2021-12-06 21:53:29,642 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 62 treesize of output 58 [2021-12-06 21:53:29,763 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:53:29,763 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2021-12-06 21:53:29,766 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 44 treesize of output 32 [2021-12-06 21:53:29,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 15 treesize of output 11 [2021-12-06 21:53:30,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1831561519] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:53:30,184 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:53:30,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 28 [2021-12-06 21:53:30,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017816106] [2021-12-06 21:53:30,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:53:30,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-06 21:53:30,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:53:30,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-06 21:53:30,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1307, Unknown=4, NotChecked=300, Total=1722 [2021-12-06 21:53:30,186 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 25 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 21:53:32,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:53:32,542 INFO L93 Difference]: Finished difference Result 213 states and 235 transitions. [2021-12-06 21:53:32,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 21:53:32,543 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 25 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2021-12-06 21:53:32,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:53:32,544 INFO L225 Difference]: With dead ends: 213 [2021-12-06 21:53:32,544 INFO L226 Difference]: Without dead ends: 213 [2021-12-06 21:53:32,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=232, Invalid=1942, Unknown=4, NotChecked=372, Total=2550 [2021-12-06 21:53:32,545 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 782 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-06 21:53:32,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [782 Valid, 1546 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 844 Invalid, 0 Unknown, 130 Unchecked, 1.5s Time] [2021-12-06 21:53:32,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-12-06 21:53:32,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 110. [2021-12-06 21:53:32,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 104 states have internal predecessors, (119), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 21:53:32,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2021-12-06 21:53:32,549 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 33 [2021-12-06 21:53:32,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:53:32,549 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2021-12-06 21:53:32,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 25 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 21:53:32,549 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2021-12-06 21:53:32,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 21:53:32,550 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:53:32,550 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:53:32,553 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2021-12-06 21:53:32,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-12-06 21:53:32,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:53:32,952 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:53:32,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:53:32,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1020012727, now seen corresponding path program 2 times [2021-12-06 21:53:32,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:53:32,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171815828] [2021-12-06 21:53:32,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 21:53:32,956 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:53:32,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:53:32,958 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:53:32,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-06 21:53:33,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 21:53:33,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:53:33,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 21:53:33,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:33,131 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 21:53:33,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:53:33,234 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 21:53:33,234 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:53:33,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171815828] [2021-12-06 21:53:33,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1171815828] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:53:33,235 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:53:33,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-06 21:53:33,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431366237] [2021-12-06 21:53:33,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:53:33,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 21:53:33,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:53:33,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 21:53:33,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-06 21:53:33,236 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 21:53:33,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:53:33,482 INFO L93 Difference]: Finished difference Result 401 states and 442 transitions. [2021-12-06 21:53:33,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 21:53:33,482 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2021-12-06 21:53:33,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:53:33,484 INFO L225 Difference]: With dead ends: 401 [2021-12-06 21:53:33,484 INFO L226 Difference]: Without dead ends: 401 [2021-12-06 21:53:33,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2021-12-06 21:53:33,485 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 1178 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:53:33,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1178 Valid, 416 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:53:33,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2021-12-06 21:53:33,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 129. [2021-12-06 21:53:33,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 123 states have internal predecessors, (143), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 21:53:33,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2021-12-06 21:53:33,490 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 36 [2021-12-06 21:53:33,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:53:33,491 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2021-12-06 21:53:33,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 21:53:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2021-12-06 21:53:33,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-06 21:53:33,492 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:53:33,492 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:53:33,500 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-06 21:53:33,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:53:33,693 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:53:33,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:53:33,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1813078092, now seen corresponding path program 2 times [2021-12-06 21:53:33,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:53:33,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587137502] [2021-12-06 21:53:33,696 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 21:53:33,696 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:53:33,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:53:33,698 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:53:33,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-06 21:53:33,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 21:53:33,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:53:33,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 21:53:33,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-06 21:53:33,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:53:33,905 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 21:53:33,906 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:53:33,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587137502] [2021-12-06 21:53:33,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587137502] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:53:33,906 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:53:33,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-06 21:53:33,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508291165] [2021-12-06 21:53:33,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:53:33,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 21:53:33,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:53:33,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 21:53:33,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:53:33,907 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-06 21:53:33,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:53:33,918 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2021-12-06 21:53:33,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 21:53:33,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2021-12-06 21:53:33,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:53:33,920 INFO L225 Difference]: With dead ends: 107 [2021-12-06 21:53:33,920 INFO L226 Difference]: Without dead ends: 107 [2021-12-06 21:53:33,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:53:33,920 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 124 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:53:33,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 161 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:53:33,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-06 21:53:33,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-12-06 21:53:33,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 102 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:53:33,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2021-12-06 21:53:33,923 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 37 [2021-12-06 21:53:33,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:53:33,923 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2021-12-06 21:53:33,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-06 21:53:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2021-12-06 21:53:33,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-06 21:53:33,927 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:53:33,927 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:53:33,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-06 21:53:34,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:53:34,128 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:53:34,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:53:34,130 INFO L85 PathProgramCache]: Analyzing trace with hash 999795886, now seen corresponding path program 1 times [2021-12-06 21:53:34,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:53:34,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718433320] [2021-12-06 21:53:34,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:53:34,131 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:53:34,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:53:34,134 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:53:34,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-06 21:53:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:53:34,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 21:53:34,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:53:34,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:53:34,513 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:53:34,514 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:53:34,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718433320] [2021-12-06 21:53:34,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718433320] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:53:34,514 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:53:34,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-06 21:53:34,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778464234] [2021-12-06 21:53:34,514 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:53:34,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 21:53:34,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:53:34,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 21:53:34,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-06 21:53:34,515 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 21:53:34,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:53:34,577 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2021-12-06 21:53:34,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 21:53:34,578 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2021-12-06 21:53:34,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:53:34,579 INFO L225 Difference]: With dead ends: 141 [2021-12-06 21:53:34,579 INFO L226 Difference]: Without dead ends: 141 [2021-12-06 21:53:34,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-12-06 21:53:34,579 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 201 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:53:34,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 297 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:53:34,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-06 21:53:34,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 116. [2021-12-06 21:53:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 111 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:53:34,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2021-12-06 21:53:34,583 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 40 [2021-12-06 21:53:34,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:53:34,583 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2021-12-06 21:53:34,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 21:53:34,583 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2021-12-06 21:53:34,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-06 21:53:34,583 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:53:34,584 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:53:34,591 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-12-06 21:53:34,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:53:34,785 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:53:34,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:53:34,786 INFO L85 PathProgramCache]: Analyzing trace with hash 968760597, now seen corresponding path program 1 times [2021-12-06 21:53:34,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:53:34,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062370727] [2021-12-06 21:53:34,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:53:34,788 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:53:34,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:53:34,788 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:53:34,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-06 21:53:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:53:34,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 21:53:34,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:34,968 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:53:34,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:53:35,065 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:53:35,065 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:53:35,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062370727] [2021-12-06 21:53:35,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062370727] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:53:35,065 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:53:35,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-06 21:53:35,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274199718] [2021-12-06 21:53:35,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:53:35,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 21:53:35,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:53:35,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 21:53:35,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-06 21:53:35,066 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 21:53:35,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:53:35,170 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2021-12-06 21:53:35,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 21:53:35,171 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-06 21:53:35,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:53:35,171 INFO L225 Difference]: With dead ends: 100 [2021-12-06 21:53:35,171 INFO L226 Difference]: Without dead ends: 100 [2021-12-06 21:53:35,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2021-12-06 21:53:35,172 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 325 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:53:35,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 271 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:53:35,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-06 21:53:35,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2021-12-06 21:53:35,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.356164383561644) internal successors, (99), 88 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:53:35,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2021-12-06 21:53:35,175 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 41 [2021-12-06 21:53:35,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:53:35,175 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2021-12-06 21:53:35,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 21:53:35,176 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2021-12-06 21:53:35,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-06 21:53:35,176 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:53:35,176 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:53:35,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-06 21:53:35,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:53:35,378 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:53:35,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:53:35,379 INFO L85 PathProgramCache]: Analyzing trace with hash 884092026, now seen corresponding path program 2 times [2021-12-06 21:53:35,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:53:35,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098130940] [2021-12-06 21:53:35,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 21:53:35,381 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:53:35,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:53:35,383 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:53:35,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-06 21:53:35,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-06 21:53:35,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:53:35,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 21:53:35,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:35,518 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 21:53:35,611 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 21:53:35,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:53:35,612 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:53:35,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098130940] [2021-12-06 21:53:35,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098130940] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:53:35,612 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:53:35,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 21:53:35,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427471678] [2021-12-06 21:53:35,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:53:35,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 21:53:35,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:53:35,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 21:53:35,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-06 21:53:35,613 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:53:36,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:53:36,025 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2021-12-06 21:53:36,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 21:53:36,025 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2021-12-06 21:53:36,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:53:36,026 INFO L225 Difference]: With dead ends: 121 [2021-12-06 21:53:36,026 INFO L226 Difference]: Without dead ends: 121 [2021-12-06 21:53:36,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-06 21:53:36,027 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 269 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 21:53:36,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 264 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 21:53:36,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-06 21:53:36,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 99. [2021-12-06 21:53:36,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 94 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:53:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2021-12-06 21:53:36,029 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 45 [2021-12-06 21:53:36,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:53:36,030 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2021-12-06 21:53:36,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:53:36,030 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2021-12-06 21:53:36,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-06 21:53:36,030 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:53:36,030 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:53:36,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-06 21:53:36,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:53:36,231 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:53:36,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:53:36,233 INFO L85 PathProgramCache]: Analyzing trace with hash 884092027, now seen corresponding path program 1 times [2021-12-06 21:53:36,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:53:36,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443220146] [2021-12-06 21:53:36,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:53:36,234 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:53:36,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:53:36,237 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:53:36,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-06 21:53:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:53:36,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-06 21:53:36,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:36,405 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 21:53:36,573 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 21:53:36,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:53:36,573 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:53:36,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443220146] [2021-12-06 21:53:36,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443220146] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:53:36,573 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:53:36,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 21:53:36,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550897471] [2021-12-06 21:53:36,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:53:36,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 21:53:36,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:53:36,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 21:53:36,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-06 21:53:36,574 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:53:37,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:53:37,038 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2021-12-06 21:53:37,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 21:53:37,039 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2021-12-06 21:53:37,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:53:37,040 INFO L225 Difference]: With dead ends: 139 [2021-12-06 21:53:37,040 INFO L226 Difference]: Without dead ends: 139 [2021-12-06 21:53:37,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-06 21:53:37,040 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 409 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 21:53:37,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 259 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 21:53:37,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-06 21:53:37,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 99. [2021-12-06 21:53:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 94 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:53:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2021-12-06 21:53:37,043 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 45 [2021-12-06 21:53:37,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:53:37,043 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2021-12-06 21:53:37,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:53:37,044 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2021-12-06 21:53:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-06 21:53:37,044 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:53:37,044 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:53:37,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2021-12-06 21:53:37,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:53:37,245 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:53:37,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:53:37,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140989, now seen corresponding path program 1 times [2021-12-06 21:53:37,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:53:37,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529393671] [2021-12-06 21:53:37,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:53:37,248 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:53:37,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:53:37,250 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:53:37,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-06 21:53:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:53:37,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 21:53:37,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:37,494 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-06 21:53:37,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:53:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-06 21:53:37,636 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:53:37,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529393671] [2021-12-06 21:53:37,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [529393671] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:53:37,636 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:53:37,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-06 21:53:37,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721557860] [2021-12-06 21:53:37,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:53:37,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 21:53:37,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:53:37,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 21:53:37,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-06 21:53:37,637 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 21:53:37,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:53:37,830 INFO L93 Difference]: Finished difference Result 179 states and 189 transitions. [2021-12-06 21:53:37,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 21:53:37,830 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2021-12-06 21:53:37,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:53:37,831 INFO L225 Difference]: With dead ends: 179 [2021-12-06 21:53:37,831 INFO L226 Difference]: Without dead ends: 179 [2021-12-06 21:53:37,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2021-12-06 21:53:37,832 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 406 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:53:37,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 408 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:53:37,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-12-06 21:53:37,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 101. [2021-12-06 21:53:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.308641975308642) internal successors, (106), 96 states have internal predecessors, (106), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:53:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2021-12-06 21:53:37,835 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 48 [2021-12-06 21:53:37,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:53:37,835 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2021-12-06 21:53:37,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 21:53:37,835 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2021-12-06 21:53:37,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-06 21:53:37,835 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:53:37,835 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:53:37,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-12-06 21:53:38,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:53:38,036 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:53:38,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:53:38,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140934, now seen corresponding path program 1 times [2021-12-06 21:53:38,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:53:38,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641425159] [2021-12-06 21:53:38,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:53:38,039 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:53:38,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:53:38,041 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:53:38,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-06 21:53:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:53:38,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-06 21:53:38,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:38,269 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 21:53:38,361 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:53:38,361 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 21:53:38,408 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 21:53:38,485 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:53:38,485 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 21:53:38,745 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:53:38,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 31 treesize of output 32 [2021-12-06 21:53:38,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:53:38,788 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 34 treesize of output 29 [2021-12-06 21:53:38,864 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 29 treesize of output 17 [2021-12-06 21:53:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 21:53:38,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:53:39,331 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_915) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))))))) (_ bv1 1)))) is different from false [2021-12-06 21:53:39,341 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_915) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))))))))))))) is different from false [2021-12-06 21:53:39,356 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_915) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 21:53:39,368 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_915) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 21:53:39,377 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_915) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 21:53:39,396 INFO L354 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2021-12-06 21:53:39,396 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 51 treesize of output 50 [2021-12-06 21:53:39,404 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_914 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_914))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_915)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2021-12-06 21:53:39,419 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_914 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_914))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_915)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2021-12-06 21:53:39,426 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:53:39,426 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2021-12-06 21:53:39,429 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 136 treesize of output 112 [2021-12-06 21:53:39,432 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 108 treesize of output 98 [2021-12-06 21:53:39,434 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 98 treesize of output 94 [2021-12-06 21:53:39,685 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:53:39,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641425159] [2021-12-06 21:53:39,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641425159] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:53:39,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [819163829] [2021-12-06 21:53:39,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:53:39,686 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 21:53:39,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 21:53:39,686 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 21:53:39,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2021-12-06 21:53:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:53:39,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-06 21:53:39,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:39,995 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 21:53:40,197 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 21:53:40,197 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 23 treesize of output 30 [2021-12-06 21:53:40,313 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 21:53:40,476 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:53:40,477 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 34 treesize of output 35 [2021-12-06 21:53:40,941 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:53:40,941 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 34 treesize of output 35 [2021-12-06 21:53:41,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:53:41,178 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 38 treesize of output 33 [2021-12-06 21:53:41,579 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 31 treesize of output 19 [2021-12-06 21:53:41,731 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 21:53:41,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:53:44,105 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_975) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))))))) (_ bv1 1)))) is different from false [2021-12-06 21:53:44,117 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_975) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))))))))))) is different from false [2021-12-06 21:53:44,127 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_975) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 21:53:44,140 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_975) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))))))))))))) is different from false [2021-12-06 21:53:44,150 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 21:53:44,160 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_975) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))))))))))))))))) is different from false [2021-12-06 21:53:44,171 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_974))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_975)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 21:53:44,188 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_974))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_975)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))))))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 21:53:44,198 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:53:44,198 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2021-12-06 21:53:44,200 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 228 treesize of output 204 [2021-12-06 21:53:44,205 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 200 treesize of output 190 [2021-12-06 21:53:44,207 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 190 treesize of output 186 [2021-12-06 21:53:59,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [819163829] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:53:59,215 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:53:59,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 36 [2021-12-06 21:53:59,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317026833] [2021-12-06 21:53:59,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:53:59,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-06 21:53:59,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:53:59,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-06 21:53:59,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2013, Unknown=23, NotChecked=1560, Total=3782 [2021-12-06 21:53:59,217 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 37 states, 36 states have (on average 2.0) internal successors, (72), 33 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 21:54:01,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:54:01,224 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2021-12-06 21:54:01,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-06 21:54:01,225 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0) internal successors, (72), 33 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2021-12-06 21:54:01,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:54:01,226 INFO L225 Difference]: With dead ends: 160 [2021-12-06 21:54:01,226 INFO L226 Difference]: Without dead ends: 160 [2021-12-06 21:54:01,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 76 SyntacticMatches, 18 SemanticMatches, 70 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=339, Invalid=2890, Unknown=23, NotChecked=1860, Total=5112 [2021-12-06 21:54:01,228 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 400 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:54:01,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [400 Valid, 1161 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 743 Invalid, 0 Unknown, 114 Unchecked, 1.1s Time] [2021-12-06 21:54:01,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-06 21:54:01,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2021-12-06 21:54:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 100 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:54:01,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2021-12-06 21:54:01,231 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 48 [2021-12-06 21:54:01,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:54:01,231 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2021-12-06 21:54:01,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0) internal successors, (72), 33 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-06 21:54:01,231 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2021-12-06 21:54:01,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-06 21:54:01,231 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:54:01,232 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:54:01,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-06 21:54:01,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2021-12-06 21:54:01,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt [2021-12-06 21:54:01,633 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:54:01,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:54:01,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140935, now seen corresponding path program 1 times [2021-12-06 21:54:01,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:54:01,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090386299] [2021-12-06 21:54:01,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:54:01,636 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:54:01,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:54:01,637 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:54:01,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-06 21:54:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:54:01,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-06 21:54:01,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:54:01,928 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 21:54:01,932 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 21:54:02,167 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 21:54:02,167 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 12 treesize of output 18 [2021-12-06 21:54:02,180 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:54:02,180 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 21:54:02,277 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 21:54:02,282 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 21:54:02,414 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:54:02,414 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 21:54:02,418 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 21:54:02,812 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:54:02,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, 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 21:54:02,816 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 21:54:02,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:54:02,879 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 21:54:02,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:54:02,886 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 31 treesize of output 26 [2021-12-06 21:54:03,004 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 25 treesize of output 13 [2021-12-06 21:54:03,007 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 15 treesize of output 7 [2021-12-06 21:54:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 21:54:03,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:54:04,538 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1040 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1040 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2021-12-06 21:54:04,580 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1040 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1040 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2021-12-06 21:54:04,612 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1040 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1040) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1040 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1040) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd .cse1 (_ bv8 32)))))) is different from false [2021-12-06 21:54:04,653 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1040 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1040) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1041) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1040 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1040) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) is different from false [2021-12-06 21:54:04,684 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1040 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1040) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1040 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1040) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1041) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))) is different from false [2021-12-06 21:54:04,712 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1040 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1040) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1040 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1040) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1041) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2021-12-06 21:54:04,763 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1039 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1038))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1039) .cse0 v_ArrVal_1040) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1041) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_1040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1039 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1039) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1038) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1040) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) is different from false [2021-12-06 21:54:04,832 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1039 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1039) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1038) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1040) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1039 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1038))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1039) .cse1 v_ArrVal_1040) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1041) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) is different from false [2021-12-06 21:54:04,859 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:54:04,859 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2021-12-06 21:54:04,870 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:54:04,870 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2021-12-06 21:54:04,876 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 290 [2021-12-06 21:54:04,884 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 1098 treesize of output 1046 [2021-12-06 21:54:04,899 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 1042 treesize of output 994 [2021-12-06 21:54:04,908 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 994 treesize of output 970 [2021-12-06 21:54:04,915 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 970 treesize of output 906 [2021-12-06 21:54:04,923 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 906 treesize of output 858 [2021-12-06 21:54:24,065 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:54:24,065 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2021-12-06 21:54:24,076 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:54:24,077 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2021-12-06 21:54:24,082 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 84 treesize of output 72 [2021-12-06 21:54:24,086 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 362 treesize of output 326 [2021-12-06 21:54:24,093 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 322 treesize of output 306 [2021-12-06 21:54:24,117 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 158 treesize of output 146 [2021-12-06 21:54:24,122 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 294 treesize of output 262 [2021-12-06 21:54:25,279 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:54:25,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090386299] [2021-12-06 21:54:25,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090386299] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:54:25,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1312586981] [2021-12-06 21:54:25,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:54:25,279 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 21:54:25,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 21:54:25,280 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 21:54:25,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2021-12-06 21:54:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:54:25,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-06 21:54:25,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:54:25,598 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 21:54:25,604 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 21:54:25,731 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:54:25,731 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 21:54:25,742 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 21:54:25,763 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 21:54:25,767 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 21:54:25,819 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:54:25,819 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 21:54:25,823 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 21:54:25,918 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:54:25,918 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 21:54:25,922 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 21:54:25,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:54:25,974 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 21:54:25,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:54:25,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-06 21:54:26,030 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 25 treesize of output 13 [2021-12-06 21:54:26,033 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 15 treesize of output 7 [2021-12-06 21:54:26,042 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 21:54:26,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:54:27,207 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1112 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1111) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1112) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1111) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2021-12-06 21:54:27,246 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1112 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1111) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1112) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1111) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32)))))) is different from false [2021-12-06 21:54:27,275 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1112 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1111) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1112) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1111) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) is different from false [2021-12-06 21:54:27,316 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1111) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1112 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1111) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1112) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2021-12-06 21:54:27,347 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1111) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1112 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1111) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1112) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))) is different from false [2021-12-06 21:54:27,377 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1112 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1111) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1112) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1111) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd .cse1 (_ bv8 32)))))) is different from false [2021-12-06 21:54:27,428 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1109 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1109) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1108) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1111) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1112 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1109 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1108))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1109) .cse1 v_ArrVal_1111) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1112) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) is different from false [2021-12-06 21:54:27,486 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1109 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1109) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1108) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1111) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1112 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1109 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1108))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1109) .cse1 v_ArrVal_1111) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1112) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) is different from false [2021-12-06 21:54:27,508 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:54:27,508 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2021-12-06 21:54:27,515 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:54:27,515 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2021-12-06 21:54:27,519 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 84 treesize of output 72 [2021-12-06 21:54:27,522 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 270 treesize of output 242 [2021-12-06 21:54:27,525 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 238 treesize of output 226 [2021-12-06 21:54:27,545 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 78 treesize of output 70 [2021-12-06 21:54:27,549 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 218 treesize of output 194 [2021-12-06 21:54:27,803 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:54:27,803 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2021-12-06 21:54:27,816 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:54:27,816 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2021-12-06 21:54:27,819 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:54:27,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2021-12-06 21:54:27,826 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:54:27,827 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:54:27,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2021-12-06 21:54:27,835 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 13 treesize of output 11 [2021-12-06 21:54:28,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1312586981] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:54:28,308 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:54:28,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2021-12-06 21:54:28,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437658147] [2021-12-06 21:54:28,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:54:28,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-06 21:54:28,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:54:28,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-06 21:54:28,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=867, Unknown=16, NotChecked=1168, Total=2162 [2021-12-06 21:54:28,310 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 19 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:54:30,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:54:30,456 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2021-12-06 21:54:30,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-06 21:54:30,456 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 19 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2021-12-06 21:54:30,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:54:30,457 INFO L225 Difference]: With dead ends: 172 [2021-12-06 21:54:30,457 INFO L226 Difference]: Without dead ends: 172 [2021-12-06 21:54:30,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 102 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 16 IntricatePredicates, 1 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=215, Invalid=1639, Unknown=16, NotChecked=1552, Total=3422 [2021-12-06 21:54:30,459 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 348 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:54:30,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 1325 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 676 Invalid, 0 Unknown, 111 Unchecked, 1.0s Time] [2021-12-06 21:54:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-12-06 21:54:30,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 104. [2021-12-06 21:54:30,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 99 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:54:30,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2021-12-06 21:54:30,461 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 48 [2021-12-06 21:54:30,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:54:30,461 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2021-12-06 21:54:30,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 19 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:54:30,462 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2021-12-06 21:54:30,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-06 21:54:30,462 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:54:30,462 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:54:30,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2021-12-06 21:54:30,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2021-12-06 21:54:30,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:54:30,864 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:54:30,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:54:30,865 INFO L85 PathProgramCache]: Analyzing trace with hash 836425368, now seen corresponding path program 1 times [2021-12-06 21:54:30,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:54:30,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885328080] [2021-12-06 21:54:30,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:54:30,867 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:54:30,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:54:30,869 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:54:30,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-06 21:54:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:54:31,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 73 conjunts are in the unsatisfiable core [2021-12-06 21:54:31,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:54:31,115 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 21:54:31,214 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:54:31,214 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 21 treesize of output 21 [2021-12-06 21:54:31,265 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 21:54:31,270 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 21:54:31,340 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:54:31,341 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 21:54:31,344 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 10 treesize of output 9 [2021-12-06 21:54:31,772 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:54:31,772 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 21:54:31,776 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 29 treesize of output 21 [2021-12-06 21:54:31,779 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 32 treesize of output 34 [2021-12-06 21:54:32,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:54:32,041 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 43 treesize of output 38 [2021-12-06 21:54:32,046 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 30 [2021-12-06 21:54:32,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:54:32,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 0 case distinctions, treesize of input 35 treesize of output 34 [2021-12-06 21:54:32,392 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 37 treesize of output 25 [2021-12-06 21:54:32,397 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 25 treesize of output 17 [2021-12-06 21:54:32,625 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 23 treesize of output 11 [2021-12-06 21:54:32,914 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 21:54:32,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:54:33,717 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1183 (_ BitVec 32)) (v_ArrVal_1186 (_ BitVec 32))) (= (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|) (bvadd (_ bv1 32) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1185) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_1183)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_1186)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) is different from false [2021-12-06 21:54:33,751 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1183 (_ BitVec 32)) (v_ArrVal_1186 (_ BitVec 32))) (= (bvadd (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1185) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1183) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv4 32) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1186) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (_ bv1 32)) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-06 21:54:33,784 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:54:33,784 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2021-12-06 21:54:33,803 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:54:33,803 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 104 treesize of output 107 [2021-12-06 21:54:33,812 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 39 treesize of output 23 [2021-12-06 21:54:33,910 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1183 (_ BitVec 32)) (v_ArrVal_1179 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1179) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_1183) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_1181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1186 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_1186) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_1183 (_ BitVec 32)) (v_ArrVal_1179 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1179) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_1183) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (= (bvadd |c_ULTIMATE.start_sll_circular_update_at_~data#1| (_ bv1 32)) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-06 21:54:33,949 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1183 (_ BitVec 32)) (v_ArrVal_1179 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1179) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_1183) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1183 (_ BitVec 32)) (v_ArrVal_1179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1179) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_1183) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|)) (forall ((v_ArrVal_1181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1186 (_ BitVec 32))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1181) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_1186) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|)) (= (bvadd |c_ULTIMATE.start_sll_circular_update_at_~data#1| (_ bv1 32)) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-06 21:54:33,974 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1186 (_ BitVec 32))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1181) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_1186) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (forall ((v_ArrVal_1183 (_ BitVec 32)) (v_ArrVal_1179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1179) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_1183) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1183 (_ BitVec 32)) (v_ArrVal_1179 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1179) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_1183) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (= (bvadd |c_ULTIMATE.start_sll_circular_update_at_~data#1| (_ bv1 32)) (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-06 21:54:34,015 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1186 (_ BitVec 32))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1181) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_1186) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_1183 (_ BitVec 32)) (v_ArrVal_1179 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1179) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_1183) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (= |c_ULTIMATE.start_main_~len~0#1| (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv1 32))) (forall ((v_ArrVal_1183 (_ BitVec 32)) (v_ArrVal_1179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1179) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_1183) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2021-12-06 21:54:34,035 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1183 (_ BitVec 32)) (v_ArrVal_1179 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1179) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1183) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (forall ((v_ArrVal_1181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1186 (_ BitVec 32))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1181) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1186) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (forall ((v_ArrVal_1183 (_ BitVec 32)) (v_ArrVal_1179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1179) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1183) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) .cse0)))) is different from false [2021-12-06 21:54:34,053 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1186 (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1181) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1186) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (forall ((v_ArrVal_1183 (_ BitVec 32)) (v_ArrVal_1179 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1179) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1183) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1183 (_ BitVec 32)) (v_ArrVal_1179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1179) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1183) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse0)))) is different from false [2021-12-06 21:54:34,078 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1186 (_ BitVec 32))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1178))) (= (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (select (store (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1181) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1186) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_1177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1183 (_ BitVec 32)) (v_ArrVal_1179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1177))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= .cse1 (select (store (select (store .cse2 .cse1 v_ArrVal_1179) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1183) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (forall ((v_ArrVal_1177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1183 (_ BitVec 32)) (v_ArrVal_1179 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (store (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1177))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1179)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1183) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) is different from false [2021-12-06 21:54:34,140 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1183 (_ BitVec 32)) (v_ArrVal_1179 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1177))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1179)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1183) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1183 (_ BitVec 32)) (v_ArrVal_1179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1177))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (= (select (store (select (store .cse1 .cse2 v_ArrVal_1179) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1183) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse2)))) (forall ((v_ArrVal_1177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1186 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1178))) (= (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (select (store (select (store .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1181) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1186) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2021-12-06 21:54:34,156 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:54:34,157 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 41 [2021-12-06 21:54:34,159 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 262 treesize of output 240 [2021-12-06 21:54:34,162 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:54:34,164 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 214 treesize of output 206 [2021-12-06 21:54:34,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:54:34,168 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 188 treesize of output 172 [2021-12-06 21:54:34,172 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 191 treesize of output 171 [2021-12-06 21:54:34,224 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 21:54:34,224 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 1 [2021-12-06 21:54:34,232 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 21:54:34,232 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 1 [2021-12-06 21:54:34,915 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-06 21:54:34,916 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:54:34,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1885328080] [2021-12-06 21:54:34,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1885328080] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:54:34,916 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:54:34,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 52 [2021-12-06 21:54:34,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78605251] [2021-12-06 21:54:34,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:54:34,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-12-06 21:54:34,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:54:34,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-06 21:54:34,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1631, Unknown=10, NotChecked=890, Total=2652 [2021-12-06 21:54:34,918 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 52 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 47 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 21:54:38,491 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-06 21:54:39,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:54:39,132 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2021-12-06 21:54:39,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-06 21:54:39,132 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 47 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2021-12-06 21:54:39,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:54:39,133 INFO L225 Difference]: With dead ends: 104 [2021-12-06 21:54:39,133 INFO L226 Difference]: Without dead ends: 104 [2021-12-06 21:54:39,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 48 SyntacticMatches, 9 SemanticMatches, 60 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=185, Invalid=2497, Unknown=10, NotChecked=1090, Total=3782 [2021-12-06 21:54:39,134 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 30 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 475 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-06 21:54:39,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 1865 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 679 Invalid, 0 Unknown, 475 Unchecked, 2.3s Time] [2021-12-06 21:54:39,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-06 21:54:39,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-12-06 21:54:39,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 99 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:54:39,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2021-12-06 21:54:39,137 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 52 [2021-12-06 21:54:39,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:54:39,137 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2021-12-06 21:54:39,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 47 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 21:54:39,137 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2021-12-06 21:54:39,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 21:54:39,138 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:54:39,138 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:54:39,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2021-12-06 21:54:39,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:54:39,339 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:54:39,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:54:39,340 INFO L85 PathProgramCache]: Analyzing trace with hash -368684005, now seen corresponding path program 1 times [2021-12-06 21:54:39,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:54:39,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124737274] [2021-12-06 21:54:39,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:54:39,342 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:54:39,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:54:39,344 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:54:39,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-12-06 21:54:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:54:39,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-06 21:54:39,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:54:39,764 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 17 treesize of output 13 [2021-12-06 21:54:40,038 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 21:54:40,102 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 21:54:40,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:54:40,438 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 46 treesize of output 40 [2021-12-06 21:54:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 21:54:40,647 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:54:40,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124737274] [2021-12-06 21:54:40,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124737274] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:54:40,647 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:54:40,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 29 [2021-12-06 21:54:40,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602227458] [2021-12-06 21:54:40,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:54:40,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-06 21:54:40,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:54:40,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-06 21:54:40,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2021-12-06 21:54:40,649 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand has 29 states, 29 states have (on average 3.310344827586207) internal successors, (96), 28 states have internal predecessors, (96), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 21:54:42,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:54:42,386 INFO L93 Difference]: Finished difference Result 220 states and 236 transitions. [2021-12-06 21:54:42,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 21:54:42,387 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.310344827586207) internal successors, (96), 28 states have internal predecessors, (96), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 59 [2021-12-06 21:54:42,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:54:42,389 INFO L225 Difference]: With dead ends: 220 [2021-12-06 21:54:42,389 INFO L226 Difference]: Without dead ends: 220 [2021-12-06 21:54:42,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=345, Invalid=1725, Unknown=0, NotChecked=0, Total=2070 [2021-12-06 21:54:42,390 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 982 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:54:42,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [983 Valid, 1106 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-06 21:54:42,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-12-06 21:54:42,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 126. [2021-12-06 21:54:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 106 states have (on average 1.2358490566037736) internal successors, (131), 121 states have internal predecessors, (131), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:54:42,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2021-12-06 21:54:42,394 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 59 [2021-12-06 21:54:42,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:54:42,395 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2021-12-06 21:54:42,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.310344827586207) internal successors, (96), 28 states have internal predecessors, (96), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 21:54:42,395 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2021-12-06 21:54:42,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-06 21:54:42,395 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:54:42,396 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:54:42,403 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2021-12-06 21:54:42,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:54:42,597 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:54:42,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:54:42,598 INFO L85 PathProgramCache]: Analyzing trace with hash 2070538002, now seen corresponding path program 2 times [2021-12-06 21:54:42,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:54:42,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516978585] [2021-12-06 21:54:42,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 21:54:42,600 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:54:42,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:54:42,602 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:54:42,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-12-06 21:54:42,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 21:54:42,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:54:42,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 21:54:42,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:54:42,891 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-06 21:54:42,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:54:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-06 21:54:43,067 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:54:43,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516978585] [2021-12-06 21:54:43,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516978585] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:54:43,067 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:54:43,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-06 21:54:43,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948181484] [2021-12-06 21:54:43,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:54:43,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 21:54:43,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:54:43,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 21:54:43,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-06 21:54:43,068 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 21:54:43,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:54:43,190 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2021-12-06 21:54:43,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 21:54:43,191 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 62 [2021-12-06 21:54:43,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:54:43,191 INFO L225 Difference]: With dead ends: 111 [2021-12-06 21:54:43,191 INFO L226 Difference]: Without dead ends: 111 [2021-12-06 21:54:43,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-12-06 21:54:43,192 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 264 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:54:43,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 228 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:54:43,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-06 21:54:43,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2021-12-06 21:54:43,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 94 states have (on average 1.1702127659574468) internal successors, (110), 105 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:54:43,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2021-12-06 21:54:43,194 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 62 [2021-12-06 21:54:43,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:54:43,195 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2021-12-06 21:54:43,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 21:54:43,195 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2021-12-06 21:54:43,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-06 21:54:43,195 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:54:43,195 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:54:43,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2021-12-06 21:54:43,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:54:43,396 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:54:43,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:54:43,397 INFO L85 PathProgramCache]: Analyzing trace with hash 424234897, now seen corresponding path program 1 times [2021-12-06 21:54:43,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:54:43,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625381118] [2021-12-06 21:54:43,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:54:43,399 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:54:43,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:54:43,401 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:54:43,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-12-06 21:54:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:54:43,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 21:54:43,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:54:43,698 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 21:54:43,827 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 21:54:43,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:54:43,827 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:54:43,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625381118] [2021-12-06 21:54:43,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625381118] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:54:43,827 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:54:43,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 21:54:43,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941133062] [2021-12-06 21:54:43,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:54:43,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 21:54:43,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:54:43,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 21:54:43,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-06 21:54:43,828 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:54:44,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:54:44,276 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2021-12-06 21:54:44,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 21:54:44,277 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2021-12-06 21:54:44,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:54:44,278 INFO L225 Difference]: With dead ends: 128 [2021-12-06 21:54:44,278 INFO L226 Difference]: Without dead ends: 128 [2021-12-06 21:54:44,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-06 21:54:44,278 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 194 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 21:54:44,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 241 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 21:54:44,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-12-06 21:54:44,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 113. [2021-12-06 21:54:44,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 98 states have (on average 1.183673469387755) internal successors, (116), 108 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:54:44,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2021-12-06 21:54:44,281 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 63 [2021-12-06 21:54:44,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:54:44,281 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2021-12-06 21:54:44,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:54:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2021-12-06 21:54:44,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-06 21:54:44,281 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:54:44,282 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:54:44,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2021-12-06 21:54:44,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:54:44,483 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:54:44,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:54:44,484 INFO L85 PathProgramCache]: Analyzing trace with hash 424234898, now seen corresponding path program 1 times [2021-12-06 21:54:44,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:54:44,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489314897] [2021-12-06 21:54:44,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:54:44,485 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:54:44,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:54:44,486 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:54:44,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-12-06 21:54:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:54:44,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-06 21:54:44,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:54:44,777 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 21:54:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 21:54:45,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:54:45,025 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:54:45,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489314897] [2021-12-06 21:54:45,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489314897] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:54:45,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:54:45,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 21:54:45,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94148349] [2021-12-06 21:54:45,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:54:45,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 21:54:45,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:54:45,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 21:54:45,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-06 21:54:45,026 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:54:45,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:54:45,457 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2021-12-06 21:54:45,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 21:54:45,457 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2021-12-06 21:54:45,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:54:45,458 INFO L225 Difference]: With dead ends: 111 [2021-12-06 21:54:45,458 INFO L226 Difference]: Without dead ends: 111 [2021-12-06 21:54:45,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-06 21:54:45,459 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 199 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 21:54:45,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 186 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 21:54:45,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-06 21:54:45,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-12-06 21:54:45,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.153061224489796) internal successors, (113), 106 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:54:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2021-12-06 21:54:45,461 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 63 [2021-12-06 21:54:45,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:54:45,461 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2021-12-06 21:54:45,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:54:45,461 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2021-12-06 21:54:45,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-06 21:54:45,462 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:54:45,462 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:54:45,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2021-12-06 21:54:45,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:54:45,663 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:54:45,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:54:45,664 INFO L85 PathProgramCache]: Analyzing trace with hash 266413795, now seen corresponding path program 1 times [2021-12-06 21:54:45,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:54:45,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516195030] [2021-12-06 21:54:45,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:54:45,666 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:54:45,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:54:45,666 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:54:45,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-12-06 21:54:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:54:45,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-06 21:54:45,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:54:45,937 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 21:54:45,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:54:45,937 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:54:45,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516195030] [2021-12-06 21:54:45,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516195030] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:54:45,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:54:45,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 21:54:45,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131716651] [2021-12-06 21:54:45,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:54:45,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 21:54:45,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:54:45,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 21:54:45,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-06 21:54:45,939 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:54:46,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:54:46,202 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2021-12-06 21:54:46,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 21:54:46,202 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 64 [2021-12-06 21:54:46,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:54:46,203 INFO L225 Difference]: With dead ends: 111 [2021-12-06 21:54:46,203 INFO L226 Difference]: Without dead ends: 111 [2021-12-06 21:54:46,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-06 21:54:46,203 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 195 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 21:54:46,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 248 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 21:54:46,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-06 21:54:46,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-12-06 21:54:46,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.1428571428571428) internal successors, (112), 106 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:54:46,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2021-12-06 21:54:46,206 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 64 [2021-12-06 21:54:46,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:54:46,206 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2021-12-06 21:54:46,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:54:46,206 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2021-12-06 21:54:46,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-06 21:54:46,206 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:54:46,207 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:54:46,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (33)] Ended with exit code 0 [2021-12-06 21:54:46,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:54:46,408 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:54:46,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:54:46,409 INFO L85 PathProgramCache]: Analyzing trace with hash -184792881, now seen corresponding path program 3 times [2021-12-06 21:54:46,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:54:46,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314408359] [2021-12-06 21:54:46,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 21:54:46,411 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:54:46,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:54:46,412 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:54:46,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2021-12-06 21:54:46,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-06 21:54:46,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:54:46,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-06 21:54:46,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:54:46,864 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 15 treesize of output 11 [2021-12-06 21:54:47,311 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 33 treesize of output 15 [2021-12-06 21:54:47,496 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-06 21:54:47,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:54:48,121 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 42 treesize of output 36 [2021-12-06 21:54:48,451 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-06 21:54:48,451 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:54:48,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314408359] [2021-12-06 21:54:48,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314408359] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:54:48,451 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:54:48,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2021-12-06 21:54:48,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866697548] [2021-12-06 21:54:48,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:54:48,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-06 21:54:48,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:54:48,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-06 21:54:48,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2021-12-06 21:54:48,453 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 23 states have internal predecessors, (90), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 21:54:50,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:54:50,106 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2021-12-06 21:54:50,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 21:54:50,107 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 23 states have internal predecessors, (90), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 64 [2021-12-06 21:54:50,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:54:50,108 INFO L225 Difference]: With dead ends: 92 [2021-12-06 21:54:50,108 INFO L226 Difference]: Without dead ends: 92 [2021-12-06 21:54:50,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=163, Invalid=707, Unknown=0, NotChecked=0, Total=870 [2021-12-06 21:54:50,108 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 253 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 21:54:50,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 359 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 188 Invalid, 0 Unknown, 48 Unchecked, 0.5s Time] [2021-12-06 21:54:50,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-06 21:54:50,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2021-12-06 21:54:50,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 75 states have (on average 1.1466666666666667) internal successors, (86), 82 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:54:50,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2021-12-06 21:54:50,111 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 64 [2021-12-06 21:54:50,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:54:50,111 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2021-12-06 21:54:50,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 23 states have internal predecessors, (90), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 21:54:50,111 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2021-12-06 21:54:50,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-06 21:54:50,111 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:54:50,111 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:54:50,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2021-12-06 21:54:50,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:54:50,312 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:54:50,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:54:50,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1706854879, now seen corresponding path program 1 times [2021-12-06 21:54:50,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:54:50,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402855696] [2021-12-06 21:54:50,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:54:50,315 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:54:50,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:54:50,318 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:54:50,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2021-12-06 21:54:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:54:50,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-06 21:54:50,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:54:50,626 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 23 treesize of output 15 [2021-12-06 21:54:50,652 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-06 21:54:50,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:54:50,731 INFO L354 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2021-12-06 21:54:50,731 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 24 treesize of output 23 [2021-12-06 21:54:50,750 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-06 21:54:50,750 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 11 treesize of output 11 [2021-12-06 21:54:50,782 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-06 21:54:50,782 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:54:50,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402855696] [2021-12-06 21:54:50,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402855696] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:54:50,782 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:54:50,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2021-12-06 21:54:50,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190127089] [2021-12-06 21:54:50,782 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:54:50,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 21:54:50,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:54:50,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 21:54:50,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 21:54:50,783 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:54:51,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:54:51,240 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2021-12-06 21:54:51,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 21:54:51,240 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 66 [2021-12-06 21:54:51,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:54:51,241 INFO L225 Difference]: With dead ends: 95 [2021-12-06 21:54:51,241 INFO L226 Difference]: Without dead ends: 95 [2021-12-06 21:54:51,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 119 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-12-06 21:54:51,242 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 89 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 21:54:51,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 311 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 21:54:51,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-06 21:54:51,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2021-12-06 21:54:51,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.144736842105263) internal successors, (87), 82 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:54:51,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2021-12-06 21:54:51,245 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 66 [2021-12-06 21:54:51,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:54:51,245 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2021-12-06 21:54:51,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 21:54:51,245 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2021-12-06 21:54:51,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-06 21:54:51,246 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:54:51,246 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:54:51,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2021-12-06 21:54:51,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:54:51,447 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:54:51,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:54:51,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1706854878, now seen corresponding path program 1 times [2021-12-06 21:54:51,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:54:51,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955134108] [2021-12-06 21:54:51,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:54:51,447 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:54:51,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:54:51,448 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:54:51,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2021-12-06 21:54:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:54:51,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-06 21:54:51,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:54:51,764 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 21:54:51,768 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 21:54:51,971 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:54:51,971 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 21:54:51,979 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 21:54:52,061 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 21:54:52,067 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 21:54:52,186 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:54:52,186 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 21:54:52,190 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 21:54:52,560 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:54:52,560 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 21:54:52,564 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 21:54:52,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:54:52,619 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 21:54:52,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:54:52,623 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 31 treesize of output 26 [2021-12-06 21:54:52,976 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 21:54:52,978 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 25 treesize of output 13 [2021-12-06 21:54:53,056 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-06 21:54:53,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:54:54,728 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1626 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1627) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1626) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1627 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1627) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2021-12-06 21:54:54,769 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1626 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1627) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1626) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1627 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1627) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) is different from false [2021-12-06 21:54:54,803 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1627 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1627) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1626 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1627) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1626) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2021-12-06 21:54:54,846 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1626 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1627) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1626) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1627 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1627) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2021-12-06 21:54:54,878 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1627 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1627) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1626 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1627) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1626) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))) is different from false [2021-12-06 21:54:54,909 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1627 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1627) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1626 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1627) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1626) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2021-12-06 21:54:55,059 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1624 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1625) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1624) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1627) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1624 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1624))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1625) .cse1 v_ArrVal_1627) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1626) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) is different from false [2021-12-06 21:54:55,119 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1624 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1624))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1625) .cse0 v_ArrVal_1627) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1626) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))) (forall ((v_ArrVal_1627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1624 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1625) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1624) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1627) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) is different from false [2021-12-06 21:54:55,140 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:54:55,140 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 64 [2021-12-06 21:54:55,152 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:54:55,152 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 48 [2021-12-06 21:54:55,156 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 80 treesize of output 68 [2021-12-06 21:54:55,160 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 166 treesize of output 146 [2021-12-06 21:54:55,163 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 142 treesize of output 126 [2021-12-06 21:54:55,178 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 66 treesize of output 58 [2021-12-06 21:54:55,181 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 118 treesize of output 110 [2021-12-06 21:54:55,430 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:54:55,430 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2021-12-06 21:54:55,445 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:54:55,445 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2021-12-06 21:54:55,448 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:54:55,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2021-12-06 21:54:55,454 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:54:55,455 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:54:55,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2021-12-06 21:54:55,464 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 13 treesize of output 11 [2021-12-06 21:54:56,129 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:54:56,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955134108] [2021-12-06 21:54:56,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [955134108] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:54:56,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1875784572] [2021-12-06 21:54:56,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:54:56,129 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 21:54:56,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 21:54:56,130 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 21:54:56,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2021-12-06 21:54:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:54:56,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 75 conjunts are in the unsatisfiable core [2021-12-06 21:54:56,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:54:56,522 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 21:54:56,528 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 21:54:56,660 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 21:54:56,660 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 12 treesize of output 18 [2021-12-06 21:54:56,675 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:54:56,675 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 21:54:56,714 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 21:54:56,718 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 21:54:56,767 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:54:56,767 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 21:54:56,771 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 21:54:57,001 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:54:57,002 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 21:54:57,006 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 21:54:57,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:54:57,069 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 31 treesize of output 26 [2021-12-06 21:54:57,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:54:57,078 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 21:54:57,299 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 21:54:57,301 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 25 treesize of output 13 [2021-12-06 21:54:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-06 21:54:57,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:54:58,879 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1697 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1697) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1698 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1697 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1697) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1698) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2021-12-06 21:54:58,923 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1698 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1697 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1697) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1698) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1697 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1697) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2021-12-06 21:54:58,957 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1698 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1697 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1697) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1698) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1697 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1697) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2021-12-06 21:54:59,001 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1697 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1697) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1698 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1697 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1697) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1698) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2021-12-06 21:54:59,031 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1698 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1697 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1697) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1698) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))) (forall ((v_ArrVal_1697 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1697) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2021-12-06 21:54:59,058 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1697 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1697) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1698 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1697 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1697) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1698) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2021-12-06 21:54:59,101 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1698 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1697 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1694))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1696) .cse0 v_ArrVal_1697) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1698) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_1694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1697 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1696) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1694) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1697) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule .cse2 (bvadd .cse2 (_ bv4 32)))))) is different from false [2021-12-06 21:54:59,159 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1697 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1696) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1694) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1697) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1698 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1697 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1694))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1696) .cse1 v_ArrVal_1697) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1698) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) is different from false [2021-12-06 21:54:59,182 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:54:59,182 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2021-12-06 21:54:59,191 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:54:59,192 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2021-12-06 21:54:59,196 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 290 [2021-12-06 21:54:59,202 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 1098 treesize of output 1046 [2021-12-06 21:54:59,214 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 1042 treesize of output 994 [2021-12-06 21:54:59,225 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 994 treesize of output 946 [2021-12-06 21:54:59,232 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 946 treesize of output 922 [2021-12-06 21:54:59,238 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 922 treesize of output 858 [2021-12-06 21:56:52,392 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:56:52,392 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 64 [2021-12-06 21:56:52,406 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:56:52,406 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 48 [2021-12-06 21:56:52,410 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 80 treesize of output 68 [2021-12-06 21:56:52,413 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 330 treesize of output 294 [2021-12-06 21:56:52,418 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 290 treesize of output 274 [2021-12-06 21:56:52,421 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 274 treesize of output 242 [2021-12-06 21:56:52,441 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 126 treesize of output 114 [2021-12-06 21:56:53,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1875784572] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:56:53,294 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:56:53,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2021-12-06 21:56:53,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864620720] [2021-12-06 21:56:53,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:56:53,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-06 21:56:53,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:56:53,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-06 21:56:53,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=985, Unknown=16, NotChecked=1232, Total=2352 [2021-12-06 21:56:53,295 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 22 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:56:55,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:56:55,874 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2021-12-06 21:56:55,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 21:56:55,874 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 22 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 66 [2021-12-06 21:56:55,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:56:55,875 INFO L225 Difference]: With dead ends: 96 [2021-12-06 21:56:55,875 INFO L226 Difference]: Without dead ends: 96 [2021-12-06 21:56:55,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 170 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=248, Invalid=1962, Unknown=16, NotChecked=1680, Total=3906 [2021-12-06 21:56:55,877 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 163 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-06 21:56:55,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 619 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 722 Invalid, 0 Unknown, 99 Unchecked, 1.2s Time] [2021-12-06 21:56:55,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-06 21:56:55,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 89. [2021-12-06 21:56:55,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.1282051282051282) internal successors, (88), 84 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:56:55,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2021-12-06 21:56:55,879 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 66 [2021-12-06 21:56:55,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:56:55,879 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2021-12-06 21:56:55,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 22 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:56:55,879 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2021-12-06 21:56:55,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 21:56:55,881 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:56:55,881 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:56:55,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2021-12-06 21:56:56,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2021-12-06 21:56:56,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:56:56,282 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:56:56,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:56:56,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1372895080, now seen corresponding path program 1 times [2021-12-06 21:56:56,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:56:56,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943955653] [2021-12-06 21:56:56,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:56:56,283 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:56:56,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:56:56,284 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:56:56,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2021-12-06 21:56:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:56:56,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-06 21:56:56,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:56:56,666 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 17 treesize of output 13 [2021-12-06 21:56:56,933 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:56:56,933 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 27 treesize of output 31 [2021-12-06 21:56:57,236 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 25 treesize of output 17 [2021-12-06 21:56:57,238 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 21 treesize of output 13 [2021-12-06 21:56:57,332 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 21:56:57,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:56:57,941 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:56:57,942 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 27 treesize of output 30 [2021-12-06 21:56:57,956 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:56:57,956 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 23 treesize of output 26 [2021-12-06 21:56:58,475 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 48 treesize of output 42 [2021-12-06 21:56:58,757 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-06 21:56:58,757 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:56:58,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943955653] [2021-12-06 21:56:58,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943955653] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:56:58,757 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:56:58,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17] total 39 [2021-12-06 21:56:58,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806568889] [2021-12-06 21:56:58,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:56:58,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-06 21:56:58,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:56:58,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-06 21:56:58,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1363, Unknown=0, NotChecked=0, Total=1482 [2021-12-06 21:56:58,759 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand has 39 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 38 states have internal predecessors, (109), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 21:57:03,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:57:03,062 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2021-12-06 21:57:03,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-06 21:57:03,062 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 38 states have internal predecessors, (109), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 67 [2021-12-06 21:57:03,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:57:03,063 INFO L225 Difference]: With dead ends: 121 [2021-12-06 21:57:03,063 INFO L226 Difference]: Without dead ends: 121 [2021-12-06 21:57:03,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=620, Invalid=3540, Unknown=0, NotChecked=0, Total=4160 [2021-12-06 21:57:03,065 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 561 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-06 21:57:03,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [562 Valid, 672 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1190 Invalid, 0 Unknown, 74 Unchecked, 1.9s Time] [2021-12-06 21:57:03,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-06 21:57:03,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 86. [2021-12-06 21:57:03,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 81 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:57:03,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2021-12-06 21:57:03,067 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 67 [2021-12-06 21:57:03,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:57:03,067 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2021-12-06 21:57:03,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 38 states have internal predecessors, (109), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 21:57:03,067 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2021-12-06 21:57:03,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-06 21:57:03,068 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:57:03,068 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:57:03,076 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (38)] Ended with exit code 0 [2021-12-06 21:57:03,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:57:03,269 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:57:03,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:57:03,270 INFO L85 PathProgramCache]: Analyzing trace with hash -795789539, now seen corresponding path program 1 times [2021-12-06 21:57:03,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:57:03,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100423595] [2021-12-06 21:57:03,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:57:03,272 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:57:03,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:57:03,274 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:57:03,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2021-12-06 21:57:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:03,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-06 21:57:03,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:57:03,749 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 21:57:03,750 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 23 treesize of output 30 [2021-12-06 21:57:03,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 16 [2021-12-06 21:57:03,967 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-06 21:57:03,967 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 28 treesize of output 30 [2021-12-06 21:57:04,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 21:57:04,222 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:57:04,222 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2021-12-06 21:57:04,677 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:57:04,678 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2021-12-06 21:57:04,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:57:04,757 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 37 treesize of output 28 [2021-12-06 21:57:05,117 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 31 treesize of output 15 [2021-12-06 21:57:05,251 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-06 21:57:05,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:57:06,196 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1816 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1816) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2021-12-06 21:57:06,214 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1816 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1816) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2021-12-06 21:57:06,224 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1816 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1816) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) |c_#StackHeapBarrier|)) is different from false [2021-12-06 21:57:06,235 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1816 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1816) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2021-12-06 21:57:06,249 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1815 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1815))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1816)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2021-12-06 21:57:06,270 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1815 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1815))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1816)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2021-12-06 21:57:06,278 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:57:06,278 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2021-12-06 21:57:06,280 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 236 treesize of output 200 [2021-12-06 21:57:06,284 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 196 treesize of output 188 [2021-12-06 21:57:06,286 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 188 treesize of output 172 [2021-12-06 21:57:06,745 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 21:57:06,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1100423595] [2021-12-06 21:57:06,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1100423595] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:57:06,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [609493320] [2021-12-06 21:57:06,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:57:06,746 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 21:57:06,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 21:57:06,746 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 21:57:06,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2021-12-06 21:57:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:07,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 55 conjunts are in the unsatisfiable core [2021-12-06 21:57:07,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:57:07,137 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 21:57:07,448 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 21:57:07,503 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:57:07,503 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 21:57:07,689 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 21:57:07,894 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:57:07,895 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 26 treesize of output 27 [2021-12-06 21:57:08,560 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 21:57:08,561 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 26 treesize of output 27 [2021-12-06 21:57:08,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:57:08,617 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 29 treesize of output 24 [2021-12-06 21:57:09,074 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 23 treesize of output 11 [2021-12-06 21:57:09,086 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-06 21:57:09,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:57:09,613 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1875 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1875))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1816)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2021-12-06 21:57:09,632 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1875 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1875))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1816)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2021-12-06 21:57:09,642 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:57:09,642 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2021-12-06 21:57:09,644 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 236 treesize of output 200 [2021-12-06 21:57:09,649 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 196 treesize of output 180 [2021-12-06 21:57:09,652 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 180 treesize of output 172 [2021-12-06 21:57:09,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [609493320] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:57:09,885 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:57:09,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2021-12-06 21:57:09,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518531621] [2021-12-06 21:57:09,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 21:57:09,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-06 21:57:09,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 21:57:09,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-06 21:57:09,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2263, Unknown=44, NotChecked=824, Total=3306 [2021-12-06 21:57:09,887 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand has 42 states, 41 states have (on average 2.5609756097560976) internal successors, (105), 37 states have internal predecessors, (105), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 21:57:13,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:57:13,424 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2021-12-06 21:57:13,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-06 21:57:13,425 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.5609756097560976) internal successors, (105), 37 states have internal predecessors, (105), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 69 [2021-12-06 21:57:13,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:57:13,426 INFO L225 Difference]: With dead ends: 88 [2021-12-06 21:57:13,426 INFO L226 Difference]: Without dead ends: 88 [2021-12-06 21:57:13,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 173 SyntacticMatches, 7 SemanticMatches, 71 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1021 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=369, Invalid=3779, Unknown=44, NotChecked=1064, Total=5256 [2021-12-06 21:57:13,427 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 200 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-06 21:57:13,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 892 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 808 Invalid, 0 Unknown, 153 Unchecked, 1.6s Time] [2021-12-06 21:57:13,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-06 21:57:13,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2021-12-06 21:57:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.105263157894737) internal successors, (84), 82 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 21:57:13,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2021-12-06 21:57:13,429 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 69 [2021-12-06 21:57:13,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:57:13,429 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2021-12-06 21:57:13,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.5609756097560976) internal successors, (105), 37 states have internal predecessors, (105), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-06 21:57:13,430 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2021-12-06 21:57:13,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-06 21:57:13,430 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:57:13,430 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:57:13,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 0 [2021-12-06 21:57:13,666 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (39)] Ended with exit code 0 [2021-12-06 21:57:13,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 21:57:13,832 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-06 21:57:13,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:57:13,833 INFO L85 PathProgramCache]: Analyzing trace with hash 853476134, now seen corresponding path program 1 times [2021-12-06 21:57:13,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 21:57:13,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031726118] [2021-12-06 21:57:13,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:57:13,834 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 21:57:13,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 21:57:13,835 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 21:57:13,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe51b4f6-31ac-40a0-80c2-8ed21b9e6a59/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2021-12-06 21:57:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:14,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 76 conjunts are in the unsatisfiable core [2021-12-06 21:57:14,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:57:14,175 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 21:57:14,333 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:57:14,333 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 21:57:14,423 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 21:57:14,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 21:57:14,534 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-06 21:57:14,535 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 33 [2021-12-06 21:57:14,538 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 27 treesize of output 22 [2021-12-06 21:57:15,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:57:15,027 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 21:57:15,028 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 81 treesize of output 62 [2021-12-06 21:57:15,039 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-12-06 21:57:15,040 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 44 treesize of output 41 [2021-12-06 21:57:15,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:57:15,116 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 21:57:15,116 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 44 treesize of output 41 [2021-12-06 21:57:15,120 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-12-06 21:57:15,123 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 5 treesize of output 3 [2021-12-06 21:57:15,579 INFO L354 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2021-12-06 21:57:15,580 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 53 treesize of output 36 [2021-12-06 21:57:15,588 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:57:15,589 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 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-06 21:57:15,815 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-06 21:57:15,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:57:16,397 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1947 (_ BitVec 32))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1947)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (_ bv0 32)) |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1947 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1946) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1947)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (_ bv0 32))))) is different from false [2021-12-06 21:57:16,427 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1947 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1946) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_1947) |c_ULTIMATE.start_main_~s~0#1.offset|)) (_ bv0 32)))) (forall ((v_ArrVal_1947 (_ BitVec 32))) (= (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_1947))) (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|))) (_ bv0 32)) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2021-12-06 21:57:16,472 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1942 (_ BitVec 32)) (v_ArrVal_1947 (_ BitVec 32))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1942)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_1947))) (select (store .cse0 |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|)))) (_ bv0 32)) |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1943 (_ BitVec 32)) (v_ArrVal_1942 (_ BitVec 32)) (v_ArrVal_1947 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse2 v_ArrVal_1943)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1946) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse2 v_ArrVal_1942)) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_1947) |c_ULTIMATE.start_main_~s~0#1.offset|))) (_ bv0 32))))) is different from false [2021-12-06 21:57:16,531 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1942 (_ BitVec 32)) (v_ArrVal_1947 (_ BitVec 32))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|) v_ArrVal_1942)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_1947))) (select (store .cse0 |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|)))) (_ bv0 32)) |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1943 (_ BitVec 32)) (v_ArrVal_1942 (_ BitVec 32)) (v_ArrVal_1947 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|))) (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|) .cse2 v_ArrVal_1943)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1946) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|) .cse2 v_ArrVal_1942)) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_1947) |c_ULTIMATE.start_main_~s~0#1.offset|))) (_ bv0 32))))) is different from false [2021-12-06 21:57:16,570 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1942 (_ BitVec 32)) (v_ArrVal_1947 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (let ((.cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) v_ArrVal_1942))))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_1947))) (select (store .cse0 |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|)))) (_ bv0 32)))) (forall ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1943 (_ BitVec 32)) (v_ArrVal_1942 (_ BitVec 32)) (v_ArrVal_1947 (_ BitVec 32))) (= (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)))) (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) .cse4 v_ArrVal_1943)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1946) (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) .cse4 v_ArrVal_1942)) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_1947) |c_ULTIMATE.start_main_~s~0#1.offset|))) (_ bv0 32)) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-06 21:57:16,631 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1942 (_ BitVec 32)) (v_ArrVal_1947 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (let ((.cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) v_ArrVal_1942))))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_1947))) (select (store .cse0 |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|)))) (_ bv0 32)))) (forall ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1943 (_ BitVec 32)) (v_ArrVal_1942 (_ BitVec 32)) (v_ArrVal_1947 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) .cse4 v_ArrVal_1943)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1946) (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) .cse4 v_ArrVal_1942)) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)) v_ArrVal_1947) |c_ULTIMATE.start_main_~s~0#1.offset|))) (_ bv0 32))))) is different from false [2021-12-06 21:57:16,672 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1943 (_ BitVec 32)) (v_ArrVal_1942 (_ BitVec 32)) (v_ArrVal_1947 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 v_ArrVal_1943)) |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_ArrVal_1946) (select (store (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 v_ArrVal_1942)) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1947) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (_ bv0 32)))) (forall ((v_ArrVal_1942 (_ BitVec 32)) (v_ArrVal_1947 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (let ((.cse2 (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) v_ArrVal_1942))))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1947))) (select (store .cse2 |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse3) (select .cse3 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (_ bv0 32))))) is different from false [2021-12-06 21:57:16,713 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1942 (_ BitVec 32)) (v_ArrVal_1947 (_ BitVec 32))) (= (select (let ((.cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) v_ArrVal_1942))))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1947))) (select (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (_ bv0 32)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1943 (_ BitVec 32)) (v_ArrVal_1942 (_ BitVec 32)) (v_ArrVal_1947 (_ BitVec 32))) (= (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) .cse4 v_ArrVal_1943)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1946) (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) .cse4 v_ArrVal_1942)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1947) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (_ bv0 32)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2021-12-06 21:57:16,779 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1943 (_ BitVec 32)) (v_ArrVal_1942 (_ BitVec 32)) (v_ArrVal_1947 (_ BitVec 32))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (select (store (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_1943)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1946) (select (store (select (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 v_ArrVal_1942)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1947) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (_ bv0 32)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (forall ((v_ArrVal_1942 (_ BitVec 32)) (v_ArrVal_1947 (_ BitVec 32))) (= (select (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (store .cse6 .cse7 (store (select .cse6 .cse7) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) v_ArrVal_1942)))))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1947))) (select (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse5) (select .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (_ bv0 32)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) is different from false [2021-12-06 21:57:16,898 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1942 (_ BitVec 32)) (v_ArrVal_1947 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (store .cse2 .cse3 (store (select .cse2 .cse3) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1942)))))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1947))) (select (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (_ bv0 32)))) (forall ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1943 (_ BitVec 32)) (v_ArrVal_1942 (_ BitVec 32)) (v_ArrVal_1947 (_ BitVec 32))) (= (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse6 (bvadd (_ bv4 32) (select (select .cse4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (select (store (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_ArrVal_1943)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1946) (select (store (select (store .cse7 .cse5 (store (select .cse7 .cse5) .cse6 v_ArrVal_1942)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1947) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (_ bv0 32)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2021-12-06 21:57:21,117 INFO L354 Elim1Store]: treesize reduction 327, result has 43.1 percent of original size [2021-12-06 21:57:21,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 512 treesize of output 531 [2021-12-06 21:57:21,136 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:57:25,428 INFO L354 Elim1Store]: treesize reduction 107, result has 55.6 percent of original size [2021-12-06 21:57:25,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 472 treesize of output 441 [2021-12-06 21:57:25,503 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:57:25,503 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 157 [2021-12-06 21:57:25,540 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:57:25,540 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 163 treesize of output 163 [2021-12-06 21:57:26,314 INFO L354 Elim1Store]: treesize reduction 60, result has 79.2 percent of original size [2021-12-06 21:57:26,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 277 treesize of output 453 [2021-12-06 21:57:26,432 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:57:26,432 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 130 [2021-12-06 21:57:26,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:57:26,532 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:57:26,761 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:57:26,761 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 5 new quantified variables, introduced 13 case distinctions, treesize of input 206 treesize of output 285 [2021-12-06 21:57:26,812 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 200 treesize of output 192 [2021-12-06 21:57:49,480 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 21:57:49,582 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 12 treesize of output 8 [2021-12-06 21:57:49,825 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 21:57:50,133 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 21:57:50,288 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:57:50,288 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 23 [2021-12-06 21:57:51,504 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 12 treesize of output 8 [2021-12-06 21:58:06,998 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-06 21:58:06,998 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 391 treesize of output 357 [2021-12-06 21:58:07,321 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 196 treesize of output 176 [2021-12-06 21:58:07,503 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 90 treesize of output 74 [2021-12-06 21:58:07,603 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 90 treesize of output 74 [2021-12-06 21:58:07,662 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-12-06 21:58:07,670 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-12-06 21:58:07,711 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-12-06 21:58:07,720 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-12-06 21:58:07,823 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 97 treesize of output 81 [2021-12-06 21:58:11,976 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:58:12,026 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:58:12,027 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 68 treesize of output 74 [2021-12-06 21:58:12,224 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 21:58:12,278 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:58:12,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 176