./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_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_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/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_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/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_ad0b4402-44f9-498f-ac46-f48541d4ba42/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 cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 22:01:36,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 22:01:36,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 22:01:36,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 22:01:36,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 22:01:36,310 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 22:01:36,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 22:01:36,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 22:01:36,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 22:01:36,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 22:01:36,318 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 22:01:36,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 22:01:36,320 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 22:01:36,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 22:01:36,322 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 22:01:36,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 22:01:36,325 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 22:01:36,326 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 22:01:36,328 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 22:01:36,330 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 22:01:36,332 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 22:01:36,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 22:01:36,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 22:01:36,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 22:01:36,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 22:01:36,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 22:01:36,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 22:01:36,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 22:01:36,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 22:01:36,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 22:01:36,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 22:01:36,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 22:01:36,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 22:01:36,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 22:01:36,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 22:01:36,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 22:01:36,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 22:01:36,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 22:01:36,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 22:01:36,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 22:01:36,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 22:01:36,350 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-06 22:01:36,372 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 22:01:36,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 22:01:36,373 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 22:01:36,373 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 22:01:36,373 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 22:01:36,374 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 22:01:36,374 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 22:01:36,374 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 22:01:36,374 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 22:01:36,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 22:01:36,375 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 22:01:36,375 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-06 22:01:36,375 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 22:01:36,375 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 22:01:36,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 22:01:36,376 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-06 22:01:36,376 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-06 22:01:36,376 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-06 22:01:36,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 22:01:36,377 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-06 22:01:36,377 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 22:01:36,377 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 22:01:36,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 22:01:36,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 22:01:36,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 22:01:36,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 22:01:36,378 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 22:01:36,378 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 22:01:36,378 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 22:01:36,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 22:01:36,379 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 22:01:36,379 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_ad0b4402-44f9-498f-ac46-f48541d4ba42/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_ad0b4402-44f9-498f-ac46-f48541d4ba42/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 -> cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 [2021-12-06 22:01:36,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 22:01:36,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 22:01:36,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 22:01:36,579 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 22:01:36,579 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 22:01:36,580 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2021-12-06 22:01:36,622 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/data/84fe700f8/6e5f63e9ff2d4009b3804e7f00ad26e7/FLAG5b14a5c08 [2021-12-06 22:01:37,055 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 22:01:37,056 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2021-12-06 22:01:37,065 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/data/84fe700f8/6e5f63e9ff2d4009b3804e7f00ad26e7/FLAG5b14a5c08 [2021-12-06 22:01:37,075 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/data/84fe700f8/6e5f63e9ff2d4009b3804e7f00ad26e7 [2021-12-06 22:01:37,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 22:01:37,078 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 22:01:37,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 22:01:37,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 22:01:37,082 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 22:01:37,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:01:37" (1/1) ... [2021-12-06 22:01:37,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e591bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:01:37, skipping insertion in model container [2021-12-06 22:01:37,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:01:37" (1/1) ... [2021-12-06 22:01:37,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 22:01:37,116 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 22:01:37,317 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_ad0b4402-44f9-498f-ac46-f48541d4ba42/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i[24473,24486] [2021-12-06 22:01:37,319 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:01:37,325 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 22:01:37,357 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_ad0b4402-44f9-498f-ac46-f48541d4ba42/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i[24473,24486] [2021-12-06 22:01:37,357 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:01:37,378 INFO L208 MainTranslator]: Completed translation [2021-12-06 22:01:37,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:01:37 WrapperNode [2021-12-06 22:01:37,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 22:01:37,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 22:01:37,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 22:01:37,380 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 22:01:37,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:01:37" (1/1) ... [2021-12-06 22:01:37,395 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:01:37" (1/1) ... [2021-12-06 22:01:37,412 INFO L137 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2021-12-06 22:01:37,413 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 22:01:37,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 22:01:37,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 22:01:37,413 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 22:01:37,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:01:37" (1/1) ... [2021-12-06 22:01:37,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:01:37" (1/1) ... [2021-12-06 22:01:37,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:01:37" (1/1) ... [2021-12-06 22:01:37,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:01:37" (1/1) ... [2021-12-06 22:01:37,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:01:37" (1/1) ... [2021-12-06 22:01:37,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:01:37" (1/1) ... [2021-12-06 22:01:37,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:01:37" (1/1) ... [2021-12-06 22:01:37,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 22:01:37,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 22:01:37,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 22:01:37,436 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 22:01:37,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:01:37" (1/1) ... [2021-12-06 22:01:37,443 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 22:01:37,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:01:37,463 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 22:01:37,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 22:01:37,492 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-06 22:01:37,492 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-06 22:01:37,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-06 22:01:37,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 22:01:37,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 22:01:37,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 22:01:37,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-06 22:01:37,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-06 22:01:37,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 22:01:37,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 22:01:37,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 22:01:37,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 22:01:37,560 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 22:01:37,561 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 22:01:37,578 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-06 22:01:37,741 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 22:01:37,746 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 22:01:37,746 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-06 22:01:37,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:01:37 BoogieIcfgContainer [2021-12-06 22:01:37,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 22:01:37,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 22:01:37,749 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 22:01:37,751 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 22:01:37,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 10:01:37" (1/3) ... [2021-12-06 22:01:37,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40eb8054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 10:01:37, skipping insertion in model container [2021-12-06 22:01:37,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:01:37" (2/3) ... [2021-12-06 22:01:37,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40eb8054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 10:01:37, skipping insertion in model container [2021-12-06 22:01:37,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:01:37" (3/3) ... [2021-12-06 22:01:37,753 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse.i [2021-12-06 22:01:37,757 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 22:01:37,757 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2021-12-06 22:01:37,789 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 22:01:37,794 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 22:01:37,794 INFO L340 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2021-12-06 22:01:37,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 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 22:01:37,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-06 22:01:37,810 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:01:37,811 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-06 22:01:37,811 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:01:37,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:01:37,815 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2021-12-06 22:01:37,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:01:37,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652136982] [2021-12-06 22:01:37,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:37,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:01:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:37,962 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 22:01:37,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:01:37,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652136982] [2021-12-06 22:01:37,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652136982] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:01:37,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:01:37,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 22:01:37,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588746290] [2021-12-06 22:01:37,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:01:37,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:01:37,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:01:38,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:01:38,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:01:38,003 INFO L87 Difference]: Start difference. First operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:38,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:01:38,073 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2021-12-06 22:01:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:01:38,075 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-06 22:01:38,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:01:38,084 INFO L225 Difference]: With dead ends: 111 [2021-12-06 22:01:38,084 INFO L226 Difference]: Without dead ends: 104 [2021-12-06 22:01:38,086 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 22:01:38,090 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 63 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:01:38,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 136 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:01:38,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-06 22:01:38,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2021-12-06 22:01:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:38,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2021-12-06 22:01:38,120 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 5 [2021-12-06 22:01:38,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:01:38,120 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2021-12-06 22:01:38,120 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:38,120 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2021-12-06 22:01:38,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-06 22:01:38,121 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:01:38,121 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-06 22:01:38,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 22:01:38,121 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:01:38,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:01:38,122 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2021-12-06 22:01:38,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:01:38,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60417019] [2021-12-06 22:01:38,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:38,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:01:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:38,160 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 22:01:38,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:01:38,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60417019] [2021-12-06 22:01:38,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60417019] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:01:38,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:01:38,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 22:01:38,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91975673] [2021-12-06 22:01:38,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:01:38,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:01:38,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:01:38,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:01:38,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:01:38,163 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:38,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:01:38,203 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2021-12-06 22:01:38,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:01:38,204 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-06 22:01:38,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:01:38,205 INFO L225 Difference]: With dead ends: 101 [2021-12-06 22:01:38,205 INFO L226 Difference]: Without dead ends: 101 [2021-12-06 22:01:38,205 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 22:01:38,207 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 58 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:01:38,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 133 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:01:38,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-06 22:01:38,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 56. [2021-12-06 22:01:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2021-12-06 22:01:38,213 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 5 [2021-12-06 22:01:38,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:01:38,213 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2021-12-06 22:01:38,213 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:38,213 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2021-12-06 22:01:38,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-06 22:01:38,214 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:01:38,214 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:01:38,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 22:01:38,214 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:01:38,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:01:38,215 INFO L85 PathProgramCache]: Analyzing trace with hash 678997037, now seen corresponding path program 1 times [2021-12-06 22:01:38,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:01:38,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391409187] [2021-12-06 22:01:38,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:38,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:01:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:38,238 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 22:01:38,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:01:38,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391409187] [2021-12-06 22:01:38,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391409187] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:01:38,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:01:38,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:01:38,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720669498] [2021-12-06 22:01:38,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:01:38,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:01:38,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:01:38,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:01:38,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:01:38,240 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:38,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:01:38,251 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2021-12-06 22:01:38,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:01:38,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-06 22:01:38,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:01:38,252 INFO L225 Difference]: With dead ends: 66 [2021-12-06 22:01:38,252 INFO L226 Difference]: Without dead ends: 66 [2021-12-06 22:01:38,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:01:38,255 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 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 22:01:38,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:01:38,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-06 22:01:38,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2021-12-06 22:01:38,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.575) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2021-12-06 22:01:38,262 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 8 [2021-12-06 22:01:38,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:01:38,263 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2021-12-06 22:01:38,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:38,263 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2021-12-06 22:01:38,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-06 22:01:38,264 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:01:38,264 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:01:38,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 22:01:38,264 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:01:38,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:01:38,265 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2021-12-06 22:01:38,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:01:38,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048630356] [2021-12-06 22:01:38,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:38,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:01:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:38,315 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 22:01:38,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:01:38,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048630356] [2021-12-06 22:01:38,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048630356] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:01:38,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:01:38,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:01:38,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59714283] [2021-12-06 22:01:38,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:01:38,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:01:38,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:01:38,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:01:38,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:01:38,318 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:38,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:01:38,331 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2021-12-06 22:01:38,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:01:38,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-06 22:01:38,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:01:38,332 INFO L225 Difference]: With dead ends: 63 [2021-12-06 22:01:38,332 INFO L226 Difference]: Without dead ends: 63 [2021-12-06 22:01:38,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:01:38,333 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:01:38,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:01:38,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-06 22:01:38,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2021-12-06 22:01:38,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.511111111111111) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:38,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2021-12-06 22:01:38,340 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 9 [2021-12-06 22:01:38,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:01:38,340 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2021-12-06 22:01:38,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:38,341 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2021-12-06 22:01:38,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-06 22:01:38,342 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:01:38,342 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:01:38,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 22:01:38,342 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:01:38,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:01:38,343 INFO L85 PathProgramCache]: Analyzing trace with hash 2114731710, now seen corresponding path program 1 times [2021-12-06 22:01:38,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:01:38,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093656966] [2021-12-06 22:01:38,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:38,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:01:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:01:38,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:01:38,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093656966] [2021-12-06 22:01:38,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093656966] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:01:38,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982088821] [2021-12-06 22:01:38,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:38,402 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:01:38,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:01:38,403 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:01:38,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 22:01:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:38,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 22:01:38,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:01:38,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:01:38,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:01:38,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:01:38,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982088821] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:01:38,546 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:01:38,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-06 22:01:38,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905392438] [2021-12-06 22:01:38,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:01:38,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 22:01:38,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:01:38,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:01:38,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:01:38,548 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:38,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:01:38,560 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2021-12-06 22:01:38,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:01:38,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-06 22:01:38,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:01:38,562 INFO L225 Difference]: With dead ends: 64 [2021-12-06 22:01:38,562 INFO L226 Difference]: Without dead ends: 64 [2021-12-06 22:01:38,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:01:38,563 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 16 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:01:38,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 167 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:01:38,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-06 22:01:38,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-12-06 22:01:38,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2021-12-06 22:01:38,570 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 15 [2021-12-06 22:01:38,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:01:38,570 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2021-12-06 22:01:38,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:38,570 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2021-12-06 22:01:38,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-06 22:01:38,571 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:01:38,571 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-06 22:01:38,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 22:01:38,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:01:38,773 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:01:38,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:01:38,775 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2021-12-06 22:01:38,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:01:38,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906441822] [2021-12-06 22:01:38,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:38,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:01:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:38,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:01:38,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:01:38,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906441822] [2021-12-06 22:01:38,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906441822] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:01:38,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611633141] [2021-12-06 22:01:38,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:38,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:01:38,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:01:38,980 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:01:38,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 22:01:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:39,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 22:01:39,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:01:39,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 22:01:39,094 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-06 22:01:39,095 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 22:01:39,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:01:39,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:01:39,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:01:39,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611633141] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:01:39,228 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:01:39,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2021-12-06 22:01:39,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157238816] [2021-12-06 22:01:39,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:01:39,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 22:01:39,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:01:39,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 22:01:39,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-06 22:01:39,230 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:39,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:01:39,275 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2021-12-06 22:01:39,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:01:39,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-06 22:01:39,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:01:39,276 INFO L225 Difference]: With dead ends: 77 [2021-12-06 22:01:39,276 INFO L226 Difference]: Without dead ends: 77 [2021-12-06 22:01:39,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-06 22:01:39,277 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 266 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:01:39,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 66 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 23 Unchecked, 0.0s Time] [2021-12-06 22:01:39,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-06 22:01:39,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2021-12-06 22:01:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:39,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2021-12-06 22:01:39,282 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 16 [2021-12-06 22:01:39,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:01:39,282 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2021-12-06 22:01:39,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2021-12-06 22:01:39,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-06 22:01:39,283 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:01:39,283 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-06 22:01:39,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 22:01:39,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:01:39,484 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:01:39,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:01:39,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2021-12-06 22:01:39,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:01:39,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364256744] [2021-12-06 22:01:39,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:39,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:01:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:39,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:01:39,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:01:39,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364256744] [2021-12-06 22:01:39,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364256744] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:01:39,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000131916] [2021-12-06 22:01:39,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:39,554 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:01:39,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:01:39,555 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:01:39,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 22:01:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:39,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-06 22:01:39,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:01:39,613 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 22:01:39,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:01:39,673 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 22:01:39,680 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 22:01:39,681 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 22:01:39,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:01:39,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:01:39,859 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 36 treesize of output 32 [2021-12-06 22:01:39,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:01:39,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000131916] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:01:39,953 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:01:39,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-12-06 22:01:39,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139913420] [2021-12-06 22:01:39,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:01:39,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 22:01:39,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:01:39,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 22:01:39,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-06 22:01:39,955 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:40,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:01:40,032 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2021-12-06 22:01:40,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 22:01:40,032 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-06 22:01:40,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:01:40,033 INFO L225 Difference]: With dead ends: 76 [2021-12-06 22:01:40,033 INFO L226 Difference]: Without dead ends: 76 [2021-12-06 22:01:40,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-12-06 22:01:40,034 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 339 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:01:40,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 58 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 40 Unchecked, 0.0s Time] [2021-12-06 22:01:40,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-06 22:01:40,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2021-12-06 22:01:40,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.446808510638298) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:40,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2021-12-06 22:01:40,039 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 16 [2021-12-06 22:01:40,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:01:40,039 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2021-12-06 22:01:40,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2021-12-06 22:01:40,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-06 22:01:40,040 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:01:40,040 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:01:40,072 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 22:01:40,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:01:40,242 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:01:40,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:01:40,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969267, now seen corresponding path program 2 times [2021-12-06 22:01:40,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:01:40,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528128385] [2021-12-06 22:01:40,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:40,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:01:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:40,356 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:01:40,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:01:40,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528128385] [2021-12-06 22:01:40,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528128385] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:01:40,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555620385] [2021-12-06 22:01:40,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 22:01:40,357 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:01:40,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:01:40,358 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:01:40,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 22:01:40,419 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 22:01:40,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 22:01:40,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 22:01:40,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:01:40,452 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:01:40,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:01:40,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:01:40,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555620385] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:01:40,476 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:01:40,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2021-12-06 22:01:40,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292473421] [2021-12-06 22:01:40,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:01:40,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:01:40,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:01:40,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:01:40,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:01:40,478 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:40,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:01:40,495 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2021-12-06 22:01:40,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:01:40,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-06 22:01:40,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:01:40,496 INFO L225 Difference]: With dead ends: 62 [2021-12-06 22:01:40,496 INFO L226 Difference]: Without dead ends: 62 [2021-12-06 22:01:40,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:01:40,497 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 103 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:01:40,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 56 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:01:40,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-06 22:01:40,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-12-06 22:01:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.425531914893617) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:40,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2021-12-06 22:01:40,502 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 22 [2021-12-06 22:01:40,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:01:40,502 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2021-12-06 22:01:40,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:40,502 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2021-12-06 22:01:40,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-06 22:01:40,503 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:01:40,503 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:01:40,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 22:01:40,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:01:40,705 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:01:40,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:01:40,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022382, now seen corresponding path program 1 times [2021-12-06 22:01:40,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:01:40,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168667895] [2021-12-06 22:01:40,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:40,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:01:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:40,868 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 22:01:40,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:01:40,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168667895] [2021-12-06 22:01:40,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168667895] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:01:40,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:01:40,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:01:40,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542112253] [2021-12-06 22:01:40,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:01:40,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 22:01:40,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:01:40,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 22:01:40,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 22:01:40,870 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:40,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:01:40,961 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2021-12-06 22:01:40,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 22:01:40,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-06 22:01:40,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:01:40,962 INFO L225 Difference]: With dead ends: 113 [2021-12-06 22:01:40,962 INFO L226 Difference]: Without dead ends: 113 [2021-12-06 22:01:40,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-06 22:01:40,963 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 259 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:01:40,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 123 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 22:01:40,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-06 22:01:40,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 65. [2021-12-06 22:01:40,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.46) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:40,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2021-12-06 22:01:40,967 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 23 [2021-12-06 22:01:40,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:01:40,967 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2021-12-06 22:01:40,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:40,968 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2021-12-06 22:01:40,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-06 22:01:40,968 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:01:40,968 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:01:40,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 22:01:40,968 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:01:40,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:01:40,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022381, now seen corresponding path program 1 times [2021-12-06 22:01:40,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:01:40,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053709643] [2021-12-06 22:01:40,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:40,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:01:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:41,031 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 22:01:41,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:01:41,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053709643] [2021-12-06 22:01:41,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053709643] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:01:41,032 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:01:41,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:01:41,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961130515] [2021-12-06 22:01:41,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:01:41,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 22:01:41,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:01:41,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 22:01:41,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 22:01:41,033 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:41,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:01:41,132 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2021-12-06 22:01:41,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 22:01:41,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-06 22:01:41,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:01:41,133 INFO L225 Difference]: With dead ends: 100 [2021-12-06 22:01:41,133 INFO L226 Difference]: Without dead ends: 100 [2021-12-06 22:01:41,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-06 22:01:41,134 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 265 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:01:41,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 101 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 22:01:41,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-06 22:01:41,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 65. [2021-12-06 22:01:41,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.42) internal successors, (71), 64 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:41,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2021-12-06 22:01:41,139 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 23 [2021-12-06 22:01:41,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:01:41,139 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2021-12-06 22:01:41,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:41,139 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2021-12-06 22:01:41,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-06 22:01:41,140 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:01:41,140 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 22:01:41,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 22:01:41,141 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:01:41,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:01:41,141 INFO L85 PathProgramCache]: Analyzing trace with hash -244809887, now seen corresponding path program 1 times [2021-12-06 22:01:41,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:01:41,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321611916] [2021-12-06 22:01:41,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:41,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:01:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 22:01:41,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:01:41,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321611916] [2021-12-06 22:01:41,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321611916] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:01:41,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:01:41,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:01:41,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814719304] [2021-12-06 22:01:41,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:01:41,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:01:41,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:01:41,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:01:41,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:01:41,186 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:41,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:01:41,194 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2021-12-06 22:01:41,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:01:41,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-06 22:01:41,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:01:41,195 INFO L225 Difference]: With dead ends: 65 [2021-12-06 22:01:41,195 INFO L226 Difference]: Without dead ends: 65 [2021-12-06 22:01:41,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:01:41,196 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 41 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:01:41,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 62 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:01:41,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-06 22:01:41,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2021-12-06 22:01:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2021-12-06 22:01:41,199 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 25 [2021-12-06 22:01:41,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:01:41,199 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-12-06 22:01:41,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:41,199 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2021-12-06 22:01:41,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 22:01:41,200 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:01:41,200 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:01:41,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 22:01:41,200 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:01:41,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:01:41,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689078, now seen corresponding path program 1 times [2021-12-06 22:01:41,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:01:41,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68392985] [2021-12-06 22:01:41,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:41,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:01:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 22:01:41,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:01:41,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68392985] [2021-12-06 22:01:41,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68392985] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:01:41,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:01:41,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:01:41,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763780056] [2021-12-06 22:01:41,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:01:41,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:01:41,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:01:41,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:01:41,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:01:41,243 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:41,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:01:41,263 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2021-12-06 22:01:41,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 22:01:41,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-06 22:01:41,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:01:41,264 INFO L225 Difference]: With dead ends: 49 [2021-12-06 22:01:41,264 INFO L226 Difference]: Without dead ends: 49 [2021-12-06 22:01:41,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-06 22:01:41,265 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 69 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:01:41,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 60 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:01:41,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-06 22:01:41,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2021-12-06 22:01:41,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:41,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2021-12-06 22:01:41,269 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 26 [2021-12-06 22:01:41,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:01:41,269 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2021-12-06 22:01:41,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:41,269 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2021-12-06 22:01:41,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 22:01:41,270 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:01:41,270 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] [2021-12-06 22:01:41,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 22:01:41,270 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:01:41,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:01:41,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689023, now seen corresponding path program 1 times [2021-12-06 22:01:41,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:01:41,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951893867] [2021-12-06 22:01:41,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:41,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:01:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:41,411 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:01:41,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:01:41,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951893867] [2021-12-06 22:01:41,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951893867] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:01:41,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333601799] [2021-12-06 22:01:41,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:41,412 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:01:41,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:01:41,412 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:01:41,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 22:01:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:41,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-06 22:01:41,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:01:41,485 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 22:01:41,511 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 22:01:41,511 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 22:01:41,529 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 13 treesize of output 9 [2021-12-06 22:01:41,556 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-06 22:01:41,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 22:01:41,575 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:01:41,575 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 22:01:41,678 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 13 [2021-12-06 22:01:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:01:41,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:01:41,776 INFO L354 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2021-12-06 22:01:41,777 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 20 [2021-12-06 22:01:41,781 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_591 (Array Int Int))) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_591) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) is different from false [2021-12-06 22:01:41,792 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (v_ArrVal_591 (Array Int Int))) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_588)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_591) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) is different from false [2021-12-06 22:01:41,803 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-06 22:01:41,804 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 2 case distinctions, treesize of input 27 treesize of output 33 [2021-12-06 22:01:41,806 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 22:01:41,809 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 3 [2021-12-06 22:01:41,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-06 22:01:41,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333601799] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:01:41,850 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:01:41,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30 [2021-12-06 22:01:41,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337248209] [2021-12-06 22:01:41,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:01:41,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-06 22:01:41,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:01:41,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-06 22:01:41,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=736, Unknown=2, NotChecked=110, Total=930 [2021-12-06 22:01:41,852 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:42,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:01:42,580 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2021-12-06 22:01:42,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-06 22:01:42,581 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-06 22:01:42,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:01:42,582 INFO L225 Difference]: With dead ends: 129 [2021-12-06 22:01:42,582 INFO L226 Difference]: Without dead ends: 129 [2021-12-06 22:01:42,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=317, Invalid=1757, Unknown=4, NotChecked=178, Total=2256 [2021-12-06 22:01:42,584 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 481 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 257 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 22:01:42,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [481 Valid, 792 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 863 Invalid, 0 Unknown, 257 Unchecked, 0.3s Time] [2021-12-06 22:01:42,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-06 22:01:42,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 69. [2021-12-06 22:01:42,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 68 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2021-12-06 22:01:42,587 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 26 [2021-12-06 22:01:42,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:01:42,587 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2021-12-06 22:01:42,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:42,588 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2021-12-06 22:01:42,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 22:01:42,588 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:01:42,588 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] [2021-12-06 22:01:42,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 22:01:42,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-06 22:01:42,789 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:01:42,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:01:42,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689024, now seen corresponding path program 1 times [2021-12-06 22:01:42,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:01:42,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204057553] [2021-12-06 22:01:42,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:42,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:01:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:42,970 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:01:42,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:01:42,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204057553] [2021-12-06 22:01:42,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204057553] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:01:42,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43530140] [2021-12-06 22:01:42,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:42,970 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:01:42,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:01:42,971 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:01:42,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 22:01:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:43,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 53 conjunts are in the unsatisfiable core [2021-12-06 22:01:43,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:01:43,040 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 22:01:43,088 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 22:01:43,088 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 22:01:43,111 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 13 treesize of output 9 [2021-12-06 22:01:43,115 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 13 treesize of output 9 [2021-12-06 22:01:43,147 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-06 22:01:43,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 22:01:43,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:01:43,152 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 23 treesize of output 22 [2021-12-06 22:01:43,173 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:01:43,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2021-12-06 22:01:43,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2021-12-06 22:01:43,310 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 39 treesize of output 21 [2021-12-06 22:01:43,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2021-12-06 22:01:43,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:01:43,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:01:43,551 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:01:43,551 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 46 treesize of output 50 [2021-12-06 22:01:43,587 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_694 (Array Int Int))) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_694) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_ArrVal_693 (Array Int Int))) (<= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)))) is different from false [2021-12-06 22:01:43,606 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_690 Int) (v_prenex_1 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_690)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_ArrVal_690 Int) (v_ArrVal_693 (Array Int Int))) (<= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_690)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (forall ((v_ArrVal_694 (Array Int Int)) (v_ArrVal_689 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_689)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_694) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) is different from false [2021-12-06 22:01:43,621 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-06 22:01:43,621 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 2 case distinctions, treesize of input 27 treesize of output 33 [2021-12-06 22:01:43,623 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 22:01:43,625 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 3 [2021-12-06 22:01:43,634 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-06 22:01:43,634 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 2 case distinctions, treesize of input 27 treesize of output 33 [2021-12-06 22:01:43,635 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:01:43,636 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 8 [2021-12-06 22:01:43,641 INFO L354 Elim1Store]: treesize reduction 47, result has 2.1 percent of original size [2021-12-06 22:01:43,641 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 2 case distinctions, treesize of input 29 treesize of output 1 [2021-12-06 22:01:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-06 22:01:43,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43530140] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:01:43,785 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:01:43,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 35 [2021-12-06 22:01:43,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180134181] [2021-12-06 22:01:43,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:01:43,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-06 22:01:43,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:01:43,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-06 22:01:43,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1031, Unknown=2, NotChecked=130, Total=1260 [2021-12-06 22:01:43,787 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:44,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:01:44,932 INFO L93 Difference]: Finished difference Result 175 states and 191 transitions. [2021-12-06 22:01:44,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-06 22:01:44,933 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-06 22:01:44,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:01:44,934 INFO L225 Difference]: With dead ends: 175 [2021-12-06 22:01:44,934 INFO L226 Difference]: Without dead ends: 175 [2021-12-06 22:01:44,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=306, Invalid=2150, Unknown=2, NotChecked=194, Total=2652 [2021-12-06 22:01:44,935 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 621 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 327 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 22:01:44,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [621 Valid, 932 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 649 Invalid, 0 Unknown, 327 Unchecked, 0.3s Time] [2021-12-06 22:01:44,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-12-06 22:01:44,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 97. [2021-12-06 22:01:44,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 96 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:44,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2021-12-06 22:01:44,938 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 26 [2021-12-06 22:01:44,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:01:44,939 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2021-12-06 22:01:44,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:44,939 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2021-12-06 22:01:44,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-06 22:01:44,940 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:01:44,940 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] [2021-12-06 22:01:44,961 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-06 22:01:45,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-06 22:01:45,142 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:01:45,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:01:45,143 INFO L85 PathProgramCache]: Analyzing trace with hash -709592258, now seen corresponding path program 1 times [2021-12-06 22:01:45,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:01:45,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65128110] [2021-12-06 22:01:45,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:45,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:01:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:45,195 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 22:01:45,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:01:45,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65128110] [2021-12-06 22:01:45,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65128110] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:01:45,196 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:01:45,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:01:45,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351505561] [2021-12-06 22:01:45,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:01:45,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 22:01:45,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:01:45,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 22:01:45,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 22:01:45,196 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:45,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:01:45,273 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2021-12-06 22:01:45,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 22:01:45,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-06 22:01:45,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:01:45,275 INFO L225 Difference]: With dead ends: 108 [2021-12-06 22:01:45,275 INFO L226 Difference]: Without dead ends: 108 [2021-12-06 22:01:45,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-06 22:01:45,276 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 122 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:01:45,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 63 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 22:01:45,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-06 22:01:45,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 98. [2021-12-06 22:01:45,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 97 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:45,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 113 transitions. [2021-12-06 22:01:45,280 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 113 transitions. Word has length 31 [2021-12-06 22:01:45,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:01:45,280 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 113 transitions. [2021-12-06 22:01:45,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:45,280 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2021-12-06 22:01:45,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-06 22:01:45,281 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:01:45,281 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] [2021-12-06 22:01:45,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 22:01:45,282 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:01:45,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:01:45,282 INFO L85 PathProgramCache]: Analyzing trace with hash -709592257, now seen corresponding path program 1 times [2021-12-06 22:01:45,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:01:45,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124980676] [2021-12-06 22:01:45,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:45,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:01:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:45,326 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 22:01:45,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:01:45,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124980676] [2021-12-06 22:01:45,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124980676] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:01:45,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987881736] [2021-12-06 22:01:45,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:45,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:01:45,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:01:45,328 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:01:45,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 22:01:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:45,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 22:01:45,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:01:45,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 22:01:45,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:01:45,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987881736] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:01:45,431 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 22:01:45,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2021-12-06 22:01:45,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656684762] [2021-12-06 22:01:45,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:01:45,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 22:01:45,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:01:45,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:01:45,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-06 22:01:45,432 INFO L87 Difference]: Start difference. First operand 98 states and 113 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:45,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:01:45,454 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2021-12-06 22:01:45,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 22:01:45,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-06 22:01:45,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:01:45,455 INFO L225 Difference]: With dead ends: 102 [2021-12-06 22:01:45,455 INFO L226 Difference]: Without dead ends: 102 [2021-12-06 22:01:45,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-06 22:01:45,456 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 61 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:01:45,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 86 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:01:45,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-06 22:01:45,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 91. [2021-12-06 22:01:45,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 90 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:45,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2021-12-06 22:01:45,458 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 31 [2021-12-06 22:01:45,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:01:45,458 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2021-12-06 22:01:45,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:45,458 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2021-12-06 22:01:45,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-06 22:01:45,459 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:01:45,459 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:01:45,479 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-06 22:01:45,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-06 22:01:45,661 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:01:45,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:01:45,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1698966507, now seen corresponding path program 2 times [2021-12-06 22:01:45,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:01:45,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594433854] [2021-12-06 22:01:45,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:45,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:01:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 22:01:45,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:01:45,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594433854] [2021-12-06 22:01:45,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594433854] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:01:45,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185351258] [2021-12-06 22:01:45,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 22:01:45,778 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:01:45,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:01:45,779 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:01:45,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 22:01:45,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 22:01:45,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 22:01:45,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 22:01:45,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:01:45,906 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 22:01:45,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:01:45,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185351258] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:01:45,906 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 22:01:45,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2021-12-06 22:01:45,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226938677] [2021-12-06 22:01:45,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:01:45,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 22:01:45,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:01:45,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:01:45,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:01:45,907 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:45,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:01:45,914 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2021-12-06 22:01:45,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:01:45,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-06 22:01:45,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:01:45,915 INFO L225 Difference]: With dead ends: 53 [2021-12-06 22:01:45,915 INFO L226 Difference]: Without dead ends: 53 [2021-12-06 22:01:45,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:01:45,915 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 60 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:01:45,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 58 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:01:45,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-06 22:01:45,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-12-06 22:01:45,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2021-12-06 22:01:45,918 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 34 [2021-12-06 22:01:45,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:01:45,918 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2021-12-06 22:01:45,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:45,918 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2021-12-06 22:01:45,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-06 22:01:45,919 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:01:45,919 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] [2021-12-06 22:01:45,939 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-06 22:01:46,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-06 22:01:46,120 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:01:46,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:01:46,120 INFO L85 PathProgramCache]: Analyzing trace with hash -674776797, now seen corresponding path program 1 times [2021-12-06 22:01:46,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:01:46,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334383456] [2021-12-06 22:01:46,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:46,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:01:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 22:01:46,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:01:46,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334383456] [2021-12-06 22:01:46,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334383456] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:01:46,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855149219] [2021-12-06 22:01:46,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:46,159 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:01:46,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:01:46,160 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:01:46,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 22:01:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:46,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 22:01:46,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:01:46,271 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 22:01:46,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:01:46,305 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 22:01:46,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855149219] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:01:46,305 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:01:46,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2021-12-06 22:01:46,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313048588] [2021-12-06 22:01:46,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:01:46,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 22:01:46,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:01:46,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 22:01:46,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-06 22:01:46,306 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:46,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:01:46,317 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2021-12-06 22:01:46,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:01:46,317 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-06 22:01:46,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:01:46,318 INFO L225 Difference]: With dead ends: 57 [2021-12-06 22:01:46,318 INFO L226 Difference]: Without dead ends: 57 [2021-12-06 22:01:46,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-06 22:01:46,318 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 62 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:01:46,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 79 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:01:46,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-06 22:01:46,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-12-06 22:01:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.196078431372549) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:46,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2021-12-06 22:01:46,320 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 34 [2021-12-06 22:01:46,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:01:46,320 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2021-12-06 22:01:46,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2021-12-06 22:01:46,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-06 22:01:46,321 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:01:46,321 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] [2021-12-06 22:01:46,349 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-06 22:01:46,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-06 22:01:46,523 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:01:46,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:01:46,524 INFO L85 PathProgramCache]: Analyzing trace with hash -634882153, now seen corresponding path program 1 times [2021-12-06 22:01:46,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:01:46,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953956885] [2021-12-06 22:01:46,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:46,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:01:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:46,604 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 22:01:46,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:01:46,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953956885] [2021-12-06 22:01:46,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953956885] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:01:46,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179462454] [2021-12-06 22:01:46,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:46,605 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:01:46,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:01:46,605 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:01:46,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-06 22:01:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:46,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 22:01:46,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:01:46,731 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 22:01:46,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:01:46,767 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 22:01:46,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179462454] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:01:46,767 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:01:46,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2021-12-06 22:01:46,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142233177] [2021-12-06 22:01:46,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:01:46,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 22:01:46,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:01:46,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 22:01:46,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-06 22:01:46,768 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:46,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:01:46,791 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2021-12-06 22:01:46,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 22:01:46,791 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-06 22:01:46,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:01:46,792 INFO L225 Difference]: With dead ends: 52 [2021-12-06 22:01:46,792 INFO L226 Difference]: Without dead ends: 52 [2021-12-06 22:01:46,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-12-06 22:01:46,793 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 64 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:01:46,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 106 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:01:46,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-06 22:01:46,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-12-06 22:01:46,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:46,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2021-12-06 22:01:46,796 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 34 [2021-12-06 22:01:46,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:01:46,796 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2021-12-06 22:01:46,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:46,796 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2021-12-06 22:01:46,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-06 22:01:46,797 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:01:46,797 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] [2021-12-06 22:01:46,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-06 22:01:46,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:01:46,998 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:01:46,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:01:46,999 INFO L85 PathProgramCache]: Analyzing trace with hash -427165145, now seen corresponding path program 2 times [2021-12-06 22:01:46,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:01:46,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184267702] [2021-12-06 22:01:47,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:47,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:01:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:47,110 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 22:01:47,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:01:47,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184267702] [2021-12-06 22:01:47,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184267702] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:01:47,111 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:01:47,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:01:47,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785867862] [2021-12-06 22:01:47,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:01:47,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 22:01:47,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:01:47,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 22:01:47,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 22:01:47,112 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:47,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:01:47,208 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2021-12-06 22:01:47,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 22:01:47,209 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-06 22:01:47,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:01:47,209 INFO L225 Difference]: With dead ends: 60 [2021-12-06 22:01:47,209 INFO L226 Difference]: Without dead ends: 60 [2021-12-06 22:01:47,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-06 22:01:47,210 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 147 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:01:47,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 36 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 22:01:47,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-06 22:01:47,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2021-12-06 22:01:47,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:47,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2021-12-06 22:01:47,212 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 39 [2021-12-06 22:01:47,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:01:47,212 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2021-12-06 22:01:47,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:47,212 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2021-12-06 22:01:47,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-06 22:01:47,212 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:01:47,212 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] [2021-12-06 22:01:47,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-06 22:01:47,212 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:01:47,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:01:47,213 INFO L85 PathProgramCache]: Analyzing trace with hash -357219036, now seen corresponding path program 1 times [2021-12-06 22:01:47,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:01:47,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364526944] [2021-12-06 22:01:47,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:47,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:01:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 22:01:47,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:01:47,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364526944] [2021-12-06 22:01:47,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364526944] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:01:47,252 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:01:47,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 22:01:47,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012923245] [2021-12-06 22:01:47,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:01:47,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 22:01:47,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:01:47,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 22:01:47,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 22:01:47,253 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:47,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:01:47,314 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2021-12-06 22:01:47,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 22:01:47,314 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-06 22:01:47,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:01:47,315 INFO L225 Difference]: With dead ends: 57 [2021-12-06 22:01:47,315 INFO L226 Difference]: Without dead ends: 57 [2021-12-06 22:01:47,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-06 22:01:47,316 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 134 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:01:47,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 58 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:01:47,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-06 22:01:47,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2021-12-06 22:01:47,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 53 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:47,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2021-12-06 22:01:47,318 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 40 [2021-12-06 22:01:47,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:01:47,319 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2021-12-06 22:01:47,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:47,319 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2021-12-06 22:01:47,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-06 22:01:47,319 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:01:47,319 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] [2021-12-06 22:01:47,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-06 22:01:47,320 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:01:47,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:01:47,320 INFO L85 PathProgramCache]: Analyzing trace with hash 311339877, now seen corresponding path program 1 times [2021-12-06 22:01:47,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:01:47,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549639932] [2021-12-06 22:01:47,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:47,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:01:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:47,374 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 22:01:47,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:01:47,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549639932] [2021-12-06 22:01:47,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549639932] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:01:47,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:01:47,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:01:47,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517231075] [2021-12-06 22:01:47,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:01:47,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 22:01:47,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:01:47,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 22:01:47,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 22:01:47,375 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:47,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:01:47,444 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2021-12-06 22:01:47,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 22:01:47,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-06 22:01:47,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:01:47,444 INFO L225 Difference]: With dead ends: 55 [2021-12-06 22:01:47,444 INFO L226 Difference]: Without dead ends: 55 [2021-12-06 22:01:47,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-06 22:01:47,445 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:01:47,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 45 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:01:47,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-06 22:01:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-12-06 22:01:47,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:47,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2021-12-06 22:01:47,452 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 42 [2021-12-06 22:01:47,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:01:47,452 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2021-12-06 22:01:47,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:01:47,452 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2021-12-06 22:01:47,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-06 22:01:47,453 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:01:47,453 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] [2021-12-06 22:01:47,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-06 22:01:47,453 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:01:47,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:01:47,453 INFO L85 PathProgramCache]: Analyzing trace with hash -2002912181, now seen corresponding path program 1 times [2021-12-06 22:01:47,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:01:47,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934585279] [2021-12-06 22:01:47,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:47,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:01:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:47,723 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 22:01:47,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:01:47,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934585279] [2021-12-06 22:01:47,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934585279] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:01:47,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478963833] [2021-12-06 22:01:47,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:01:47,724 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:01:47,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:01:47,724 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:01:47,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-06 22:01:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:01:47,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-06 22:01:47,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:01:47,821 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 22:01:47,856 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 22:01:47,856 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 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 22:01:47,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 22:01:47,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:01:47,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 22:01:47,962 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:01:47,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-06 22:01:48,193 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:01:48,193 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 39 treesize of output 38 [2021-12-06 22:01:48,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:01:48,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:01:48,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2021-12-06 22:01:48,400 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:01:48,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2021-12-06 22:01:48,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-06 22:01:48,528 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:01:48,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:01:50,994 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1502 Int)) (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1502) 4)) 1)) (forall ((v_ArrVal_1502 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1502) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2021-12-06 22:01:51,036 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:01:51,036 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 37 treesize of output 41 [2021-12-06 22:01:51,070 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1501 (Array Int Int)) (v_prenex_3 Int)) (= |c_ULTIMATE.start_dll_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1501) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4))) (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1502 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1501) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1502) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))))) is different from false [2021-12-06 22:01:51,104 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1502 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1501) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1502) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1501 (Array Int Int)) (v_prenex_3 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1501) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4) |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base|))))) is different from false [2021-12-06 22:01:51,123 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1501 (Array Int Int)) (v_prenex_3 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1501) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4) .cse0))) (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1502 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1501) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1502) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))))) is different from false [2021-12-06 22:01:51,160 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1502 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| 4)) v_ArrVal_1501) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1502) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1501 (Array Int Int)) (v_prenex_3 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| 4)))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1501) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4))))))) is different from false [2021-12-06 22:01:51,181 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1501 (Array Int Int)) (v_prenex_3 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1501) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4) .cse0))) (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1502 Int)) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1501) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1502) 4))))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2021-12-06 22:01:51,201 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1502 Int)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1501) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1502) 4)))) (forall ((v_ArrVal_1501 (Array Int Int)) (v_prenex_3 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1501) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4))))))) is different from false [2021-12-06 22:01:51,243 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1501 (Array Int Int)) (v_prenex_3 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1501) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4) .cse0))) (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1502 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1501) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1502) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2021-12-06 22:01:51,269 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1500 (Array Int Int)) (v_prenex_3 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1500))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (= .cse0 (select (store (select (store .cse1 .cse0 v_ArrVal_1501) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4))))) (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1500 (Array Int Int)) (v_ArrVal_1502 Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1500))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1501)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1502) 4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2021-12-06 22:01:51,311 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1500 (Array Int Int)) (v_ArrVal_1502 Int)) (not (= (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1500))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1501)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1502) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1500 (Array Int Int)) (v_prenex_3 Int)) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1500))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (= (select (store (select (store .cse1 .cse2 v_ArrVal_1501) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4) .cse2))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2021-12-06 22:01:51,320 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:01:51,324 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:01:51,324 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 2 case distinctions, treesize of input 136 treesize of output 82 [2021-12-06 22:01:51,328 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 685 treesize of output 635 [2021-12-06 22:01:51,334 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:01:51,344 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:01:51,344 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 702 treesize of output 624 [2021-12-06 22:01:51,355 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 527 treesize of output 523 [2021-12-06 22:01:51,368 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:01:51,368 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 571 treesize of output 502 [2021-12-06 22:01:51,376 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 571 treesize of output 555 [2021-12-06 22:01:51,389 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:01:51,389 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 566 treesize of output 559 [2021-12-06 22:02:03,858 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2021-12-06 22:02:03,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478963833] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:02:03,858 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:02:03,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 21] total 57 [2021-12-06 22:02:03,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997296426] [2021-12-06 22:02:03,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:02:03,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2021-12-06 22:02:03,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:02:03,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-12-06 22:02:03,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2121, Unknown=10, NotChecked=1010, Total=3306 [2021-12-06 22:02:03,860 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 58 states, 57 states have (on average 2.1578947368421053) internal successors, (123), 58 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:02:17,995 WARN L227 SmtUtils]: Spent 14.03s on a formula simplification. DAG size of input: 52 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 22:02:20,010 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select .cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (or (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| 0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1500 (Array Int Int)) (v_prenex_3 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1500))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (= .cse1 (select (store (select (store .cse2 .cse1 v_ArrVal_1501) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4))))) (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1500 (Array Int Int)) (v_ArrVal_1502 Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1500))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1501)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1502) 4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= (select .cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8)) 0))) is different from false [2021-12-06 22:02:36,185 WARN L227 SmtUtils]: Spent 16.05s on a formula simplification. DAG size of input: 56 DAG size of output: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 22:02:38,188 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select .cse0 .cse1)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (or (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| 0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1500 (Array Int Int)) (v_prenex_3 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1500))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (= .cse2 (select (store (select (store .cse3 .cse2 v_ArrVal_1501) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4))))) (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1500 (Array Int Int)) (v_ArrVal_1502 Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1500))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1501)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1502) 4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= (select .cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8)) 0))) is different from false [2021-12-06 22:02:40,194 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select .cse0 .cse1)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1500 (Array Int Int)) (v_prenex_3 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1500))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (= .cse2 (select (store (select (store .cse3 .cse2 v_ArrVal_1501) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4))))) (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1500 (Array Int Int)) (v_ArrVal_1502 Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1500))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1501)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1502) 4))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= (select .cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8)) 0))) is different from false [2021-12-06 22:02:42,199 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= (select .cse1 .cse0) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1501 (Array Int Int)) (v_prenex_3 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1501) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4) .cse2))) (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1502 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1501) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1502) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8)) 0))) is different from false [2021-12-06 22:02:44,203 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select .cse0 4))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1502 Int)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1501) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1502) 4)))) (forall ((v_ArrVal_1501 (Array Int Int)) (v_prenex_3 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= .cse1 (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1501) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select .cse0 8) 0))) is different from false [2021-12-06 22:02:46,209 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (not (= |c_ULTIMATE.start_dll_create_#res#1.base| 0)) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| (select .cse0 4))) (= (select .cse0 8) 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1501 (Array Int Int)) (v_prenex_3 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1501) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4) .cse1))) (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1502 Int)) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1501) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1502) 4))))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) |c_ULTIMATE.start_dll_create_#res#1.offset|) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0))) is different from false [2021-12-06 22:02:48,213 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select .cse0 4))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1502 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| 4)) v_ArrVal_1501) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1502) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1501 (Array Int Int)) (v_prenex_3 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (= .cse1 (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1501) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4))))))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= (select .cse0 8) 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-06 22:02:50,217 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select .cse0 4))) (= |c_ULTIMATE.start_main_~s~0#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) .cse1) |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (= |c_ULTIMATE.start_dll_update_at_~head#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| 0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1501 (Array Int Int)) (v_prenex_3 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1501) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4) .cse2))) (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1502 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1501) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1502) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))))) (= (select .cse0 8) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|) .cse1) |c_ULTIMATE.start_main_~s~0#1.offset|) (= |c_ULTIMATE.start_main_~s~0#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.offset|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-06 22:02:52,222 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 4))) (and (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| 0)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base|)) (= (select .cse1 8) 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base|) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1502 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1501) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1502) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1501 (Array Int Int)) (v_prenex_3 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1501) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4) |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base|))))) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| .cse0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-06 22:02:54,226 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select .cse0 4))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1501 (Array Int Int)) (v_prenex_3 Int)) (= |c_ULTIMATE.start_dll_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1501) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_3) 4))) (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1502 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1501) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1502) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| 0)) (= (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_~head#1.base|) (= (select .cse0 8) 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-06 22:02:54,618 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select .cse0 4))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| 0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1502 Int)) (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1502) 4)) 1)) (forall ((v_ArrVal_1502 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1502) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (= (select .cse0 8) 0) (= 1 (select |c_#valid| (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-06 22:02:54,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:02:54,935 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2021-12-06 22:02:54,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-06 22:02:54,935 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 2.1578947368421053) internal successors, (123), 58 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-06 22:02:54,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:02:54,936 INFO L225 Difference]: With dead ends: 64 [2021-12-06 22:02:54,936 INFO L226 Difference]: Without dead ends: 64 [2021-12-06 22:02:54,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 53.9s TimeCoverageRelationStatistics Valid=315, Invalid=3054, Unknown=21, NotChecked=2772, Total=6162 [2021-12-06 22:02:54,938 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 62 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 358 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 22:02:54,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 406 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 625 Invalid, 0 Unknown, 358 Unchecked, 0.2s Time] [2021-12-06 22:02:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-06 22:02:54,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2021-12-06 22:02:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.150943396226415) internal successors, (61), 57 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:02:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2021-12-06 22:02:54,940 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 45 [2021-12-06 22:02:54,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:02:54,940 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2021-12-06 22:02:54,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 2.1578947368421053) internal successors, (123), 58 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:02:54,940 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2021-12-06 22:02:54,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-06 22:02:54,941 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:02:54,941 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] [2021-12-06 22:02:54,960 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-06 22:02:55,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:02:55,142 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:02:55,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:02:55,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2002912180, now seen corresponding path program 1 times [2021-12-06 22:02:55,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:02:55,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743606004] [2021-12-06 22:02:55,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:02:55,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:02:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:02:55,592 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 22:02:55,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:02:55,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743606004] [2021-12-06 22:02:55,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743606004] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:02:55,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314022922] [2021-12-06 22:02:55,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:02:55,593 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:02:55,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:02:55,594 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:02:55,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-06 22:02:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:02:55,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 85 conjunts are in the unsatisfiable core [2021-12-06 22:02:55,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:02:55,687 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 22:02:55,735 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 22:02:55,735 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 22:02:55,762 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 13 treesize of output 9 [2021-12-06 22:02:55,766 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 13 treesize of output 9 [2021-12-06 22:02:55,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:02:55,797 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 23 treesize of output 22 [2021-12-06 22:02:55,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:02:55,801 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 23 treesize of output 22 [2021-12-06 22:02:55,822 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:02:55,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-06 22:02:55,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-06 22:02:56,044 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:02:56,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2021-12-06 22:02:56,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:02:56,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-06 22:02:56,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:02:56,099 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 19 treesize of output 18 [2021-12-06 22:02:56,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:02:56,102 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 22:02:56,177 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:02:56,177 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 17 treesize of output 17 [2021-12-06 22:02:56,181 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:02:56,181 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 23 [2021-12-06 22:02:56,296 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 22:02:56,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:02:58,877 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1639 Int) (v_ArrVal_1637 Int)) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1639) 4) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1637) 4)))) (forall ((v_ArrVal_1639 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1639) 4) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) is different from false [2021-12-06 22:02:58,932 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1639 Int) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1637 Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1635) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1639) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1636) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1637) 4)))) (forall ((v_ArrVal_1639 Int) (v_ArrVal_1635 (Array Int Int))) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1635) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1639) 4) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) is different from false [2021-12-06 22:02:58,969 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1639 Int) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1637 Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1635) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1639) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1636) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1637) 4)))) (forall ((v_ArrVal_1639 Int) (v_ArrVal_1635 (Array Int Int))) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1635) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1639) 4) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) is different from false [2021-12-06 22:02:58,994 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1639 Int) (v_ArrVal_1635 (Array Int Int))) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1635) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1639) 4) 4))) (forall ((v_ArrVal_1639 Int) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1637 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1635) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1639) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1636) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1637) 4)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) is different from false [2021-12-06 22:02:59,039 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1639 Int) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1637 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| 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1635) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1639) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1636) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1637) 4))))) (forall ((v_ArrVal_1639 Int) (v_ArrVal_1635 (Array Int 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| 4)) v_ArrVal_1635) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1639) 4) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) is different from false [2021-12-06 22:02:59,061 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (and (forall ((v_ArrVal_1639 Int) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1637 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1635) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1639) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1636) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1637) 4))))) (forall ((v_ArrVal_1639 Int) (v_ArrVal_1635 (Array Int Int))) (<= 0 (+ 4 (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1635) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1639) 4))))))) is different from false [2021-12-06 22:02:59,083 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (and (forall ((v_ArrVal_1639 Int) (v_ArrVal_1635 (Array Int Int))) (<= 0 (+ 4 (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1635) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1639) 4)))) (forall ((v_ArrVal_1639 Int) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1637 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1635) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1639) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1636) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1637) 4)))))))) is different from false [2021-12-06 22:02:59,121 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (and (forall ((v_ArrVal_1639 Int) (v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1637 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1635) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1639) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1636) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1637) 4))))) (forall ((v_ArrVal_1639 Int) (v_ArrVal_1635 (Array Int Int))) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1635) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1639) 4) 4)))))) is different from false [2021-12-06 22:02:59,136 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:02:59,136 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 87 treesize of output 91 [2021-12-06 22:02:59,203 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1633 (Array Int Int)) (v_prenex_13 Int) (v_prenex_14 (Array Int Int))) (<= (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1634) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1633) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_14) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_prenex_13) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (forall ((v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1637 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1633))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1636)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1637) 4))) (forall ((v_ArrVal_1639 Int) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1633 (Array Int Int))) (<= 0 (+ (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1634) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1633) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1635) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1639) 4) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) is different from false [2021-12-06 22:02:59,281 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (and (forall ((v_ArrVal_1636 (Array Int Int)) (v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1631 Int) (v_ArrVal_1637 Int)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1631)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1633))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1636)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1637) 4))) (forall ((v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1633 (Array Int Int)) (v_prenex_13 Int) (v_ArrVal_1631 Int) (v_prenex_14 (Array Int Int)) (v_ArrVal_1630 Int)) (<= (select (store (select (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_1630)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1634) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_1631)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1633) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_14)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_prenex_13) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (forall ((v_ArrVal_1639 Int) (v_ArrVal_1635 (Array Int Int)) (v_ArrVal_1634 (Array Int Int)) (v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1631 Int) (v_ArrVal_1630 Int)) (<= 0 (+ (select (store (select (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_ArrVal_1630)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1634) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_ArrVal_1631)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1633) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1635)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1639) 4) 4)))))) is different from false [2021-12-06 22:02:59,293 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:02:59,299 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:02:59,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 170 treesize of output 181 [2021-12-06 22:02:59,303 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:02:59,311 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:02:59,311 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 6 case distinctions, treesize of input 181 treesize of output 181 [2021-12-06 22:02:59,314 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:02:59,318 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:02:59,318 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 210 treesize of output 192 [2021-12-06 22:02:59,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 394 treesize of output 384 [2021-12-06 22:02:59,329 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:02:59,342 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:02:59,343 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 420 treesize of output 426 [2021-12-06 22:02:59,349 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 677 treesize of output 657 [2021-12-06 22:02:59,358 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:02:59,362 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:02:59,362 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 686 treesize of output 668 [2021-12-06 22:02:59,372 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 788 treesize of output 780 [2021-12-06 22:02:59,382 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:02:59,393 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:02:59,393 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 804 treesize of output 812 [2021-12-06 22:02:59,405 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:02:59,416 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:02:59,416 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 832 treesize of output 816 [2021-12-06 22:02:59,446 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 697 treesize of output 691 [2021-12-06 22:02:59,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 691 treesize of output 675 [2021-12-06 22:02:59,465 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 747 treesize of output 735 [2021-12-06 22:02:59,476 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 759 treesize of output 755 [2021-12-06 22:02:59,487 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 803 treesize of output 795 [2021-12-06 22:02:59,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 795 treesize of output 779 [2021-12-06 22:02:59,520 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:02:59,520 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 799 treesize of output 782 [2021-12-06 22:02:59,532 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 811 treesize of output 803 [2021-12-06 22:03:00,041 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2021-12-06 22:03:00,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314022922] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:03:00,041 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:03:00,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 21] total 58 [2021-12-06 22:03:00,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470402798] [2021-12-06 22:03:00,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:03:00,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2021-12-06 22:03:00,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:03:00,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-12-06 22:03:00,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2179, Unknown=10, NotChecked=1030, Total=3422 [2021-12-06 22:03:00,043 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 59 states, 58 states have (on average 2.2241379310344827) internal successors, (129), 59 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:04:18,696 WARN L227 SmtUtils]: Spent 1.29m on a formula simplification. DAG size of input: 87 DAG size of output: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 22:04:41,637 WARN L227 SmtUtils]: Spent 22.84s on a formula simplification. DAG size of input: 62 DAG size of output: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 22:04:42,274 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1639 Int) (v_ArrVal_1637 Int)) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1639) 4) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1637) 4)))) (forall ((v_ArrVal_1639 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1639) 4) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= |c_ULTIMATE.start_dll_update_at_~head#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= (select |c_#length| |c_ULTIMATE.start_dll_update_at_~head#1.base|) 12) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)) is different from false [2021-12-06 22:04:42,863 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse1 (select |c_#length| .cse0))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1639 Int) (v_ArrVal_1637 Int)) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1639) 4) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1637) 4)))) (forall ((v_ArrVal_1639 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1639) 4) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) (= .cse1 12) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (<= 12 .cse1) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-06 22:04:43,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:04:43,295 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2021-12-06 22:04:43,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-06 22:04:43,296 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.2241379310344827) internal successors, (129), 59 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-06 22:04:43,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:04:43,296 INFO L225 Difference]: With dead ends: 66 [2021-12-06 22:04:43,296 INFO L226 Difference]: Without dead ends: 66 [2021-12-06 22:04:43,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 106.2s TimeCoverageRelationStatistics Valid=437, Invalid=3758, Unknown=13, NotChecked=1644, Total=5852 [2021-12-06 22:04:43,298 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 197 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 629 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 22:04:43,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 317 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 622 Invalid, 0 Unknown, 629 Unchecked, 0.3s Time] [2021-12-06 22:04:43,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-06 22:04:43,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2021-12-06 22:04:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:04:43,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2021-12-06 22:04:43,300 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 45 [2021-12-06 22:04:43,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:04:43,300 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2021-12-06 22:04:43,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.2241379310344827) internal successors, (129), 59 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:04:43,301 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2021-12-06 22:04:43,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-06 22:04:43,301 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:04:43,301 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] [2021-12-06 22:04:43,320 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-06 22:04:43,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-06 22:04:43,502 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:04:43,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:04:43,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1960736865, now seen corresponding path program 1 times [2021-12-06 22:04:43,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:04:43,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513795274] [2021-12-06 22:04:43,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:04:43,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:04:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:04:43,833 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 22:04:43,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:04:43,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513795274] [2021-12-06 22:04:43,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513795274] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:04:43,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834400617] [2021-12-06 22:04:43,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:04:43,833 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:04:43,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:04:43,834 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:04:43,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-06 22:04:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:04:43,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 67 conjunts are in the unsatisfiable core [2021-12-06 22:04:43,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:04:43,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 22:04:43,978 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 22:04:43,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 22:04:44,009 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 13 treesize of output 9 [2021-12-06 22:04:44,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:04:44,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 22:04:44,085 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:04:44,086 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 42 treesize of output 41 [2021-12-06 22:04:44,337 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:04:44,337 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 36 treesize of output 35 [2021-12-06 22:04:44,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:04:44,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:04:44,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2021-12-06 22:04:44,483 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:04:44,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 35 [2021-12-06 22:04:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 22:04:44,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:04:45,073 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1767 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1767) 4) 0)))) is different from false [2021-12-06 22:04:45,091 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1767 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1767) 4) 0)))) is different from false [2021-12-06 22:04:45,104 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1767 Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1767) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2021-12-06 22:04:45,112 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1767 Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1767) 4) 0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2021-12-06 22:04:45,125 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1767 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|) (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| 4)) v_ArrVal_1765) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1767) 4) 0)))) is different from false [2021-12-06 22:04:45,134 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1767 Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1765) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1767) 4) 0)) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2021-12-06 22:04:45,142 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1767 Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1765) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1767) 4) 0)))) is different from false [2021-12-06 22:04:45,156 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1767 Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1765) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1767) 4) 0)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2021-12-06 22:04:45,165 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1764 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1767 Int)) (or (not (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1764))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1765)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1767) 4) 0)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2021-12-06 22:04:45,181 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1764 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1767 Int)) (or (not (= (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1764))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1765)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1767) 4) 0)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|))) is different from false [2021-12-06 22:04:45,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:04:45,190 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:04:45,191 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 2 case distinctions, treesize of input 56 treesize of output 47 [2021-12-06 22:04:45,193 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 305 treesize of output 285 [2021-12-06 22:04:45,198 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 312 treesize of output 304 [2021-12-06 22:04:45,202 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:04:45,210 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:04:45,210 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 343 treesize of output 327 [2021-12-06 22:04:45,220 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:04:45,221 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 266 treesize of output 249 [2021-12-06 22:04:45,435 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2021-12-06 22:04:45,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834400617] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:04:45,435 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:04:45,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 22] total 57 [2021-12-06 22:04:45,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145222413] [2021-12-06 22:04:45,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:04:45,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2021-12-06 22:04:45,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:04:45,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-12-06 22:04:45,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2009, Unknown=10, NotChecked=990, Total=3192 [2021-12-06 22:04:45,437 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 57 states, 57 states have (on average 2.175438596491228) internal successors, (124), 57 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:05:12,816 WARN L227 SmtUtils]: Spent 27.02s on a formula simplification. DAG size of input: 62 DAG size of output: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 22:05:20,828 WARN L227 SmtUtils]: Spent 7.93s on a formula simplification. DAG size of input: 36 DAG size of output: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 22:05:48,271 WARN L227 SmtUtils]: Spent 27.34s on a formula simplification. DAG size of input: 50 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 22:05:48,711 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 4))) (and (not (= 0 .cse0)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| 0)) (= (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_~head#1.base|) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1767 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1767) 4) 0)))) (= (select .cse1 8) 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-06 22:05:49,094 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 4))) (and (not (= 0 .cse0)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| 0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_26| Int) (v_ArrVal_1767 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_26|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_26| v_ArrVal_1767) 4) 0)))) (= (select .cse1 8) 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-06 22:05:49,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:05:49,393 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2021-12-06 22:05:49,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 22:05:49,394 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.175438596491228) internal successors, (124), 57 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-12-06 22:05:49,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:05:49,394 INFO L225 Difference]: With dead ends: 63 [2021-12-06 22:05:49,394 INFO L226 Difference]: Without dead ends: 63 [2021-12-06 22:05:49,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 64.8s TimeCoverageRelationStatistics Valid=410, Invalid=3532, Unknown=12, NotChecked=1596, Total=5550 [2021-12-06 22:05:49,397 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 178 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 584 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 22:05:49,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 481 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 755 Invalid, 0 Unknown, 584 Unchecked, 0.3s Time] [2021-12-06 22:05:49,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-06 22:05:49,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2021-12-06 22:05:49,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 59 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:05:49,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2021-12-06 22:05:49,399 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 46 [2021-12-06 22:05:49,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:05:49,400 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2021-12-06 22:05:49,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.175438596491228) internal successors, (124), 57 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:05:49,400 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2021-12-06 22:05:49,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-06 22:05:49,400 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:05:49,401 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-06 22:05:49,420 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-06 22:05:49,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-06 22:05:49,602 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:05:49,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:05:49,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1223965472, now seen corresponding path program 1 times [2021-12-06 22:05:49,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:05:49,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766489686] [2021-12-06 22:05:49,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:05:49,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:05:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:05:49,913 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 22:05:49,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:05:49,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766489686] [2021-12-06 22:05:49,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766489686] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:05:49,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780541441] [2021-12-06 22:05:49,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:05:49,914 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:05:49,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:05:49,914 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:05:49,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-06 22:05:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:05:50,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-06 22:05:50,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:05:50,018 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 22:05:50,054 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 22:05:50,055 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 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 22:05:50,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 22:05:50,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:05:50,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 22:05:50,169 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:05:50,169 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 43 treesize of output 42 [2021-12-06 22:05:50,427 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 22:05:50,428 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 37 treesize of output 36 [2021-12-06 22:05:50,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:05:50,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:05:50,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2021-12-06 22:05:50,594 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:05:50,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2021-12-06 22:05:50,688 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 22:05:50,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:05:51,332 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1894 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_1894) 4) 1) |c_#StackHeapBarrier|))) is different from false [2021-12-06 22:05:51,351 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1894 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_1894) 4) 1) |c_#StackHeapBarrier|))) is different from false [2021-12-06 22:05:51,364 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1894 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_1894) 4) 1) |c_#StackHeapBarrier|))) is different from false [2021-12-06 22:05:51,372 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1894 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1893) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_1894) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|))) is different from false [2021-12-06 22:05:51,388 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1894 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (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| 4)) v_ArrVal_1893) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_1894) 4) 1) |c_#StackHeapBarrier|))) is different from false [2021-12-06 22:05:51,396 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1894 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1893) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_1894) 4) 1) |c_#StackHeapBarrier|))) is different from false [2021-12-06 22:05:51,405 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1894 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1893) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_1894) 4) 1) |c_#StackHeapBarrier|))) is different from false [2021-12-06 22:05:51,420 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1894 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1893) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_1894) 4) 1) |c_#StackHeapBarrier|))) is different from false [2021-12-06 22:05:51,431 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1894 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (<= (+ (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1892))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1893)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_1894) 4) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|))) is different from false [2021-12-06 22:05:51,449 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1894 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1892))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1893)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_1894) 4) 1) |c_#StackHeapBarrier|))) is different from false [2021-12-06 22:05:51,454 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:05:51,458 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:05:51,458 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 2 case distinctions, treesize of input 57 treesize of output 48 [2021-12-06 22:05:51,460 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 312 treesize of output 292 [2021-12-06 22:05:51,465 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 324 treesize of output 316 [2021-12-06 22:05:51,474 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:05:51,474 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 340 treesize of output 322 [2021-12-06 22:05:51,479 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:05:51,487 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:05:51,488 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 352 treesize of output 336 [2021-12-06 22:05:52,025 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2021-12-06 22:05:52,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780541441] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:05:52,026 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:05:52,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 54 [2021-12-06 22:05:52,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343092207] [2021-12-06 22:05:52,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:05:52,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-12-06 22:05:52,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:05:52,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-12-06 22:05:52,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1820, Unknown=10, NotChecked=950, Total=2970 [2021-12-06 22:05:52,028 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 55 states, 54 states have (on average 2.2962962962962963) internal successors, (124), 55 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:06:04,657 WARN L227 SmtUtils]: Spent 11.51s on a formula simplification. DAG size of input: 53 DAG size of output: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 22:06:05,112 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (forall ((v_ArrVal_1894 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_1894) 4) 1) |c_#StackHeapBarrier|))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| 0)) (= (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_~head#1.base|) (= (select .cse1 8) 0) (<= (+ 1 .cse0) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-06 22:06:05,514 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse1 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (forall ((v_ArrVal_1894 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_29| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_29|) (<= (+ (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_29| v_ArrVal_1894) 4) 1) |c_#StackHeapBarrier|))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| 0)) (= (select .cse1 8) 0) (<= (+ 1 .cse0) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-06 22:06:05,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:06:05,888 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2021-12-06 22:06:05,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-06 22:06:05,888 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.2962962962962963) internal successors, (124), 55 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-12-06 22:06:05,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:06:05,889 INFO L225 Difference]: With dead ends: 61 [2021-12-06 22:06:05,889 INFO L226 Difference]: Without dead ends: 61 [2021-12-06 22:06:05,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 913 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=425, Invalid=3271, Unknown=12, NotChecked=1548, Total=5256 [2021-12-06 22:06:05,891 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 181 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 535 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 22:06:05,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 376 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 649 Invalid, 0 Unknown, 535 Unchecked, 0.3s Time] [2021-12-06 22:06:05,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-12-06 22:06:05,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-12-06 22:06:05,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 60 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:06:05,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2021-12-06 22:06:05,892 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 48 [2021-12-06 22:06:05,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:06:05,892 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2021-12-06 22:06:05,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.2962962962962963) internal successors, (124), 55 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:06:05,893 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2021-12-06 22:06:05,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-06 22:06:05,893 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:06:05,893 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-12-06 22:06:05,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-06 22:06:06,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-06 22:06:06,095 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-06 22:06:06,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:06:06,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1116795216, now seen corresponding path program 2 times [2021-12-06 22:06:06,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:06:06,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824852076] [2021-12-06 22:06:06,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:06:06,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:06:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:06:06,649 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:06:06,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:06:06,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824852076] [2021-12-06 22:06:06,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824852076] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:06:06,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034287257] [2021-12-06 22:06:06,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 22:06:06,649 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:06:06,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:06:06,650 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:06:06,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad0b4402-44f9-498f-ac46-f48541d4ba42/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-06 22:06:06,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 22:06:06,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 22:06:06,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 110 conjunts are in the unsatisfiable core [2021-12-06 22:06:06,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:06:06,759 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 22:06:06,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 22:06:06,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 22:06:06,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:06:06,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 22:06:06,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:06:06,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 22:06:06,808 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 22:06:06,808 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 22:06:06,829 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 22:06:06,832 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 22:06:06,846 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 22:06:06,853 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 22:06:06,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:06:06,897 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-06 22:06:06,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:06:06,901 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-06 22:06:06,951 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-06 22:06:06,951 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 69 treesize of output 50 [2021-12-06 22:06:06,954 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2021-12-06 22:06:07,273 INFO L354 Elim1Store]: treesize reduction 84, result has 37.3 percent of original size [2021-12-06 22:06:07,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 88 [2021-12-06 22:06:07,314 INFO L354 Elim1Store]: treesize reduction 54, result has 51.8 percent of original size [2021-12-06 22:06:07,314 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 74 [2021-12-06 22:06:08,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:06:08,062 INFO L354 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2021-12-06 22:06:08,062 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 109 [2021-12-06 22:06:08,066 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 101 treesize of output 93 [2021-12-06 22:06:08,072 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:06:08,072 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 86 treesize of output 85 [2021-12-06 22:06:09,531 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-12-06 22:06:09,531 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 57 treesize of output 38 [2021-12-06 22:06:09,535 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:06:09,535 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 17 treesize of output 17 [2021-12-06 22:06:09,563 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:06:09,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:06:10,736 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int)) (or (and (forall ((v_ArrVal_2041 Int) (v_ArrVal_2043 Int) (v_ArrVal_2042 Int) (v_ArrVal_2044 (Array Int Int))) (= (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2042)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2044) (select (store (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2041)) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2043) 4))) 4) 0)) (forall ((v_ArrVal_2041 Int) (v_ArrVal_2043 Int)) (= (select (let ((.cse1 (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2041))))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2043))) (select (store .cse1 |c_ULTIMATE.start_main_~s~0#1.base| .cse2) (select .cse2 4)))) 4) 0))) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|))) is different from false [2021-12-06 22:06:10,822 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int)) (or (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|) (and (forall ((v_ArrVal_2041 Int) (v_ArrVal_2043 Int)) (= (select (let ((.cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2041))))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2043))) (select (store .cse0 |c_ULTIMATE.start_dll_create_#res#1.base| .cse1) (select .cse1 4)))) 4) 0)) (forall ((v_ArrVal_2041 Int) (v_ArrVal_2043 Int) (v_ArrVal_2042 Int) (v_ArrVal_2044 (Array Int Int))) (= (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2042)) |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_2044) (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2041)) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2043) 4))) 4) 0))) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|))) is different from false [2021-12-06 22:06:10,903 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int)) (or (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|) (and (forall ((v_ArrVal_2041 Int) (v_ArrVal_2043 Int) (v_ArrVal_2042 Int) (v_ArrVal_2044 (Array Int Int))) (= (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2042)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2044) (select (store (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2041)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2043) 4))) 4) 0)) (forall ((v_ArrVal_2041 Int) (v_ArrVal_2043 Int)) (= (select (let ((.cse1 (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2041))))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2043))) (select (store .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse2) (select .cse2 4)))) 4) 0))) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|))) is different from false [2021-12-06 22:06:11,071 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int)) (or (and (forall ((v_ArrVal_2041 Int) (v_ArrVal_2043 Int)) (= (select (let ((.cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2041))))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2043))) (select (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 4)))) 4) 0)) (forall ((v_ArrVal_2041 Int) (v_ArrVal_2043 Int) (v_ArrVal_2042 Int) (v_ArrVal_2044 (Array Int Int))) (= (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2042)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2044) (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2041)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2043) 4))) 4) 0))) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|))) is different from false [2021-12-06 22:06:13,286 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (v_ArrVal_2037 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int)) (or (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) v_ArrVal_2037)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|) (and (forall ((v_ArrVal_2041 Int) (v_ArrVal_2043 Int) (v_ArrVal_2038 Int)) (= (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) v_ArrVal_2038)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2041)))))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2043))) (select (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 4)))) 4) 0)) (forall ((v_ArrVal_2041 Int) (v_ArrVal_2043 Int) (v_ArrVal_2042 Int) (v_ArrVal_2038 Int) (v_ArrVal_2044 (Array Int Int))) (= (select (let ((.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_2038)))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (select (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_2037)))) (store .cse4 .cse5 (store (select .cse4 .cse5) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2042))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2044) (select (store (select (store .cse7 .cse5 (store (select .cse7 .cse5) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2041)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2043) 4))))) 4) 0))))) is different from false [2021-12-06 22:06:13,853 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2031 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (v_ArrVal_2037 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int)) (or (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_2031)))) (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) v_ArrVal_2037))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|) (and (forall ((v_ArrVal_2041 Int) (v_ArrVal_2032 Int) (v_ArrVal_2043 Int) (v_ArrVal_2038 Int)) (= (select (let ((.cse1 (let ((.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_2032)))) (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) v_ArrVal_2038))))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2041)))))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2043))) (select (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) (select .cse2 4)))) 4) 0)) (forall ((v_ArrVal_2041 Int) (v_ArrVal_2032 Int) (v_ArrVal_2043 Int) (v_ArrVal_2042 Int) (v_ArrVal_2038 Int) (v_ArrVal_2044 (Array Int Int))) (= (select (let ((.cse9 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse10 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10 v_ArrVal_2032)))) (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9 v_ArrVal_2038))))) (let ((.cse7 (select (select .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (select (store (let ((.cse6 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10 v_ArrVal_2031)))) (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9 v_ArrVal_2037))))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2042))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2044) (select (store (select (store .cse11 .cse7 (store (select .cse11 .cse7) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2041)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2043) 4))))) 4) 0))))) is different from false [2021-12-06 22:06:15,109 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2031 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (v_ArrVal_2037 Int) (v_ArrVal_2029 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_ArrVal_2029) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) v_ArrVal_2029) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_2031)))) (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) v_ArrVal_2037))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|) (and (forall ((v_ArrVal_2041 Int) (v_ArrVal_2032 Int) (v_ArrVal_2043 Int) (v_ArrVal_2038 Int)) (= (select (let ((.cse1 (let ((.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_2032)))) (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) v_ArrVal_2038))))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2041)))))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2043))) (select (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) (select .cse2 4)))) 4) 0)) (forall ((v_ArrVal_2041 Int) (v_ArrVal_2032 Int) (v_ArrVal_2043 Int) (v_ArrVal_2042 Int) (v_ArrVal_2038 Int) (v_ArrVal_2044 (Array Int Int))) (= (select (let ((.cse9 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse10 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse11 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse11 v_ArrVal_2032)))) (store .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9 v_ArrVal_2038))))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (select (store (let ((.cse6 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10 v_ArrVal_2029) .cse11 v_ArrVal_2031)))) (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9 v_ArrVal_2037))))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2042))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2044) (select (store (select (store .cse12 .cse7 (store (select .cse12 .cse7) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2041)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2043) 4))))) 4) 0))))) is different from false [2021-12-06 22:06:15,235 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-12-06 22:06:15,235 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 884 treesize of output 840 [2021-12-06 22:06:15,339 INFO L354 Elim1Store]: treesize reduction 50, result has 39.8 percent of original size [2021-12-06 22:06:15,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 840 treesize of output 512 [2021-12-06 22:06:15,378 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 8 treesize of output 4 [2021-12-06 22:06:15,426 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 8 treesize of output 4 [2021-12-06 22:06:15,699 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 8 treesize of output 4 [2021-12-06 22:06:15,756 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 8 treesize of output 4 [2021-12-06 22:06:16,153 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 8 treesize of output 4 [2021-12-06 22:06:16,155 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 8 treesize of output 4 [2021-12-06 22:06:16,328 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (v_arrayElimArr_15 (Array Int Int)) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2037 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int)) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (or (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select v_arrayElimArr_14 .cse0))) (< (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_13))) (store .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) v_ArrVal_2037))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_13 .cse0)) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|) (and (forall ((v_ArrVal_2041 Int) (v_ArrVal_2043 Int) (v_ArrVal_2038 Int)) (= (select (let ((.cse2 (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_15))) (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) v_ArrVal_2038))))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (store .cse4 .cse5 (store (select .cse4 .cse5) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2041)))))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2043))) (select (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) (select .cse3 4)))) 4) 0)) (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_ArrVal_2042 Int) (v_prenex_24 Int) (v_ArrVal_2044 (Array Int Int))) (= (select (let ((.cse10 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_14))) (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse10 v_prenex_27))))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (select (store (let ((.cse7 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_13))) (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse10 v_ArrVal_2037))))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2042))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2044) (select (store (select (store .cse11 .cse8 (store (select .cse11 .cse8) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_prenex_24)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_prenex_26) 4))))) 4) 0))) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select v_arrayElimArr_15 .cse0)))))) is different from false [2021-12-06 22:06:16,362 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 8 treesize of output 4 [2021-12-06 22:06:16,409 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 8 treesize of output 4 [2021-12-06 22:06:16,808 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 8 treesize of output 4 [2021-12-06 22:06:16,810 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 8 treesize of output 4 [2021-12-06 22:06:17,004 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 22:06:17,043 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 22:06:17,444 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 22:06:17,751 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 22:06:17,783 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (v_arrayElimArr_15 (Array Int Int)) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_42| Int) (v_ArrVal_2037 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int)) (or (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select v_arrayElimArr_14 4))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_13 4)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select v_arrayElimArr_15 4))) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42|) 0)) (and (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_ArrVal_2042 Int) (v_prenex_24 Int) (v_ArrVal_2044 (Array Int Int))) (= (select (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42| v_arrayElimArr_14))) (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 v_prenex_27))))) (let ((.cse1 (select (select .cse4 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42|) 4))) (select (store (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42| v_arrayElimArr_13))) (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 v_ArrVal_2037))))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2042))) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42| v_ArrVal_2044) (select (store (select (store .cse4 .cse1 (store (select .cse4 .cse1) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_prenex_24)) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_prenex_26) 4))))) 4) 0)) (forall ((v_ArrVal_2041 Int) (v_ArrVal_2043 Int) (v_ArrVal_2038 Int)) (= (select (let ((.cse6 (let ((.cse8 (let ((.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42| v_arrayElimArr_15))) (store .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) v_ArrVal_2038))))) (let ((.cse9 (select (select .cse8 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42|) 4))) (store .cse8 .cse9 (store (select .cse8 .cse9) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2041)))))) (let ((.cse7 (store (select .cse6 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2043))) (select (store .cse6 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42| .cse7) (select .cse7 4)))) 4) 0))) (< (select (select (let ((.cse11 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42| v_arrayElimArr_13))) (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) v_ArrVal_2037))) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|))) is different from false [2021-12-06 22:06:17,811 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 8 treesize of output 6 [2021-12-06 22:06:18,222 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 8 treesize of output 6 [2021-12-06 22:06:18,328 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 8 treesize of output 6 [2021-12-06 22:06:18,376 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 251 treesize of output 211 [2021-12-06 22:06:18,460 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 8 treesize of output 6 [2021-12-06 22:06:18,629 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 251 treesize of output 211 [2021-12-06 22:06:18,838 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (v_arrayElimArr_15 (Array Int Int)) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_42| Int) (v_ArrVal_2037 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int)) (let ((.cse0 (select v_arrayElimArr_15 4))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= (select v_arrayElimArr_14 4) .cse0)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 4)) (and (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_ArrVal_2042 Int) (v_prenex_24 Int) (v_ArrVal_2044 (Array Int Int))) (= (select (let ((.cse4 (select v_arrayElimArr_15 4)) (.cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42| v_arrayElimArr_14))) (store .cse7 .cse4 (store (select .cse7 .cse4) .cse5 v_prenex_27))))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42|) 4))) (select (store (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42| v_arrayElimArr_13))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_2037))))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2042))) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42| v_ArrVal_2044) (select (store (select (store .cse6 .cse2 (store (select .cse6 .cse2) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_prenex_24)) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_prenex_26) 4))))) 4) 0)) (forall ((v_ArrVal_2041 Int) (v_ArrVal_2043 Int) (v_ArrVal_2038 Int)) (= (select (let ((.cse8 (let ((.cse10 (let ((.cse12 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42| v_arrayElimArr_15)) (.cse13 (select v_arrayElimArr_15 4))) (store .cse12 .cse13 (store (select .cse12 .cse13) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_2038))))) (let ((.cse11 (select (select .cse10 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42|) 4))) (store .cse10 .cse11 (store (select .cse10 .cse11) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2041)))))) (let ((.cse9 (store (select .cse8 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2043))) (select (store .cse8 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42| .cse9) (select .cse9 4)))) 4) 0))) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|) (< (select (select (let ((.cse14 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42| v_arrayElimArr_13))) (store .cse14 .cse0 (store (select .cse14 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_2037))) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42|) 0))))) is different from false [2021-12-06 22:06:18,862 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 8 treesize of output 6 [2021-12-06 22:06:19,285 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 8 treesize of output 6 [2021-12-06 22:06:19,391 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 8 treesize of output 6 [2021-12-06 22:06:19,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 251 treesize of output 211 [2021-12-06 22:06:19,526 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 8 treesize of output 6 [2021-12-06 22:06:19,705 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 251 treesize of output 211 [2021-12-06 22:06:19,980 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 8 treesize of output 6 [2021-12-06 22:06:20,536 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 8 treesize of output 6 [2021-12-06 22:06:20,578 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 431 treesize of output 391 [2021-12-06 22:06:20,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-06 22:06:20,841 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 8 treesize of output 6 [2021-12-06 22:06:21,393 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 8 treesize of output 6 [2021-12-06 22:06:21,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 431 treesize of output 391 [2021-12-06 22:06:21,530 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 8 treesize of output 6 [2021-12-06 22:06:21,641 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 8 treesize of output 6 [2021-12-06 22:06:21,873 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 431 treesize of output 391 [2021-12-06 22:06:22,164 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_32| Int) (v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_2022 Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_42| Int) (v_ArrVal_2037 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_33| Int)) (let ((.cse0 (select v_arrayElimArr_15 4))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= (select v_arrayElimArr_14 4) .cse0)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_13 4)) (< 0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_32|) (and (forall ((v_ArrVal_2041 Int) (v_ArrVal_2043 Int) (v_ArrVal_2024 Int) (v_ArrVal_2038 Int)) (= (select (let ((.cse1 (let ((.cse3 (let ((.cse7 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7 v_ArrVal_2024)) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42| v_arrayElimArr_15)) (.cse6 (select v_arrayElimArr_15 4))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_ArrVal_2038)))))) (let ((.cse4 (select (select .cse3 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42|) 4))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2041)))))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_ArrVal_2043))) (select (store .cse1 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42| .cse2) (select .cse2 4)))) 4) 0)) (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_ArrVal_2042 Int) (v_ArrVal_2024 Int) (v_prenex_24 Int) (v_ArrVal_2044 (Array Int Int))) (= (select (let ((.cse11 (select v_arrayElimArr_15 4)) (.cse12 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse13 (let ((.cse14 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse12 v_ArrVal_2024)) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42| v_arrayElimArr_14))) (store .cse14 .cse11 (store (select .cse14 .cse11) .cse12 v_prenex_27))))) (let ((.cse9 (select (select .cse13 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42|) 4))) (select (store (let ((.cse8 (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse12 v_ArrVal_2022)) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42| v_arrayElimArr_13))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_ArrVal_2037))))) (store .cse8 .cse9 (store (select .cse8 .cse9) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_ArrVal_2042))) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42| v_ArrVal_2044) (select (store (select (store .cse13 .cse9 (store (select .cse13 .cse9) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33| v_prenex_24)) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_32| v_prenex_26) 4))))) 4) 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42|) 0)) (< (select (select (let ((.cse16 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse15 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse16 v_ArrVal_2022)) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42| v_arrayElimArr_13))) (store .cse15 .cse0 (store (select .cse15 .cse0) .cse16 v_ArrVal_2037)))) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_42|) 4) |v_ULTIMATE.start_dll_update_at_~head#1.offset_33|)))) is different from false [2021-12-06 22:06:22,196 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:06:22,211 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:06:22,211 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 2 case distinctions, treesize of input 1178 treesize of output 1108 [2021-12-06 22:06:22,217 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:06:22,255 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:06:22,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 1108 treesize of output 608 [2021-12-06 22:06:22,414 INFO L354 Elim1Store]: treesize reduction 113, result has 60.1 percent of original size [2021-12-06 22:06:22,416 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 1191381 treesize of output 1142910 [2021-12-06 22:06:22,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 22:06:23,128 INFO L354 Elim1Store]: treesize reduction 10, result has 76.7 percent of original size [2021-12-06 22:06:23,130 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 5 case distinctions, treesize of input 22160962 treesize of output 20153427 [2021-12-06 22:07:06,087 WARN L227 SmtUtils]: Spent 42.95s on a formula simplification that was a NOOP. DAG size: 1986 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-06 22:07:06,880 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 22:07:06,921 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 31727752 treesize of output 29670614