./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-optional-1.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_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/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_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-optional-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/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_b8d0174e-0c4d-471e-8a1f-024f3555d04d/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 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 17:39:38,379 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 17:39:38,380 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 17:39:38,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 17:39:38,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 17:39:38,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 17:39:38,412 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 17:39:38,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 17:39:38,416 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 17:39:38,417 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 17:39:38,418 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 17:39:38,419 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 17:39:38,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 17:39:38,420 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 17:39:38,422 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 17:39:38,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 17:39:38,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 17:39:38,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 17:39:38,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 17:39:38,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 17:39:38,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 17:39:38,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 17:39:38,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 17:39:38,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 17:39:38,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 17:39:38,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 17:39:38,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 17:39:38,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 17:39:38,442 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 17:39:38,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 17:39:38,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 17:39:38,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 17:39:38,445 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 17:39:38,446 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 17:39:38,447 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 17:39:38,447 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 17:39:38,448 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 17:39:38,448 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 17:39:38,448 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 17:39:38,449 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 17:39:38,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 17:39:38,450 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-06 17:39:38,473 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 17:39:38,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 17:39:38,474 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 17:39:38,474 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 17:39:38,475 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 17:39:38,475 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 17:39:38,476 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 17:39:38,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 17:39:38,476 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 17:39:38,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 17:39:38,476 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 17:39:38,477 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-06 17:39:38,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 17:39:38,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 17:39:38,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 17:39:38,477 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-06 17:39:38,477 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-06 17:39:38,478 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-06 17:39:38,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 17:39:38,478 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-06 17:39:38,478 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 17:39:38,478 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 17:39:38,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 17:39:38,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 17:39:38,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 17:39:38,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:39:38,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 17:39:38,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 17:39:38,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 17:39:38,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 17:39:38,480 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 17:39:38,480 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_b8d0174e-0c4d-471e-8a1f-024f3555d04d/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_b8d0174e-0c4d-471e-8a1f-024f3555d04d/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 -> 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 [2021-12-06 17:39:38,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 17:39:38,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 17:39:38,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 17:39:38,682 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 17:39:38,683 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 17:39:38,684 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/forester-heap/sll-optional-1.i [2021-12-06 17:39:38,724 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/data/211993c1a/d01c021556ba48dca2f15c662eb5fdaf/FLAG270e00448 [2021-12-06 17:39:39,143 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 17:39:39,143 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/sv-benchmarks/c/forester-heap/sll-optional-1.i [2021-12-06 17:39:39,152 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/data/211993c1a/d01c021556ba48dca2f15c662eb5fdaf/FLAG270e00448 [2021-12-06 17:39:39,161 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/data/211993c1a/d01c021556ba48dca2f15c662eb5fdaf [2021-12-06 17:39:39,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 17:39:39,163 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 17:39:39,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 17:39:39,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 17:39:39,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 17:39:39,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:39:39" (1/1) ... [2021-12-06 17:39:39,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7904c0c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:39, skipping insertion in model container [2021-12-06 17:39:39,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:39:39" (1/1) ... [2021-12-06 17:39:39,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 17:39:39,209 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 17:39:39,409 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_b8d0174e-0c4d-471e-8a1f-024f3555d04d/sv-benchmarks/c/forester-heap/sll-optional-1.i[22688,22701] [2021-12-06 17:39:39,414 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:39:39,420 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 17:39:39,448 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_b8d0174e-0c4d-471e-8a1f-024f3555d04d/sv-benchmarks/c/forester-heap/sll-optional-1.i[22688,22701] [2021-12-06 17:39:39,450 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:39:39,472 INFO L208 MainTranslator]: Completed translation [2021-12-06 17:39:39,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:39 WrapperNode [2021-12-06 17:39:39,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 17:39:39,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 17:39:39,474 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 17:39:39,474 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 17:39:39,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:39" (1/1) ... [2021-12-06 17:39:39,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:39" (1/1) ... [2021-12-06 17:39:39,508 INFO L137 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 136 [2021-12-06 17:39:39,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 17:39:39,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 17:39:39,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 17:39:39,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 17:39:39,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:39" (1/1) ... [2021-12-06 17:39:39,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:39" (1/1) ... [2021-12-06 17:39:39,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:39" (1/1) ... [2021-12-06 17:39:39,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:39" (1/1) ... [2021-12-06 17:39:39,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:39" (1/1) ... [2021-12-06 17:39:39,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:39" (1/1) ... [2021-12-06 17:39:39,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:39" (1/1) ... [2021-12-06 17:39:39,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 17:39:39,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 17:39:39,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 17:39:39,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 17:39:39,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:39" (1/1) ... [2021-12-06 17:39:39,541 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:39:39,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:39:39,563 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 17:39:39,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 17:39:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-06 17:39:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 17:39:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 17:39:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 17:39:39,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-06 17:39:39,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-06 17:39:39,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 17:39:39,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 17:39:39,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 17:39:39,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 17:39:39,682 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 17:39:39,684 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 17:39:39,998 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 17:39:40,005 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 17:39:40,005 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-06 17:39:40,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:39:40 BoogieIcfgContainer [2021-12-06 17:39:40,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 17:39:40,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 17:39:40,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 17:39:40,011 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 17:39:40,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:39:39" (1/3) ... [2021-12-06 17:39:40,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60cec94b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:39:40, skipping insertion in model container [2021-12-06 17:39:40,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:39:39" (2/3) ... [2021-12-06 17:39:40,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60cec94b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:39:40, skipping insertion in model container [2021-12-06 17:39:40,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:39:40" (3/3) ... [2021-12-06 17:39:40,014 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-optional-1.i [2021-12-06 17:39:40,019 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 17:39:40,019 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2021-12-06 17:39:40,054 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 17:39:40,059 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 17:39:40,059 INFO L340 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2021-12-06 17:39:40,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 76 states have (on average 2.0921052631578947) internal successors, (159), 142 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:40,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-06 17:39:40,076 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:40,077 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-06 17:39:40,077 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:40,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:40,081 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-06 17:39:40,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:40,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088586704] [2021-12-06 17:39:40,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:40,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:40,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:40,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088586704] [2021-12-06 17:39:40,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088586704] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:40,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:40,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 17:39:40,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698500747] [2021-12-06 17:39:40,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:40,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:39:40,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:40,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:39:40,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:39:40,232 INFO L87 Difference]: Start difference. First operand has 143 states, 76 states have (on average 2.0921052631578947) internal successors, (159), 142 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:40,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:40,352 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2021-12-06 17:39:40,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:39:40,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-06 17:39:40,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:40,365 INFO L225 Difference]: With dead ends: 145 [2021-12-06 17:39:40,365 INFO L226 Difference]: Without dead ends: 141 [2021-12-06 17:39:40,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:39:40,371 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 128 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:40,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 84 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:39:40,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-06 17:39:40,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2021-12-06 17:39:40,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 78 states have (on average 1.8846153846153846) internal successors, (147), 134 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:40,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2021-12-06 17:39:40,409 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 3 [2021-12-06 17:39:40,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:40,409 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2021-12-06 17:39:40,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:40,409 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2021-12-06 17:39:40,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-06 17:39:40,409 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:40,410 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-06 17:39:40,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 17:39:40,410 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:40,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:40,411 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-06 17:39:40,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:40,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353408389] [2021-12-06 17:39:40,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:40,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:40,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:40,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:40,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353408389] [2021-12-06 17:39:40,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353408389] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:40,456 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:40,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 17:39:40,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784400630] [2021-12-06 17:39:40,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:40,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:39:40,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:40,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:39:40,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:39:40,459 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:40,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:40,539 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2021-12-06 17:39:40,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:39:40,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-06 17:39:40,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:40,541 INFO L225 Difference]: With dead ends: 131 [2021-12-06 17:39:40,541 INFO L226 Difference]: Without dead ends: 131 [2021-12-06 17:39:40,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:39:40,543 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 105 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:40,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 97 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:39:40,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-12-06 17:39:40,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2021-12-06 17:39:40,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 78 states have (on average 1.7820512820512822) internal successors, (139), 126 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:40,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2021-12-06 17:39:40,554 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 3 [2021-12-06 17:39:40,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:40,555 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2021-12-06 17:39:40,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:40,555 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2021-12-06 17:39:40,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-06 17:39:40,556 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:40,556 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:40,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 17:39:40,556 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:40,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:40,557 INFO L85 PathProgramCache]: Analyzing trace with hash 171916845, now seen corresponding path program 1 times [2021-12-06 17:39:40,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:40,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620922316] [2021-12-06 17:39:40,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:40,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:40,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:40,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:40,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620922316] [2021-12-06 17:39:40,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620922316] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:40,633 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:40,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:39:40,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634283359] [2021-12-06 17:39:40,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:40,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:39:40,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:40,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:39:40,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:39:40,635 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:40,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:40,772 INFO L93 Difference]: Finished difference Result 171 states and 188 transitions. [2021-12-06 17:39:40,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:39:40,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-06 17:39:40,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:40,774 INFO L225 Difference]: With dead ends: 171 [2021-12-06 17:39:40,774 INFO L226 Difference]: Without dead ends: 171 [2021-12-06 17:39:40,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:39:40,776 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 51 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:40,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 313 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:39:40,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-12-06 17:39:40,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 126. [2021-12-06 17:39:40,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 78 states have (on average 1.7692307692307692) internal successors, (138), 125 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:40,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2021-12-06 17:39:40,786 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 11 [2021-12-06 17:39:40,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:40,787 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2021-12-06 17:39:40,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:40,787 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2021-12-06 17:39:40,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-06 17:39:40,788 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:40,788 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:40,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 17:39:40,788 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:40,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:40,789 INFO L85 PathProgramCache]: Analyzing trace with hash 171916846, now seen corresponding path program 1 times [2021-12-06 17:39:40,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:40,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633266886] [2021-12-06 17:39:40,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:40,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:40,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:40,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633266886] [2021-12-06 17:39:40,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633266886] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:40,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:40,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:39:40,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942054271] [2021-12-06 17:39:40,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:40,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:39:40,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:40,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:39:40,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:39:40,860 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:40,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:40,969 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2021-12-06 17:39:40,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:39:40,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-06 17:39:40,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:40,971 INFO L225 Difference]: With dead ends: 125 [2021-12-06 17:39:40,971 INFO L226 Difference]: Without dead ends: 125 [2021-12-06 17:39:40,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:39:40,973 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 2 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:40,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 349 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:39:40,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-06 17:39:40,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-06 17:39:40,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 78 states have (on average 1.7564102564102564) internal successors, (137), 124 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:40,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2021-12-06 17:39:40,982 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 11 [2021-12-06 17:39:40,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:40,982 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2021-12-06 17:39:40,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:40,982 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2021-12-06 17:39:40,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-06 17:39:40,983 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:40,983 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:40,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 17:39:40,984 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:40,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:40,984 INFO L85 PathProgramCache]: Analyzing trace with hash -468215045, now seen corresponding path program 1 times [2021-12-06 17:39:40,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:40,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043401893] [2021-12-06 17:39:40,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:40,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:41,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:41,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043401893] [2021-12-06 17:39:41,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043401893] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:41,043 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:41,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 17:39:41,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688011702] [2021-12-06 17:39:41,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:41,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 17:39:41,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:41,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 17:39:41,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 17:39:41,044 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:41,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:41,130 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2021-12-06 17:39:41,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 17:39:41,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-12-06 17:39:41,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:41,131 INFO L225 Difference]: With dead ends: 127 [2021-12-06 17:39:41,131 INFO L226 Difference]: Without dead ends: 127 [2021-12-06 17:39:41,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:39:41,132 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 171 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:41,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 73 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:39:41,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-06 17:39:41,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2021-12-06 17:39:41,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 117 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:41,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 135 transitions. [2021-12-06 17:39:41,137 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 135 transitions. Word has length 12 [2021-12-06 17:39:41,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:41,137 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 135 transitions. [2021-12-06 17:39:41,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:41,137 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 135 transitions. [2021-12-06 17:39:41,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-06 17:39:41,138 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:41,138 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:41,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 17:39:41,138 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:41,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:41,138 INFO L85 PathProgramCache]: Analyzing trace with hash -468215044, now seen corresponding path program 1 times [2021-12-06 17:39:41,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:41,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709087851] [2021-12-06 17:39:41,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:41,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:41,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:41,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709087851] [2021-12-06 17:39:41,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709087851] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:41,204 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:41,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:39:41,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514844220] [2021-12-06 17:39:41,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:41,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:39:41,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:41,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:39:41,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:39:41,205 INFO L87 Difference]: Start difference. First operand 118 states and 135 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:41,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:41,353 INFO L93 Difference]: Finished difference Result 171 states and 189 transitions. [2021-12-06 17:39:41,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 17:39:41,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-12-06 17:39:41,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:41,355 INFO L225 Difference]: With dead ends: 171 [2021-12-06 17:39:41,355 INFO L226 Difference]: Without dead ends: 171 [2021-12-06 17:39:41,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:39:41,356 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 180 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:41,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 151 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:39:41,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-12-06 17:39:41,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 146. [2021-12-06 17:39:41,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 112 states have (on average 1.5267857142857142) internal successors, (171), 145 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:41,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 171 transitions. [2021-12-06 17:39:41,364 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 171 transitions. Word has length 12 [2021-12-06 17:39:41,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:41,364 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 171 transitions. [2021-12-06 17:39:41,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:41,365 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 171 transitions. [2021-12-06 17:39:41,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-06 17:39:41,365 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:41,366 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:41,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 17:39:41,366 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:41,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:41,366 INFO L85 PathProgramCache]: Analyzing trace with hash -2003220227, now seen corresponding path program 1 times [2021-12-06 17:39:41,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:41,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484734987] [2021-12-06 17:39:41,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:41,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:41,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:41,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484734987] [2021-12-06 17:39:41,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484734987] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:41,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:41,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:39:41,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628656588] [2021-12-06 17:39:41,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:41,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:39:41,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:41,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:39:41,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:39:41,411 INFO L87 Difference]: Start difference. First operand 146 states and 171 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:41,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:41,548 INFO L93 Difference]: Finished difference Result 146 states and 171 transitions. [2021-12-06 17:39:41,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 17:39:41,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-06 17:39:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:41,550 INFO L225 Difference]: With dead ends: 146 [2021-12-06 17:39:41,550 INFO L226 Difference]: Without dead ends: 146 [2021-12-06 17:39:41,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:39:41,551 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 63 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:41,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 273 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:39:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-06 17:39:41,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2021-12-06 17:39:41,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.5178571428571428) internal successors, (170), 144 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:41,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 170 transitions. [2021-12-06 17:39:41,556 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 170 transitions. Word has length 16 [2021-12-06 17:39:41,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:41,556 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 170 transitions. [2021-12-06 17:39:41,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:41,556 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 170 transitions. [2021-12-06 17:39:41,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-06 17:39:41,557 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:41,557 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:41,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 17:39:41,557 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:41,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:41,558 INFO L85 PathProgramCache]: Analyzing trace with hash -2003220226, now seen corresponding path program 1 times [2021-12-06 17:39:41,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:41,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944923516] [2021-12-06 17:39:41,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:41,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:41,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:41,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944923516] [2021-12-06 17:39:41,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944923516] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:41,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:41,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:39:41,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402827683] [2021-12-06 17:39:41,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:41,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:39:41,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:41,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:39:41,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:39:41,614 INFO L87 Difference]: Start difference. First operand 145 states and 170 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:41,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:41,773 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2021-12-06 17:39:41,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 17:39:41,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-06 17:39:41,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:41,774 INFO L225 Difference]: With dead ends: 137 [2021-12-06 17:39:41,774 INFO L226 Difference]: Without dead ends: 137 [2021-12-06 17:39:41,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-06 17:39:41,775 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 25 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:41,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 323 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:39:41,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-12-06 17:39:41,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 130. [2021-12-06 17:39:41,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 107 states have (on average 1.439252336448598) internal successors, (154), 129 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:41,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 154 transitions. [2021-12-06 17:39:41,780 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 154 transitions. Word has length 16 [2021-12-06 17:39:41,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:41,781 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 154 transitions. [2021-12-06 17:39:41,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:41,781 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 154 transitions. [2021-12-06 17:39:41,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-06 17:39:41,782 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:41,782 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:41,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 17:39:41,782 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:41,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:41,783 INFO L85 PathProgramCache]: Analyzing trace with hash 2123452236, now seen corresponding path program 1 times [2021-12-06 17:39:41,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:41,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569016962] [2021-12-06 17:39:41,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:41,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:41,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:41,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:41,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569016962] [2021-12-06 17:39:41,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569016962] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:41,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:41,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:39:41,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485974911] [2021-12-06 17:39:41,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:41,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 17:39:41,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:41,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 17:39:41,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 17:39:41,816 INFO L87 Difference]: Start difference. First operand 130 states and 154 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:41,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:41,876 INFO L93 Difference]: Finished difference Result 154 states and 173 transitions. [2021-12-06 17:39:41,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 17:39:41,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-12-06 17:39:41,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:41,877 INFO L225 Difference]: With dead ends: 154 [2021-12-06 17:39:41,877 INFO L226 Difference]: Without dead ends: 154 [2021-12-06 17:39:41,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:39:41,878 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 153 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:41,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 154 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:39:41,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-06 17:39:41,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2021-12-06 17:39:41,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 107 states have (on average 1.4205607476635513) internal successors, (152), 129 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:41,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2021-12-06 17:39:41,881 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 17 [2021-12-06 17:39:41,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:41,881 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2021-12-06 17:39:41,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:41,881 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2021-12-06 17:39:41,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-06 17:39:41,882 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:41,882 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:41,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 17:39:41,882 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:41,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:41,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1866791259, now seen corresponding path program 1 times [2021-12-06 17:39:41,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:41,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792037119] [2021-12-06 17:39:41,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:41,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:41,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:41,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792037119] [2021-12-06 17:39:41,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792037119] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:41,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:41,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:39:41,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384830814] [2021-12-06 17:39:41,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:41,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 17:39:41,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:41,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 17:39:41,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 17:39:41,907 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:41,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:41,920 INFO L93 Difference]: Finished difference Result 156 states and 186 transitions. [2021-12-06 17:39:41,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 17:39:41,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-06 17:39:41,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:41,921 INFO L225 Difference]: With dead ends: 156 [2021-12-06 17:39:41,921 INFO L226 Difference]: Without dead ends: 156 [2021-12-06 17:39:41,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:39:41,922 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 21 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:41,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 304 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:39:41,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-06 17:39:41,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 134. [2021-12-06 17:39:41,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 111 states have (on average 1.4054054054054055) internal successors, (156), 133 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2021-12-06 17:39:41,925 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 20 [2021-12-06 17:39:41,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:41,926 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2021-12-06 17:39:41,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:41,926 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2021-12-06 17:39:41,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-06 17:39:41,926 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:41,926 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:41,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 17:39:41,927 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:41,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:41,927 INFO L85 PathProgramCache]: Analyzing trace with hash 72886850, now seen corresponding path program 1 times [2021-12-06 17:39:41,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:41,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520482763] [2021-12-06 17:39:41,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:41,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:41,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:41,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:41,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520482763] [2021-12-06 17:39:41,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520482763] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:41,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:41,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:39:41,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631934656] [2021-12-06 17:39:41,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:41,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:39:41,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:41,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:39:41,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:39:41,987 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:42,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:42,208 INFO L93 Difference]: Finished difference Result 247 states and 287 transitions. [2021-12-06 17:39:42,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:39:42,208 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-06 17:39:42,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:42,210 INFO L225 Difference]: With dead ends: 247 [2021-12-06 17:39:42,210 INFO L226 Difference]: Without dead ends: 247 [2021-12-06 17:39:42,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-12-06 17:39:42,211 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 246 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:42,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 274 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:39:42,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-12-06 17:39:42,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 148. [2021-12-06 17:39:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 125 states have (on average 1.392) internal successors, (174), 147 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 174 transitions. [2021-12-06 17:39:42,217 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 174 transitions. Word has length 22 [2021-12-06 17:39:42,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:42,217 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 174 transitions. [2021-12-06 17:39:42,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:42,218 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 174 transitions. [2021-12-06 17:39:42,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-06 17:39:42,219 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:42,219 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:42,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 17:39:42,219 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:42,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:42,220 INFO L85 PathProgramCache]: Analyzing trace with hash 72886851, now seen corresponding path program 1 times [2021-12-06 17:39:42,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:42,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633428787] [2021-12-06 17:39:42,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:42,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:42,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:42,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633428787] [2021-12-06 17:39:42,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633428787] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:42,310 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:42,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:39:42,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580476647] [2021-12-06 17:39:42,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:42,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:39:42,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:42,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:39:42,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:39:42,311 INFO L87 Difference]: Start difference. First operand 148 states and 174 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:42,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:42,546 INFO L93 Difference]: Finished difference Result 224 states and 257 transitions. [2021-12-06 17:39:42,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:39:42,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-06 17:39:42,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:42,547 INFO L225 Difference]: With dead ends: 224 [2021-12-06 17:39:42,547 INFO L226 Difference]: Without dead ends: 224 [2021-12-06 17:39:42,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2021-12-06 17:39:42,548 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 256 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:42,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 390 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:39:42,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-12-06 17:39:42,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 144. [2021-12-06 17:39:42,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 143 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 168 transitions. [2021-12-06 17:39:42,552 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 168 transitions. Word has length 22 [2021-12-06 17:39:42,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:42,552 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 168 transitions. [2021-12-06 17:39:42,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:42,552 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 168 transitions. [2021-12-06 17:39:42,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-06 17:39:42,553 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:42,553 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:42,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 17:39:42,553 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:42,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:42,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1318553294, now seen corresponding path program 1 times [2021-12-06 17:39:42,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:42,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920940003] [2021-12-06 17:39:42,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:42,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:42,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:42,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920940003] [2021-12-06 17:39:42,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920940003] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:42,572 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:42,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 17:39:42,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134626820] [2021-12-06 17:39:42,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:42,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:39:42,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:42,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:39:42,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:39:42,573 INFO L87 Difference]: Start difference. First operand 144 states and 168 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:42,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:42,578 INFO L93 Difference]: Finished difference Result 146 states and 170 transitions. [2021-12-06 17:39:42,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:39:42,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-06 17:39:42,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:42,579 INFO L225 Difference]: With dead ends: 146 [2021-12-06 17:39:42,579 INFO L226 Difference]: Without dead ends: 146 [2021-12-06 17:39:42,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:39:42,580 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:42,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:39:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-06 17:39:42,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2021-12-06 17:39:42,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 145 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:42,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2021-12-06 17:39:42,583 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 22 [2021-12-06 17:39:42,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:42,583 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2021-12-06 17:39:42,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2021-12-06 17:39:42,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-06 17:39:42,584 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:42,584 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:42,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 17:39:42,584 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:42,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:42,585 INFO L85 PathProgramCache]: Analyzing trace with hash 116002131, now seen corresponding path program 1 times [2021-12-06 17:39:42,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:42,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710521500] [2021-12-06 17:39:42,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:42,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:42,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:42,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:42,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710521500] [2021-12-06 17:39:42,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710521500] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:42,648 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:42,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:39:42,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820173392] [2021-12-06 17:39:42,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:42,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:39:42,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:42,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:39:42,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:39:42,649 INFO L87 Difference]: Start difference. First operand 146 states and 170 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:42,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:42,843 INFO L93 Difference]: Finished difference Result 219 states and 250 transitions. [2021-12-06 17:39:42,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:39:42,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-06 17:39:42,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:42,845 INFO L225 Difference]: With dead ends: 219 [2021-12-06 17:39:42,845 INFO L226 Difference]: Without dead ends: 219 [2021-12-06 17:39:42,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-12-06 17:39:42,846 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 173 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:42,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 365 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:39:42,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-12-06 17:39:42,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 152. [2021-12-06 17:39:42,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 129 states have (on average 1.372093023255814) internal successors, (177), 151 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:42,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 177 transitions. [2021-12-06 17:39:42,851 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 177 transitions. Word has length 24 [2021-12-06 17:39:42,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:42,851 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 177 transitions. [2021-12-06 17:39:42,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:42,852 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2021-12-06 17:39:42,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-06 17:39:42,852 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:42,852 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:42,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 17:39:42,853 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:42,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:42,853 INFO L85 PathProgramCache]: Analyzing trace with hash 913286409, now seen corresponding path program 1 times [2021-12-06 17:39:42,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:42,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737329822] [2021-12-06 17:39:42,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:42,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:42,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:42,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737329822] [2021-12-06 17:39:42,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737329822] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:42,895 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:42,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:39:42,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772261776] [2021-12-06 17:39:42,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:42,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:39:42,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:42,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:39:42,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:39:42,896 INFO L87 Difference]: Start difference. First operand 152 states and 177 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:42,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:42,981 INFO L93 Difference]: Finished difference Result 158 states and 184 transitions. [2021-12-06 17:39:42,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:39:42,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-06 17:39:42,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:42,982 INFO L225 Difference]: With dead ends: 158 [2021-12-06 17:39:42,982 INFO L226 Difference]: Without dead ends: 158 [2021-12-06 17:39:42,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:39:42,982 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 8 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:42,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 286 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:39:42,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-06 17:39:42,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 151. [2021-12-06 17:39:42,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 129 states have (on average 1.3643410852713178) internal successors, (176), 150 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:42,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 176 transitions. [2021-12-06 17:39:42,986 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 176 transitions. Word has length 24 [2021-12-06 17:39:42,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:42,986 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 176 transitions. [2021-12-06 17:39:42,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:42,986 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 176 transitions. [2021-12-06 17:39:42,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-06 17:39:42,986 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:42,986 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:42,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 17:39:42,987 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:42,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:42,987 INFO L85 PathProgramCache]: Analyzing trace with hash 913286410, now seen corresponding path program 1 times [2021-12-06 17:39:42,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:42,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339764253] [2021-12-06 17:39:42,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:42,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:43,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:43,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:43,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339764253] [2021-12-06 17:39:43,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339764253] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:43,030 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:43,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:39:43,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869708271] [2021-12-06 17:39:43,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:43,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:39:43,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:43,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:39:43,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:39:43,031 INFO L87 Difference]: Start difference. First operand 151 states and 176 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:43,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:43,109 INFO L93 Difference]: Finished difference Result 150 states and 175 transitions. [2021-12-06 17:39:43,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:39:43,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-06 17:39:43,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:43,110 INFO L225 Difference]: With dead ends: 150 [2021-12-06 17:39:43,110 INFO L226 Difference]: Without dead ends: 150 [2021-12-06 17:39:43,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:39:43,111 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 2 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:43,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 275 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:39:43,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-06 17:39:43,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-12-06 17:39:43,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 129 states have (on average 1.3565891472868217) internal successors, (175), 149 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:43,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 175 transitions. [2021-12-06 17:39:43,115 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 175 transitions. Word has length 24 [2021-12-06 17:39:43,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:43,115 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 175 transitions. [2021-12-06 17:39:43,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:43,115 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 175 transitions. [2021-12-06 17:39:43,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 17:39:43,116 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:43,116 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:43,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 17:39:43,116 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:43,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:43,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1848177146, now seen corresponding path program 1 times [2021-12-06 17:39:43,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:43,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100812117] [2021-12-06 17:39:43,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:43,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:43,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:43,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:43,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100812117] [2021-12-06 17:39:43,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100812117] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:43,190 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:43,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:39:43,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804913017] [2021-12-06 17:39:43,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:43,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:39:43,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:43,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:39:43,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:39:43,191 INFO L87 Difference]: Start difference. First operand 150 states and 175 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:43,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:43,443 INFO L93 Difference]: Finished difference Result 309 states and 356 transitions. [2021-12-06 17:39:43,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 17:39:43,447 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-06 17:39:43,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:43,448 INFO L225 Difference]: With dead ends: 309 [2021-12-06 17:39:43,449 INFO L226 Difference]: Without dead ends: 309 [2021-12-06 17:39:43,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2021-12-06 17:39:43,450 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 344 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:43,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [344 Valid, 449 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:39:43,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-12-06 17:39:43,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 163. [2021-12-06 17:39:43,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 142 states have (on average 1.352112676056338) internal successors, (192), 162 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 192 transitions. [2021-12-06 17:39:43,456 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 192 transitions. Word has length 26 [2021-12-06 17:39:43,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:43,456 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 192 transitions. [2021-12-06 17:39:43,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:43,456 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 192 transitions. [2021-12-06 17:39:43,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 17:39:43,457 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:43,457 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:43,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-06 17:39:43,457 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:43,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:43,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1848177147, now seen corresponding path program 1 times [2021-12-06 17:39:43,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:43,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459888966] [2021-12-06 17:39:43,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:43,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:43,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:43,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459888966] [2021-12-06 17:39:43,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459888966] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:43,539 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:43,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:39:43,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785779424] [2021-12-06 17:39:43,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:43,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:39:43,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:43,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:39:43,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:39:43,540 INFO L87 Difference]: Start difference. First operand 163 states and 192 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:43,803 INFO L93 Difference]: Finished difference Result 247 states and 281 transitions. [2021-12-06 17:39:43,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 17:39:43,803 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-06 17:39:43,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:43,804 INFO L225 Difference]: With dead ends: 247 [2021-12-06 17:39:43,804 INFO L226 Difference]: Without dead ends: 247 [2021-12-06 17:39:43,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2021-12-06 17:39:43,805 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 261 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:43,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 419 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:39:43,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-12-06 17:39:43,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 163. [2021-12-06 17:39:43,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 142 states have (on average 1.3450704225352113) internal successors, (191), 162 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 191 transitions. [2021-12-06 17:39:43,809 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 191 transitions. Word has length 26 [2021-12-06 17:39:43,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:43,809 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 191 transitions. [2021-12-06 17:39:43,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:43,809 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 191 transitions. [2021-12-06 17:39:43,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 17:39:43,809 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:43,809 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:43,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-06 17:39:43,810 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:43,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:43,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1639700775, now seen corresponding path program 1 times [2021-12-06 17:39:43,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:43,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10714542] [2021-12-06 17:39:43,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:43,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:43,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:43,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:43,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10714542] [2021-12-06 17:39:43,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10714542] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:43,829 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:43,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:39:43,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209958395] [2021-12-06 17:39:43,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:43,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 17:39:43,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:43,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 17:39:43,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 17:39:43,830 INFO L87 Difference]: Start difference. First operand 163 states and 191 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:43,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:43,841 INFO L93 Difference]: Finished difference Result 175 states and 204 transitions. [2021-12-06 17:39:43,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 17:39:43,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-06 17:39:43,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:43,842 INFO L225 Difference]: With dead ends: 175 [2021-12-06 17:39:43,842 INFO L226 Difference]: Without dead ends: 175 [2021-12-06 17:39:43,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:39:43,843 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 10 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:43,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 299 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:39:43,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-12-06 17:39:43,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 167. [2021-12-06 17:39:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 146 states have (on average 1.3287671232876712) internal successors, (194), 166 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:43,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 194 transitions. [2021-12-06 17:39:43,846 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 194 transitions. Word has length 26 [2021-12-06 17:39:43,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:43,846 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 194 transitions. [2021-12-06 17:39:43,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 194 transitions. [2021-12-06 17:39:43,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-06 17:39:43,847 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:43,847 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:43,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-06 17:39:43,847 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:43,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:43,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1067960075, now seen corresponding path program 1 times [2021-12-06 17:39:43,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:43,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426884513] [2021-12-06 17:39:43,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:43,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:43,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:43,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426884513] [2021-12-06 17:39:43,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426884513] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:43,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:43,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 17:39:43,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777391938] [2021-12-06 17:39:43,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:43,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 17:39:43,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:43,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 17:39:43,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-12-06 17:39:43,915 INFO L87 Difference]: Start difference. First operand 167 states and 194 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:44,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:44,171 INFO L93 Difference]: Finished difference Result 247 states and 277 transitions. [2021-12-06 17:39:44,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 17:39:44,171 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-06 17:39:44,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:44,172 INFO L225 Difference]: With dead ends: 247 [2021-12-06 17:39:44,172 INFO L226 Difference]: Without dead ends: 247 [2021-12-06 17:39:44,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2021-12-06 17:39:44,173 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 274 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:44,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 578 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:39:44,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-12-06 17:39:44,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 167. [2021-12-06 17:39:44,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 146 states have (on average 1.321917808219178) internal successors, (193), 166 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:44,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 193 transitions. [2021-12-06 17:39:44,176 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 193 transitions. Word has length 28 [2021-12-06 17:39:44,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:44,176 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 193 transitions. [2021-12-06 17:39:44,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 193 transitions. [2021-12-06 17:39:44,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-06 17:39:44,177 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:44,177 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:44,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-06 17:39:44,177 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:44,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:44,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1161159390, now seen corresponding path program 1 times [2021-12-06 17:39:44,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:44,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72114394] [2021-12-06 17:39:44,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:44,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:44,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:44,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:44,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72114394] [2021-12-06 17:39:44,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72114394] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:39:44,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706908196] [2021-12-06 17:39:44,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:44,223 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:39:44,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:39:44,224 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:39:44,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 17:39:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:44,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-06 17:39:44,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:39:44,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:39:44,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:39:44,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:39:44,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:39:44,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:39:44,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:39:44,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:39:44,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:39:44,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:39:44,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:39:44,545 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:39:44,545 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:39:44,550 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:39:44,552 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:39:44,552 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 15 treesize of output 10 [2021-12-06 17:39:44,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:44,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:39:44,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2021-12-06 17:39:44,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2021-12-06 17:39:44,961 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 23 treesize of output 21 [2021-12-06 17:39:44,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2021-12-06 17:39:44,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:44,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706908196] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:39:44,982 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:39:44,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2021-12-06 17:39:44,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72519275] [2021-12-06 17:39:44,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:39:44,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 17:39:44,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:44,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 17:39:44,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-06 17:39:44,984 INFO L87 Difference]: Start difference. First operand 167 states and 193 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 17:39:45,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:45,194 INFO L93 Difference]: Finished difference Result 208 states and 237 transitions. [2021-12-06 17:39:45,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 17:39:45,194 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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) Word has length 28 [2021-12-06 17:39:45,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:45,195 INFO L225 Difference]: With dead ends: 208 [2021-12-06 17:39:45,195 INFO L226 Difference]: Without dead ends: 208 [2021-12-06 17:39:45,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-06 17:39:45,196 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 429 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:45,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 364 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 232 Invalid, 0 Unknown, 42 Unchecked, 0.1s Time] [2021-12-06 17:39:45,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-12-06 17:39:45,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 180. [2021-12-06 17:39:45,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 159 states have (on average 1.3081761006289307) internal successors, (208), 179 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:45,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 208 transitions. [2021-12-06 17:39:45,199 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 208 transitions. Word has length 28 [2021-12-06 17:39:45,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:45,200 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 208 transitions. [2021-12-06 17:39:45,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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 17:39:45,200 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 208 transitions. [2021-12-06 17:39:45,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-06 17:39:45,200 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:45,200 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:45,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 17:39:45,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:39:45,401 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:45,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:45,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1511540264, now seen corresponding path program 1 times [2021-12-06 17:39:45,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:45,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740473050] [2021-12-06 17:39:45,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:45,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:45,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:45,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:45,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740473050] [2021-12-06 17:39:45,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740473050] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:45,464 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:45,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:39:45,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863943691] [2021-12-06 17:39:45,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:45,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:39:45,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:45,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:39:45,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:39:45,464 INFO L87 Difference]: Start difference. First operand 180 states and 208 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:45,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:45,657 INFO L93 Difference]: Finished difference Result 225 states and 256 transitions. [2021-12-06 17:39:45,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:39:45,658 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-06 17:39:45,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:45,659 INFO L225 Difference]: With dead ends: 225 [2021-12-06 17:39:45,659 INFO L226 Difference]: Without dead ends: 225 [2021-12-06 17:39:45,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-12-06 17:39:45,660 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 82 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:45,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 433 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:39:45,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-12-06 17:39:45,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 186. [2021-12-06 17:39:45,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 165 states have (on average 1.303030303030303) internal successors, (215), 185 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:45,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 215 transitions. [2021-12-06 17:39:45,665 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 215 transitions. Word has length 30 [2021-12-06 17:39:45,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:45,665 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 215 transitions. [2021-12-06 17:39:45,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:45,666 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 215 transitions. [2021-12-06 17:39:45,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-06 17:39:45,666 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:45,666 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:45,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-06 17:39:45,667 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:45,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:45,667 INFO L85 PathProgramCache]: Analyzing trace with hash 238082658, now seen corresponding path program 1 times [2021-12-06 17:39:45,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:45,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991537236] [2021-12-06 17:39:45,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:45,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:45,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:45,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991537236] [2021-12-06 17:39:45,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991537236] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:39:45,770 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:39:45,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-06 17:39:45,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351226505] [2021-12-06 17:39:45,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:39:45,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 17:39:45,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:45,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 17:39:45,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-06 17:39:45,771 INFO L87 Difference]: Start difference. First operand 186 states and 215 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:46,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:46,204 INFO L93 Difference]: Finished difference Result 224 states and 250 transitions. [2021-12-06 17:39:46,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-06 17:39:46,204 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-06 17:39:46,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:46,206 INFO L225 Difference]: With dead ends: 224 [2021-12-06 17:39:46,206 INFO L226 Difference]: Without dead ends: 224 [2021-12-06 17:39:46,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2021-12-06 17:39:46,207 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 187 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:46,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 672 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:39:46,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-12-06 17:39:46,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 183. [2021-12-06 17:39:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 162 states have (on average 1.2962962962962963) internal successors, (210), 182 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:46,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 210 transitions. [2021-12-06 17:39:46,212 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 210 transitions. Word has length 33 [2021-12-06 17:39:46,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:46,212 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 210 transitions. [2021-12-06 17:39:46,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:46,212 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 210 transitions. [2021-12-06 17:39:46,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-06 17:39:46,213 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:46,213 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:46,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-06 17:39:46,213 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:46,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:46,214 INFO L85 PathProgramCache]: Analyzing trace with hash 745727206, now seen corresponding path program 1 times [2021-12-06 17:39:46,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:46,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544261463] [2021-12-06 17:39:46,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:46,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:46,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:46,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544261463] [2021-12-06 17:39:46,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544261463] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:39:46,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094220651] [2021-12-06 17:39:46,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:46,414 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:39:46,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:39:46,415 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:39:46,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 17:39:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:46,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-06 17:39:46,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:39:46,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:39:46,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:39:46,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:39:46,569 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:39:46,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:39:46,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:39:46,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:39:46,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:39:46,616 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 21 treesize of output 20 [2021-12-06 17:39:46,740 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:39:46,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:39:46,747 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 17:39:46,764 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:39:46,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:39:46,838 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:39:46,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:39:46,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-06 17:39:46,856 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:39:46,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:39:46,900 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:39:46,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-06 17:39:46,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-06 17:39:47,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 17:39:47,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:39:47,032 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:39:47,032 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 27 treesize of output 11 [2021-12-06 17:39:47,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:47,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:39:47,149 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_683 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_683) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_682 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-06 17:39:47,178 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_682 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_683 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_683) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-06 17:39:47,186 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_683 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_683) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_682 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_682) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) is different from false [2021-12-06 17:39:47,200 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_682 (Array Int Int)) (v_ArrVal_677 Int)) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_677)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_683) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-06 17:39:47,401 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:39:47,405 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:39:47,405 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 51 treesize of output 57 [2021-12-06 17:39:47,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:39:47,412 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:39:47,412 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 62 [2021-12-06 17:39:47,415 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:39:47,417 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:39:47,417 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 76 treesize of output 60 [2021-12-06 17:39:47,420 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:39:47,422 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:39:47,423 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 74 treesize of output 58 [2021-12-06 17:39:47,429 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 25 treesize of output 21 [2021-12-06 17:39:47,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-12-06 17:39:47,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:47,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094220651] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:39:47,463 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:39:47,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 35 [2021-12-06 17:39:47,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436616810] [2021-12-06 17:39:47,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:39:47,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-06 17:39:47,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:47,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-06 17:39:47,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=813, Unknown=9, NotChecked=244, Total=1190 [2021-12-06 17:39:47,465 INFO L87 Difference]: Start difference. First operand 183 states and 210 transitions. Second operand has 35 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 35 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:48,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:48,644 INFO L93 Difference]: Finished difference Result 324 states and 362 transitions. [2021-12-06 17:39:48,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-06 17:39:48,645 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 35 states have internal predecessors, (92), 0 states have call successors, (0), 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 17:39:48,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:48,646 INFO L225 Difference]: With dead ends: 324 [2021-12-06 17:39:48,646 INFO L226 Difference]: Without dead ends: 324 [2021-12-06 17:39:48,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=478, Invalid=2491, Unknown=17, NotChecked=436, Total=3422 [2021-12-06 17:39:48,647 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 378 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 2245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1137 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:48,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [378 Valid, 1424 Invalid, 2245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1068 Invalid, 0 Unknown, 1137 Unchecked, 0.4s Time] [2021-12-06 17:39:48,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-12-06 17:39:48,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 204. [2021-12-06 17:39:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 183 states have (on average 1.284153005464481) internal successors, (235), 203 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:48,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 235 transitions. [2021-12-06 17:39:48,651 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 235 transitions. Word has length 34 [2021-12-06 17:39:48,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:48,652 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 235 transitions. [2021-12-06 17:39:48,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 35 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:48,652 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 235 transitions. [2021-12-06 17:39:48,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-06 17:39:48,652 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:48,652 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:48,686 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 17:39:48,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:39:48,853 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:48,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:48,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1109022446, now seen corresponding path program 1 times [2021-12-06 17:39:48,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:48,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035073769] [2021-12-06 17:39:48,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:48,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:49,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:49,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:49,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035073769] [2021-12-06 17:39:49,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035073769] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:39:49,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780769184] [2021-12-06 17:39:49,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:49,065 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:39:49,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:39:49,066 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:39:49,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 17:39:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:49,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-06 17:39:49,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:39:49,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:39:49,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:39:49,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:39:49,230 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:39:49,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:39:49,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:39:49,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:39:49,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:39:49,266 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 21 treesize of output 20 [2021-12-06 17:39:49,393 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:39:49,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:39:49,408 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:39:49,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:39:49,414 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 17:39:49,515 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:39:49,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:39:49,518 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 17:39:49,527 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:39:49,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:39:49,567 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:39:49,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-06 17:39:49,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-06 17:39:49,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 17:39:49,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:39:49,709 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:39:49,709 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 27 treesize of output 11 [2021-12-06 17:39:49,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:49,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:39:49,812 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_790 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_789 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_789) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) is different from false [2021-12-06 17:39:49,838 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_790 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_790) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_789 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_789) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) is different from false [2021-12-06 17:39:49,846 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_790 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_790) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_789 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_789) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) is different from false [2021-12-06 17:39:49,925 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_10| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_10|) 0)) (and (forall ((v_ArrVal_790 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_10| v_ArrVal_790) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_789 (Array Int Int)) (v_ArrVal_782 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_782)) |v_ULTIMATE.start_main_#t~malloc7#1.base_10| v_ArrVal_789) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:39:50,080 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:39:50,083 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:39:50,083 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 51 treesize of output 57 [2021-12-06 17:39:50,085 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:39:50,088 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:39:50,089 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 62 [2021-12-06 17:39:50,091 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:39:50,093 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:39:50,093 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 76 treesize of output 60 [2021-12-06 17:39:50,097 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:39:50,099 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:39:50,099 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 74 treesize of output 58 [2021-12-06 17:39:50,105 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 25 treesize of output 21 [2021-12-06 17:39:50,107 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 21 treesize of output 17 [2021-12-06 17:39:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-06 17:39:50,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780769184] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:39:50,132 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:39:50,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 35 [2021-12-06 17:39:50,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457350890] [2021-12-06 17:39:50,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:39:50,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-06 17:39:50,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:50,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-06 17:39:50,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=815, Unknown=8, NotChecked=244, Total=1190 [2021-12-06 17:39:50,134 INFO L87 Difference]: Start difference. First operand 204 states and 235 transitions. Second operand has 35 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 35 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:50,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:39:50,932 INFO L93 Difference]: Finished difference Result 293 states and 330 transitions. [2021-12-06 17:39:50,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-06 17:39:50,933 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 35 states have internal predecessors, (92), 0 states have call successors, (0), 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 17:39:50,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:39:50,934 INFO L225 Difference]: With dead ends: 293 [2021-12-06 17:39:50,934 INFO L226 Difference]: Without dead ends: 293 [2021-12-06 17:39:50,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=399, Invalid=2057, Unknown=10, NotChecked=396, Total=2862 [2021-12-06 17:39:50,935 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 297 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 755 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:39:50,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 1129 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 678 Invalid, 0 Unknown, 755 Unchecked, 0.2s Time] [2021-12-06 17:39:50,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-12-06 17:39:50,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 217. [2021-12-06 17:39:50,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 196 states have (on average 1.280612244897959) internal successors, (251), 216 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 251 transitions. [2021-12-06 17:39:50,939 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 251 transitions. Word has length 34 [2021-12-06 17:39:50,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:39:50,939 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 251 transitions. [2021-12-06 17:39:50,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 35 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:39:50,939 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 251 transitions. [2021-12-06 17:39:50,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-06 17:39:50,940 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:39:50,940 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:39:50,959 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 17:39:51,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-06 17:39:51,141 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:39:51,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:39:51,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1500876314, now seen corresponding path program 1 times [2021-12-06 17:39:51,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:39:51,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465909052] [2021-12-06 17:39:51,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:51,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:39:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:51,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:51,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:39:51,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465909052] [2021-12-06 17:39:51,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465909052] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:39:51,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736778880] [2021-12-06 17:39:51,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:39:51,349 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:39:51,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:39:51,349 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:39:51,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 17:39:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:39:51,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-06 17:39:51,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:39:51,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:39:51,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:39:51,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:39:51,521 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-06 17:39:51,521 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 17:39:51,559 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-06 17:39:51,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2021-12-06 17:39:51,573 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-06 17:39:51,574 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 21 treesize of output 26 [2021-12-06 17:39:51,772 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:39:51,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2021-12-06 17:39:51,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:39:51,776 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 17:39:51,955 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:39:51,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2021-12-06 17:39:51,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:39:51,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 17:39:52,005 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:39:52,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 50 [2021-12-06 17:39:52,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-06 17:39:52,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-06 17:39:52,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-06 17:39:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:52,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:39:52,674 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (or (and (forall ((v_ArrVal_897 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_897) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-06 17:39:52,746 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (or (and (= |c_ULTIMATE.start_main_~head~0#1.base| .cse0) (forall ((v_ArrVal_897 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_897) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-06 17:39:52,762 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (or (= (select |c_#valid| .cse0) 1) (and (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) (forall ((v_ArrVal_897 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_897) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))))))) is different from false [2021-12-06 17:39:52,802 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int)) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (or (and (forall ((v_ArrVal_897 (Array Int Int)) (v_ArrVal_890 Int)) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_890)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_897) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-06 17:39:52,990 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_13|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_13|) 0)) (and (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) (forall ((v_ArrVal_897 (Array Int Int)) (v_ArrVal_890 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_890)) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_897) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_13| 1) .cse0) 1)))) is different from false [2021-12-06 17:39:53,006 INFO L354 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2021-12-06 17:39:53,007 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 82 treesize of output 74 [2021-12-06 17:39:53,017 INFO L354 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2021-12-06 17:39:53,017 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 74 treesize of output 86 [2021-12-06 17:39:53,022 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:39:53,022 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 100 treesize of output 94 [2021-12-06 17:39:53,028 INFO L354 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2021-12-06 17:39:53,028 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 126 treesize of output 108 [2021-12-06 17:39:53,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 100 [2021-12-06 17:39:53,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:39:55,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:39:55,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736778880] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:39:55,080 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:39:55,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 39 [2021-12-06 17:39:55,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764341581] [2021-12-06 17:39:55,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:39:55,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-06 17:39:55,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:39:55,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-06 17:39:55,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1011, Unknown=6, NotChecked=350, Total=1560 [2021-12-06 17:39:55,082 INFO L87 Difference]: Start difference. First operand 217 states and 251 transitions. Second operand has 40 states, 39 states have (on average 2.41025641025641) internal successors, (94), 40 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:01,616 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_ArrVal_898 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int)) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (or (and (forall ((v_ArrVal_897 (Array Int Int)) (v_ArrVal_890 Int)) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_890)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_897) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select |c_#valid| .cse0) 1))))) is different from false [2021-12-06 17:40:01,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:01,988 INFO L93 Difference]: Finished difference Result 406 states and 468 transitions. [2021-12-06 17:40:01,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-12-06 17:40:01,988 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.41025641025641) internal successors, (94), 40 states have internal predecessors, (94), 0 states have call successors, (0), 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 17:40:01,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:01,990 INFO L225 Difference]: With dead ends: 406 [2021-12-06 17:40:01,990 INFO L226 Difference]: Without dead ends: 406 [2021-12-06 17:40:01,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=544, Invalid=2551, Unknown=9, NotChecked=678, Total=3782 [2021-12-06 17:40:01,991 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 373 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 2029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1347 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:01,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 1242 Invalid, 2029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 645 Invalid, 0 Unknown, 1347 Unchecked, 0.3s Time] [2021-12-06 17:40:01,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-12-06 17:40:01,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 246. [2021-12-06 17:40:01,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 225 states have (on average 1.28) internal successors, (288), 245 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 288 transitions. [2021-12-06 17:40:01,996 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 288 transitions. Word has length 34 [2021-12-06 17:40:01,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:01,996 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 288 transitions. [2021-12-06 17:40:01,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.41025641025641) internal successors, (94), 40 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:01,996 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 288 transitions. [2021-12-06 17:40:01,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-06 17:40:01,996 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:01,996 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:02,016 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 17:40:02,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-06 17:40:02,198 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:40:02,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:02,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1500876313, now seen corresponding path program 1 times [2021-12-06 17:40:02,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:02,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122443126] [2021-12-06 17:40:02,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:02,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:02,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:02,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122443126] [2021-12-06 17:40:02,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122443126] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:40:02,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680944105] [2021-12-06 17:40:02,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:02,449 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:40:02,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:40:02,450 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:40:02,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 17:40:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:02,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-06 17:40:02,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:40:02,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:40:02,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:40:02,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:40:02,585 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:40:02,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:40:02,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:02,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:40:02,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:02,602 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 21 treesize of output 20 [2021-12-06 17:40:02,694 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:40:02,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:40:02,706 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:40:02,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:40:02,711 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 17:40:02,775 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:40:02,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:40:02,779 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 17:40:02,788 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:40:02,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:40:02,824 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:40:02,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-06 17:40:02,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-06 17:40:02,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:02,929 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:02,929 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 27 treesize of output 11 [2021-12-06 17:40:02,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 17:40:02,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:02,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:40:03,008 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1005 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1005) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1004 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-06 17:40:03,029 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1005 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1005) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1004 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) is different from false [2021-12-06 17:40:03,035 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1004 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1004) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_1005 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1005) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-06 17:40:03,047 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1005 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1005) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_998 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_998)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-06 17:40:03,065 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_16| Int)) (or (and (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_998 Int)) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_998)) |v_ULTIMATE.start_main_#t~malloc7#1.base_16| v_ArrVal_1004) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_1005 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_16| v_ArrVal_1005) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 0)))) is different from false [2021-12-06 17:40:03,173 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:03,176 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:03,176 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 51 treesize of output 57 [2021-12-06 17:40:03,179 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:03,182 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:03,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 62 [2021-12-06 17:40:03,185 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:03,187 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:03,187 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 76 treesize of output 60 [2021-12-06 17:40:03,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:03,191 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:03,191 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 74 treesize of output 58 [2021-12-06 17:40:03,196 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 25 treesize of output 21 [2021-12-06 17:40:03,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 21 treesize of output 17 [2021-12-06 17:40:03,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-06 17:40:03,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680944105] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:40:03,220 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:40:03,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 31 [2021-12-06 17:40:03,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467633996] [2021-12-06 17:40:03,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:40:03,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-06 17:40:03,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:03,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-06 17:40:03,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=556, Unknown=6, NotChecked=260, Total=930 [2021-12-06 17:40:03,222 INFO L87 Difference]: Start difference. First operand 246 states and 288 transitions. Second operand has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:03,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:03,886 INFO L93 Difference]: Finished difference Result 330 states and 376 transitions. [2021-12-06 17:40:03,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-06 17:40:03,886 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 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 17:40:03,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:03,888 INFO L225 Difference]: With dead ends: 330 [2021-12-06 17:40:03,888 INFO L226 Difference]: Without dead ends: 330 [2021-12-06 17:40:03,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 53 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=301, Invalid=1351, Unknown=8, NotChecked=410, Total=2070 [2021-12-06 17:40:03,889 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 242 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1052 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:03,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 1163 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 750 Invalid, 0 Unknown, 1052 Unchecked, 0.3s Time] [2021-12-06 17:40:03,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-12-06 17:40:03,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 231. [2021-12-06 17:40:03,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 210 states have (on average 1.2809523809523808) internal successors, (269), 230 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:03,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 269 transitions. [2021-12-06 17:40:03,892 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 269 transitions. Word has length 34 [2021-12-06 17:40:03,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:03,893 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 269 transitions. [2021-12-06 17:40:03,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:03,893 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 269 transitions. [2021-12-06 17:40:03,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-06 17:40:03,893 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:03,893 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:03,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 17:40:04,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-06 17:40:04,095 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:40:04,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:04,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1970599096, now seen corresponding path program 1 times [2021-12-06 17:40:04,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:04,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302791145] [2021-12-06 17:40:04,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:04,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 17:40:04,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:04,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302791145] [2021-12-06 17:40:04,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302791145] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:40:04,157 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:40:04,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 17:40:04,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510057688] [2021-12-06 17:40:04,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:40:04,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 17:40:04,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:04,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 17:40:04,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 17:40:04,158 INFO L87 Difference]: Start difference. First operand 231 states and 269 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:04,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:04,230 INFO L93 Difference]: Finished difference Result 245 states and 277 transitions. [2021-12-06 17:40:04,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 17:40:04,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-06 17:40:04,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:04,231 INFO L225 Difference]: With dead ends: 245 [2021-12-06 17:40:04,231 INFO L226 Difference]: Without dead ends: 245 [2021-12-06 17:40:04,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:40:04,232 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 115 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:04,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 134 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:40:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-12-06 17:40:04,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 233. [2021-12-06 17:40:04,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 212 states have (on average 1.278301886792453) internal successors, (271), 232 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:04,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 271 transitions. [2021-12-06 17:40:04,236 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 271 transitions. Word has length 35 [2021-12-06 17:40:04,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:04,236 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 271 transitions. [2021-12-06 17:40:04,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:04,236 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 271 transitions. [2021-12-06 17:40:04,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-06 17:40:04,236 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:04,237 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:04,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-06 17:40:04,237 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:40:04,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:04,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1970588111, now seen corresponding path program 1 times [2021-12-06 17:40:04,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:04,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045848397] [2021-12-06 17:40:04,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:04,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:04,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:04,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:04,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045848397] [2021-12-06 17:40:04,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045848397] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:40:04,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282312898] [2021-12-06 17:40:04,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:04,352 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:40:04,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:40:04,353 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:40:04,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 17:40:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:04,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-06 17:40:04,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:40:04,626 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:04,627 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:04,627 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 10 [2021-12-06 17:40:04,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:04,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:40:04,903 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:04,903 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 30 treesize of output 27 [2021-12-06 17:40:05,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:05,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282312898] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:40:05,031 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:40:05,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 28 [2021-12-06 17:40:05,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129240590] [2021-12-06 17:40:05,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:40:05,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-06 17:40:05,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:05,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-06 17:40:05,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2021-12-06 17:40:05,032 INFO L87 Difference]: Start difference. First operand 233 states and 271 transitions. Second operand has 28 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:05,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:05,463 INFO L93 Difference]: Finished difference Result 322 states and 365 transitions. [2021-12-06 17:40:05,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-06 17:40:05,464 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-06 17:40:05,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:05,465 INFO L225 Difference]: With dead ends: 322 [2021-12-06 17:40:05,465 INFO L226 Difference]: Without dead ends: 322 [2021-12-06 17:40:05,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=289, Invalid=1271, Unknown=0, NotChecked=0, Total=1560 [2021-12-06 17:40:05,466 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 372 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:05,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 1045 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 534 Invalid, 0 Unknown, 191 Unchecked, 0.2s Time] [2021-12-06 17:40:05,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-12-06 17:40:05,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 273. [2021-12-06 17:40:05,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 252 states have (on average 1.25) internal successors, (315), 272 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:05,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 315 transitions. [2021-12-06 17:40:05,470 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 315 transitions. Word has length 35 [2021-12-06 17:40:05,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:05,470 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 315 transitions. [2021-12-06 17:40:05,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:05,470 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 315 transitions. [2021-12-06 17:40:05,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 17:40:05,470 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:05,470 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:05,490 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-06 17:40:05,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-06 17:40:05,672 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:40:05,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:05,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1824477449, now seen corresponding path program 1 times [2021-12-06 17:40:05,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:05,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184850440] [2021-12-06 17:40:05,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:05,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:05,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:05,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:05,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184850440] [2021-12-06 17:40:05,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184850440] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:40:05,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306459096] [2021-12-06 17:40:05,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:05,880 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:40:05,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:40:05,880 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:40:05,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 17:40:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:05,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-06 17:40:05,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:40:05,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:40:05,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:40:05,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:40:06,007 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:40:06,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:40:06,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:06,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:40:06,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:06,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:40:06,124 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:40:06,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:40:06,134 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:40:06,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:40:06,139 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 17:40:06,200 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:40:06,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:40:06,204 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 17:40:06,212 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:40:06,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:40:06,254 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:40:06,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-06 17:40:06,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-06 17:40:06,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 17:40:06,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:06,402 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:06,402 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 27 treesize of output 11 [2021-12-06 17:40:06,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:06,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:40:06,481 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1173 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_1172 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) is different from false [2021-12-06 17:40:06,506 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1172 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1173 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-06 17:40:06,512 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1172 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1172) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_1173 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1173) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-06 17:40:06,727 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:06,731 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:06,731 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 51 treesize of output 57 [2021-12-06 17:40:06,734 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:06,737 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:06,738 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 62 [2021-12-06 17:40:06,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:06,742 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:06,742 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 76 treesize of output 60 [2021-12-06 17:40:06,746 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:06,747 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:06,748 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 74 treesize of output 58 [2021-12-06 17:40:06,753 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 25 treesize of output 21 [2021-12-06 17:40:06,755 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 21 treesize of output 17 [2021-12-06 17:40:06,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:06,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306459096] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:40:06,784 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:40:06,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 28 [2021-12-06 17:40:06,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52265421] [2021-12-06 17:40:06,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:40:06,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-06 17:40:06,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:06,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-06 17:40:06,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=502, Unknown=7, NotChecked=144, Total=756 [2021-12-06 17:40:06,786 INFO L87 Difference]: Start difference. First operand 273 states and 315 transitions. Second operand has 28 states, 28 states have (on average 3.25) internal successors, (91), 28 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:07,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:07,277 INFO L93 Difference]: Finished difference Result 319 states and 361 transitions. [2021-12-06 17:40:07,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 17:40:07,278 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.25) internal successors, (91), 28 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-06 17:40:07,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:07,279 INFO L225 Difference]: With dead ends: 319 [2021-12-06 17:40:07,279 INFO L226 Difference]: Without dead ends: 319 [2021-12-06 17:40:07,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=239, Invalid=956, Unknown=7, NotChecked=204, Total=1406 [2021-12-06 17:40:07,280 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 205 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 728 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:07,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 1016 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 569 Invalid, 0 Unknown, 728 Unchecked, 0.2s Time] [2021-12-06 17:40:07,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-12-06 17:40:07,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 285. [2021-12-06 17:40:07,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 264 states have (on average 1.2424242424242424) internal successors, (328), 284 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:07,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 328 transitions. [2021-12-06 17:40:07,284 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 328 transitions. Word has length 36 [2021-12-06 17:40:07,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:07,284 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 328 transitions. [2021-12-06 17:40:07,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.25) internal successors, (91), 28 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:07,284 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 328 transitions. [2021-12-06 17:40:07,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 17:40:07,285 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:07,285 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:07,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-06 17:40:07,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:40:07,486 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:40:07,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:07,488 INFO L85 PathProgramCache]: Analyzing trace with hash -590102785, now seen corresponding path program 1 times [2021-12-06 17:40:07,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:07,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790302151] [2021-12-06 17:40:07,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:07,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:07,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:07,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:07,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790302151] [2021-12-06 17:40:07,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790302151] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:40:07,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598661616] [2021-12-06 17:40:07,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:07,688 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:40:07,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:40:07,689 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:40:07,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 17:40:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:07,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-06 17:40:07,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:40:07,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:40:07,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:40:07,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:40:07,812 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:40:07,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:40:07,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:07,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:40:07,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:07,831 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 21 treesize of output 20 [2021-12-06 17:40:07,917 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:40:07,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:40:07,927 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:40:07,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:40:07,930 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 17:40:07,986 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:40:07,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:40:07,997 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:40:07,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:40:08,000 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 17:40:08,032 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:40:08,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-06 17:40:08,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-06 17:40:08,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 17:40:08,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:08,178 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:08,178 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 27 treesize of output 11 [2021-12-06 17:40:08,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:08,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:40:08,242 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1280 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1280) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1279 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1279) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-06 17:40:08,261 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1280 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1280) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_1279 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1279) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) is different from false [2021-12-06 17:40:08,266 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1280 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1280) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_1279 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1279) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-06 17:40:08,453 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:08,456 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:08,456 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 51 treesize of output 57 [2021-12-06 17:40:08,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:08,462 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:08,462 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 62 [2021-12-06 17:40:08,464 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:08,466 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:08,466 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 76 treesize of output 60 [2021-12-06 17:40:08,469 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:08,470 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:08,470 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 74 treesize of output 58 [2021-12-06 17:40:08,474 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 25 treesize of output 21 [2021-12-06 17:40:08,475 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 21 treesize of output 17 [2021-12-06 17:40:08,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:08,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598661616] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:40:08,499 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:40:08,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 28 [2021-12-06 17:40:08,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066635114] [2021-12-06 17:40:08,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:40:08,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-06 17:40:08,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:08,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-06 17:40:08,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=501, Unknown=8, NotChecked=144, Total=756 [2021-12-06 17:40:08,500 INFO L87 Difference]: Start difference. First operand 285 states and 328 transitions. Second operand has 28 states, 28 states have (on average 3.25) internal successors, (91), 28 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:08,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:08,977 INFO L93 Difference]: Finished difference Result 325 states and 367 transitions. [2021-12-06 17:40:08,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 17:40:08,977 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.25) internal successors, (91), 28 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-06 17:40:08,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:08,978 INFO L225 Difference]: With dead ends: 325 [2021-12-06 17:40:08,978 INFO L226 Difference]: Without dead ends: 325 [2021-12-06 17:40:08,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=239, Invalid=955, Unknown=8, NotChecked=204, Total=1406 [2021-12-06 17:40:08,979 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 265 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 649 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:08,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 871 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 512 Invalid, 0 Unknown, 649 Unchecked, 0.2s Time] [2021-12-06 17:40:08,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-12-06 17:40:08,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 280. [2021-12-06 17:40:08,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 259 states have (on average 1.2432432432432432) internal successors, (322), 279 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 322 transitions. [2021-12-06 17:40:08,984 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 322 transitions. Word has length 36 [2021-12-06 17:40:08,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:08,984 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 322 transitions. [2021-12-06 17:40:08,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.25) internal successors, (91), 28 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:08,985 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 322 transitions. [2021-12-06 17:40:08,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-06 17:40:08,985 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:08,985 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:09,005 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-06 17:40:09,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:40:09,187 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:40:09,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:09,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1501701986, now seen corresponding path program 1 times [2021-12-06 17:40:09,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:09,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314735957] [2021-12-06 17:40:09,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:09,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:09,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:09,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314735957] [2021-12-06 17:40:09,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314735957] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:40:09,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936422876] [2021-12-06 17:40:09,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:09,423 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:40:09,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:40:09,423 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:40:09,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 17:40:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:09,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-06 17:40:09,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:40:09,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:40:09,527 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-06 17:40:09,527 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 17:40:09,547 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 17:40:09,599 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:40:09,599 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 17:40:09,648 INFO L354 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2021-12-06 17:40:09,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2021-12-06 17:40:09,689 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-06 17:40:09,689 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 43 treesize of output 36 [2021-12-06 17:40:09,981 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:40:09,981 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 54 treesize of output 48 [2021-12-06 17:40:10,259 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:40:10,259 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 54 treesize of output 48 [2021-12-06 17:40:10,341 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:40:10,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2021-12-06 17:40:11,089 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:11,089 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 44 treesize of output 32 [2021-12-06 17:40:11,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:11,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:40:11,248 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1399 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1399) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1)) is different from false [2021-12-06 17:40:11,262 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1399 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1399) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1)) is different from false [2021-12-06 17:40:11,299 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1399 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1399) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1)) is different from false [2021-12-06 17:40:11,338 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1399 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_26| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_26| 1) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_26|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_26| v_ArrVal_1399) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_26|) 0)))) is different from false [2021-12-06 17:40:11,351 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1399 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_26| Int) (v_ArrVal_1393 (Array Int Int))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_26| 1) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1393))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_26|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_26| v_ArrVal_1399) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_26|) 0)))) is different from false [2021-12-06 17:40:11,406 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:11,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 42 [2021-12-06 17:40:11,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:11,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2021-12-06 17:40:11,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-12-06 17:40:11,419 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 29 treesize of output 25 [2021-12-06 17:40:11,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:11,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936422876] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:40:11,540 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:40:11,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 37 [2021-12-06 17:40:11,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476787873] [2021-12-06 17:40:11,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:40:11,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-06 17:40:11,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:11,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-06 17:40:11,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=878, Unknown=15, NotChecked=330, Total=1406 [2021-12-06 17:40:11,541 INFO L87 Difference]: Start difference. First operand 280 states and 322 transitions. Second operand has 38 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 38 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:16,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:16,905 INFO L93 Difference]: Finished difference Result 462 states and 530 transitions. [2021-12-06 17:40:16,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-06 17:40:16,906 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 38 states have internal predecessors, (96), 0 states have call successors, (0), 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 38 [2021-12-06 17:40:16,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:16,907 INFO L225 Difference]: With dead ends: 462 [2021-12-06 17:40:16,908 INFO L226 Difference]: Without dead ends: 462 [2021-12-06 17:40:16,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 57 SyntacticMatches, 10 SemanticMatches, 56 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=414, Invalid=2338, Unknown=24, NotChecked=530, Total=3306 [2021-12-06 17:40:16,909 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 261 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 2573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1476 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:16,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 1638 Invalid, 2573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1046 Invalid, 0 Unknown, 1476 Unchecked, 0.4s Time] [2021-12-06 17:40:16,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2021-12-06 17:40:16,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 302. [2021-12-06 17:40:16,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 281 states have (on average 1.2419928825622777) internal successors, (349), 301 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:16,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 349 transitions. [2021-12-06 17:40:16,913 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 349 transitions. Word has length 38 [2021-12-06 17:40:16,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:16,913 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 349 transitions. [2021-12-06 17:40:16,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 38 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:16,913 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 349 transitions. [2021-12-06 17:40:16,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-06 17:40:16,914 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:16,914 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:16,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-06 17:40:17,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:40:17,115 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:40:17,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:17,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1501701985, now seen corresponding path program 1 times [2021-12-06 17:40:17,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:17,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409739339] [2021-12-06 17:40:17,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:17,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:17,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:17,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:17,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409739339] [2021-12-06 17:40:17,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409739339] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:40:17,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802280289] [2021-12-06 17:40:17,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:17,501 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:40:17,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:40:17,502 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:40:17,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-06 17:40:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:17,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 67 conjunts are in the unsatisfiable core [2021-12-06 17:40:17,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:40:17,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:40:17,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 17:40:17,622 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-06 17:40:17,622 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 17:40:17,648 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 17:40:17,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:40:17,713 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:40:17,713 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 57 treesize of output 54 [2021-12-06 17:40:17,716 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 17:40:17,793 INFO L354 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2021-12-06 17:40:17,793 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 1 case distinctions, treesize of input 18 treesize of output 30 [2021-12-06 17:40:17,813 INFO L354 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-12-06 17:40:17,813 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 22 treesize of output 24 [2021-12-06 17:40:17,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:17,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:40:17,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:17,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2021-12-06 17:40:18,024 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:40:18,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 49 [2021-12-06 17:40:18,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:18,028 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 23 [2021-12-06 17:40:18,102 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:40:18,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 49 [2021-12-06 17:40:18,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:18,107 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 23 [2021-12-06 17:40:18,137 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:40:18,137 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 64 treesize of output 57 [2021-12-06 17:40:18,141 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 27 treesize of output 27 [2021-12-06 17:40:18,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:18,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2021-12-06 17:40:18,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:18,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-06 17:40:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:18,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:40:18,504 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1527 (Array Int Int)) (v_ArrVal_1526 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1526) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1527) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1526 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1526) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) is different from false [2021-12-06 17:40:18,527 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1527 (Array Int Int)) (v_ArrVal_1526 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1526) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1527) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1526 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1526) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) is different from false [2021-12-06 17:40:18,533 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1526 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1526) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_1527 (Array Int Int)) (v_ArrVal_1526 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1526) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1527) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) is different from false [2021-12-06 17:40:18,673 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_29| Int)) (or (and (forall ((v_ArrVal_1526 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc7#1.base_29| v_ArrVal_1526) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_1527 (Array Int Int)) (v_ArrVal_1517 Int) (v_ArrVal_1526 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc7#1.base_29| v_ArrVal_1526) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_29| v_ArrVal_1517) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_29|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_29| v_ArrVal_1527) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_29|) 0)))) is different from false [2021-12-06 17:40:19,362 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:19,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 134 [2021-12-06 17:40:19,365 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:19,366 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 190 treesize of output 186 [2021-12-06 17:40:19,372 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:19,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 136 [2021-12-06 17:40:19,375 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:19,377 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 182 treesize of output 174 [2021-12-06 17:40:19,380 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:19,381 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 165 treesize of output 149 [2021-12-06 17:40:19,384 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:19,385 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 143 treesize of output 131 [2021-12-06 17:40:19,388 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:19,389 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 116 treesize of output 108 [2021-12-06 17:40:19,397 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:19,398 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 102 treesize of output 94 [2021-12-06 17:40:19,401 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:19,402 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 91 treesize of output 87 [2021-12-06 17:40:19,469 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:19,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-06 17:40:19,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802280289] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:40:19,527 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:40:19,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 39 [2021-12-06 17:40:19,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510660531] [2021-12-06 17:40:19,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:40:19,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-06 17:40:19,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:19,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-06 17:40:19,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1093, Unknown=16, NotChecked=284, Total=1560 [2021-12-06 17:40:19,529 INFO L87 Difference]: Start difference. First operand 302 states and 349 transitions. Second operand has 40 states, 39 states have (on average 2.8205128205128207) internal successors, (110), 40 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:19,689 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse5 (select .cse1 .cse4)) (.cse6 (select |c_#length| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_29| Int)) (or (and (forall ((v_ArrVal_1526 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc7#1.base_29| v_ArrVal_1526) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_1527 (Array Int Int)) (v_ArrVal_1517 Int) (v_ArrVal_1526 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc7#1.base_29| v_ArrVal_1526) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_29| v_ArrVal_1517) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_29|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_29| v_ArrVal_1527) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_29|) 0)))) (<= 12 (select |c_#length| (select .cse1 .cse2))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select .cse3 .cse4)) (<= 12 (select |c_#length| .cse5)) (<= .cse6 12) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |c_#valid| .cse5) 1) (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) (<= 12 .cse6) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select .cse3 .cse2)) (< |c_ULTIMATE.start_main_~x~0#1.offset| (+ |c_ULTIMATE.start_main_~head~0#1.offset| 1)) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1)))) is different from false [2021-12-06 17:40:25,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:25,310 INFO L93 Difference]: Finished difference Result 509 states and 575 transitions. [2021-12-06 17:40:25,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-06 17:40:25,310 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.8205128205128207) internal successors, (110), 40 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) Word has length 38 [2021-12-06 17:40:25,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:25,312 INFO L225 Difference]: With dead ends: 509 [2021-12-06 17:40:25,312 INFO L226 Difference]: Without dead ends: 509 [2021-12-06 17:40:25,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 58 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=582, Invalid=3320, Unknown=24, NotChecked=630, Total=4556 [2021-12-06 17:40:25,314 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 526 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1959 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:25,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [526 Valid, 1900 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1166 Invalid, 0 Unknown, 1959 Unchecked, 0.6s Time] [2021-12-06 17:40:25,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2021-12-06 17:40:25,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 317. [2021-12-06 17:40:25,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 296 states have (on average 1.239864864864865) internal successors, (367), 316 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:25,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 367 transitions. [2021-12-06 17:40:25,318 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 367 transitions. Word has length 38 [2021-12-06 17:40:25,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:25,318 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 367 transitions. [2021-12-06 17:40:25,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.8205128205128207) internal successors, (110), 40 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:25,319 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 367 transitions. [2021-12-06 17:40:25,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-06 17:40:25,319 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:25,319 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:25,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-06 17:40:25,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:40:25,520 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:40:25,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:25,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1790052731, now seen corresponding path program 1 times [2021-12-06 17:40:25,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:25,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78956328] [2021-12-06 17:40:25,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:25,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:25,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:25,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:25,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78956328] [2021-12-06 17:40:25,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78956328] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:40:25,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109398070] [2021-12-06 17:40:25,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:25,609 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:40:25,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:40:25,609 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:40:25,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-06 17:40:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:25,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-06 17:40:25,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:40:25,868 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:25,869 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:40:25,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:25,873 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:25,873 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 15 treesize of output 10 [2021-12-06 17:40:25,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:25,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:40:26,036 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-06 17:40:26,037 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 24 treesize of output 23 [2021-12-06 17:40:26,042 INFO L354 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2021-12-06 17:40:26,042 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 20 treesize of output 12 [2021-12-06 17:40:26,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:26,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109398070] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:40:26,183 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:40:26,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2021-12-06 17:40:26,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011356276] [2021-12-06 17:40:26,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:40:26,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-06 17:40:26,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:26,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-06 17:40:26,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-12-06 17:40:26,184 INFO L87 Difference]: Start difference. First operand 317 states and 367 transitions. Second operand has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:26,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:26,533 INFO L93 Difference]: Finished difference Result 372 states and 423 transitions. [2021-12-06 17:40:26,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-06 17:40:26,534 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 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 38 [2021-12-06 17:40:26,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:26,535 INFO L225 Difference]: With dead ends: 372 [2021-12-06 17:40:26,535 INFO L226 Difference]: Without dead ends: 372 [2021-12-06 17:40:26,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2021-12-06 17:40:26,536 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 259 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 230 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:26,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 777 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 333 Invalid, 0 Unknown, 230 Unchecked, 0.1s Time] [2021-12-06 17:40:26,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-12-06 17:40:26,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 336. [2021-12-06 17:40:26,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 315 states have (on average 1.2444444444444445) internal successors, (392), 335 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:26,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 392 transitions. [2021-12-06 17:40:26,540 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 392 transitions. Word has length 38 [2021-12-06 17:40:26,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:26,540 INFO L470 AbstractCegarLoop]: Abstraction has 336 states and 392 transitions. [2021-12-06 17:40:26,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:26,541 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 392 transitions. [2021-12-06 17:40:26,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-06 17:40:26,541 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:26,541 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:26,573 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-06 17:40:26,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-12-06 17:40:26,742 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:40:26,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:26,743 INFO L85 PathProgramCache]: Analyzing trace with hash -434794642, now seen corresponding path program 1 times [2021-12-06 17:40:26,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:26,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858551046] [2021-12-06 17:40:26,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:26,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:27,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:27,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:27,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858551046] [2021-12-06 17:40:27,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858551046] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:40:27,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113932518] [2021-12-06 17:40:27,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:27,007 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:40:27,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:40:27,008 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:40:27,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-06 17:40:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:27,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 56 conjunts are in the unsatisfiable core [2021-12-06 17:40:27,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:40:27,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:40:27,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:40:27,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:40:27,192 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:40:27,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:40:27,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:27,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:40:27,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:27,228 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 21 treesize of output 20 [2021-12-06 17:40:27,352 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:40:27,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:40:27,361 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:40:27,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:40:27,364 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 17:40:27,428 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:40:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:40:27,437 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:40:27,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:40:27,442 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 17:40:27,482 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:40:27,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:40:27,524 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:40:27,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:40:27,527 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 17:40:27,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:27,540 INFO L354 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2021-12-06 17:40:27,540 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 2 case distinctions, treesize of input 38 treesize of output 36 [2021-12-06 17:40:27,649 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-06 17:40:27,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 63 [2021-12-06 17:40:27,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-06 17:40:27,656 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 20 treesize of output 12 [2021-12-06 17:40:27,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 17:40:27,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:27,788 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:27,788 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 27 treesize of output 11 [2021-12-06 17:40:27,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:27,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:40:27,911 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1695 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1695) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1694 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1694) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) is different from false [2021-12-06 17:40:27,916 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1695 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) v_ArrVal_1695) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_1694 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) v_ArrVal_1694) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) is different from false [2021-12-06 17:40:27,926 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1694 (Array Int Int)) (v_ArrVal_1691 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1691) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1694) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1695 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4) |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1695) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-06 17:40:27,980 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:27,980 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 1 case distinctions, treesize of input 36 treesize of output 40 [2021-12-06 17:40:27,986 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 30 treesize of output 22 [2021-12-06 17:40:28,041 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 30 treesize of output 22 [2021-12-06 17:40:28,057 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 30 treesize of output 22 [2021-12-06 17:40:28,073 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 30 treesize of output 22 [2021-12-06 17:40:28,092 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 30 treesize of output 22 [2021-12-06 17:40:28,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2021-12-06 17:40:28,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2021-12-06 17:40:28,233 INFO L354 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2021-12-06 17:40:28,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2021-12-06 17:40:28,247 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:40:28,247 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 35 treesize of output 31 [2021-12-06 17:40:28,257 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_107| Int) (v_arrayElimArr_16 (Array Int Int))) (or (= (select v_arrayElimArr_16 (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_107|)) |c_ULTIMATE.start_main_~x~0#1.base|) (and (forall ((v_ArrVal_1684 Int) (v_ArrVal_1694 (Array Int Int)) (v_ArrVal_1691 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1684)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1691) (select v_arrayElimArr_16 (+ |v_ULTIMATE.start_main_~x~0#1.offset_107| 4)) v_ArrVal_1694) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_1695 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_arrayElimArr_16) (select v_arrayElimArr_16 (+ |v_ULTIMATE.start_main_~x~0#1.offset_107| 4)) v_ArrVal_1695) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|))))) is different from false [2021-12-06 17:40:28,268 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:40:28,269 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 35 treesize of output 31 [2021-12-06 17:40:28,316 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:40:28,316 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 35 treesize of output 31 [2021-12-06 17:40:28,336 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:40:28,336 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 35 treesize of output 31 [2021-12-06 17:40:28,451 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:40:28,451 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 35 treesize of output 31 [2021-12-06 17:40:28,501 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:40:28,501 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 35 treesize of output 31 [2021-12-06 17:40:28,522 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:40:28,523 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 35 treesize of output 31 [2021-12-06 17:40:28,550 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:40:28,550 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 35 treesize of output 31 [2021-12-06 17:40:28,599 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:40:28,600 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 35 treesize of output 31 [2021-12-06 17:40:28,726 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:28,729 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:28,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 71 [2021-12-06 17:40:28,732 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:28,733 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:28,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 78 treesize of output 62 [2021-12-06 17:40:28,736 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:28,740 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:28,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 67 [2021-12-06 17:40:28,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:28,744 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:28,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 74 treesize of output 58 [2021-12-06 17:40:28,751 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:28,751 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 65 treesize of output 69 [2021-12-06 17:40:28,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 21 treesize of output 17 [2021-12-06 17:40:28,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:28,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113932518] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:40:28,794 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:40:28,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 46 [2021-12-06 17:40:28,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220876718] [2021-12-06 17:40:28,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:40:28,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-06 17:40:28,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:28,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-06 17:40:28,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1499, Unknown=31, NotChecked=332, Total=2070 [2021-12-06 17:40:28,796 INFO L87 Difference]: Start difference. First operand 336 states and 392 transitions. Second operand has 46 states, 46 states have (on average 2.260869565217391) internal successors, (104), 46 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:29,184 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (<= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~x~0#1.offset| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (and (<= |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (not (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|)))) (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse2)) (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 1) (< |c_ULTIMATE.start_main_~x~0#1.offset| (+ |c_ULTIMATE.start_main_~head~0#1.offset| 1)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_107| Int) (v_arrayElimArr_16 (Array Int Int))) (or (not (= (select |c_#valid| (select v_arrayElimArr_16 (+ |v_ULTIMATE.start_main_~x~0#1.offset_107| 4))) 0)) (and (forall ((v_ArrVal_1695 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_arrayElimArr_16) (select v_arrayElimArr_16 (+ |v_ULTIMATE.start_main_~x~0#1.offset_107| 4)) v_ArrVal_1695) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1694 (Array Int Int)) (v_ArrVal_1691 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1691) (select v_arrayElimArr_16 (+ |v_ULTIMATE.start_main_~x~0#1.offset_107| 4)) v_ArrVal_1694) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))))) (= (select .cse3 .cse2) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.base|) (= (select .cse3 .cse1) |c_ULTIMATE.start_main_~head~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~x~0#1.base| (select .cse3 |c_ULTIMATE.start_main_~x~0#1.offset|))))) is different from false [2021-12-06 17:40:30,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:30,379 INFO L93 Difference]: Finished difference Result 425 states and 486 transitions. [2021-12-06 17:40:30,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-06 17:40:30,379 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.260869565217391) internal successors, (104), 46 states have internal predecessors, (104), 0 states have call successors, (0), 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 38 [2021-12-06 17:40:30,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:30,381 INFO L225 Difference]: With dead ends: 425 [2021-12-06 17:40:30,381 INFO L226 Difference]: Without dead ends: 425 [2021-12-06 17:40:30,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 5 IntricatePredicates, 3 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=465, Invalid=3555, Unknown=32, NotChecked=640, Total=4692 [2021-12-06 17:40:30,382 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 382 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1076 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:30,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 1422 Invalid, 1923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 806 Invalid, 0 Unknown, 1076 Unchecked, 0.3s Time] [2021-12-06 17:40:30,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-12-06 17:40:30,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 360. [2021-12-06 17:40:30,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 339 states have (on average 1.238938053097345) internal successors, (420), 359 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:30,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 420 transitions. [2021-12-06 17:40:30,387 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 420 transitions. Word has length 38 [2021-12-06 17:40:30,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:30,387 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 420 transitions. [2021-12-06 17:40:30,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.260869565217391) internal successors, (104), 46 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:30,387 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 420 transitions. [2021-12-06 17:40:30,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-06 17:40:30,388 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:30,388 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:30,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-06 17:40:30,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-12-06 17:40:30,588 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:40:30,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:30,589 INFO L85 PathProgramCache]: Analyzing trace with hash 244280934, now seen corresponding path program 1 times [2021-12-06 17:40:30,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:30,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343931905] [2021-12-06 17:40:30,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:30,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:30,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:30,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:30,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343931905] [2021-12-06 17:40:30,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343931905] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:40:30,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075481874] [2021-12-06 17:40:30,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:30,791 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:40:30,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:40:30,792 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:40:30,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-06 17:40:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:30,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 56 conjunts are in the unsatisfiable core [2021-12-06 17:40:30,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:40:30,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:40:30,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:40:30,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:40:30,959 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:40:30,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:40:30,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:30,994 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 21 treesize of output 20 [2021-12-06 17:40:31,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:31,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:40:31,126 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:40:31,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:40:31,137 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:40:31,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:40:31,142 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 17:40:31,206 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:40:31,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:40:31,209 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 17:40:31,223 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:40:31,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:40:31,269 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:40:31,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:40:31,313 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:40:31,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:40:31,315 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 17:40:31,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:31,329 INFO L354 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2021-12-06 17:40:31,329 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 2 case distinctions, treesize of input 38 treesize of output 36 [2021-12-06 17:40:31,461 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-06 17:40:31,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 63 [2021-12-06 17:40:31,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-06 17:40:31,471 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 20 treesize of output 12 [2021-12-06 17:40:31,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 17:40:31,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:31,610 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:31,610 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 27 treesize of output 11 [2021-12-06 17:40:31,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:31,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:40:31,740 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1821 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1821) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1820 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1820) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-06 17:40:31,745 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1821 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) v_ArrVal_1821) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_1820 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) v_ArrVal_1820) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-06 17:40:31,756 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1820 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4) |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1820) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1821 (Array Int Int)) (v_ArrVal_1818 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1818) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1821) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-06 17:40:31,772 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_20| Int)) (or (and (forall ((v_ArrVal_1821 (Array Int Int)) (v_ArrVal_1818 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1818) |v_ULTIMATE.start_main_#t~malloc10#1.base_20| v_ArrVal_1821) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1820 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4) |v_ULTIMATE.start_main_#t~malloc10#1.base_20|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_20| v_ArrVal_1820) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_20|) 0)))) is different from false [2021-12-06 17:40:31,779 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:31,780 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 1 case distinctions, treesize of input 36 treesize of output 40 [2021-12-06 17:40:31,786 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 30 treesize of output 22 [2021-12-06 17:40:31,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 30 treesize of output 22 [2021-12-06 17:40:31,857 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 30 treesize of output 22 [2021-12-06 17:40:31,872 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 30 treesize of output 22 [2021-12-06 17:40:31,891 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 30 treesize of output 22 [2021-12-06 17:40:31,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2021-12-06 17:40:32,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2021-12-06 17:40:32,036 INFO L354 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2021-12-06 17:40:32,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 17 treesize of output 16 [2021-12-06 17:40:32,048 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:40:32,048 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 35 treesize of output 31 [2021-12-06 17:40:32,057 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_19 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_113| Int)) (or (and (forall ((v_ArrVal_1820 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_arrayElimArr_19) (select v_arrayElimArr_19 (+ |v_ULTIMATE.start_main_~x~0#1.offset_113| 4)) v_ArrVal_1820) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1821 (Array Int Int)) (v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1810 Int)) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1810)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1818) (select v_arrayElimArr_19 (+ |v_ULTIMATE.start_main_~x~0#1.offset_113| 4)) v_ArrVal_1821) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) (= (select v_arrayElimArr_19 (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_113|)) |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2021-12-06 17:40:32,084 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:40:32,084 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 35 treesize of output 31 [2021-12-06 17:40:32,107 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:40:32,108 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 35 treesize of output 31 [2021-12-06 17:40:32,140 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:40:32,141 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 35 treesize of output 31 [2021-12-06 17:40:32,255 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:40:32,255 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 35 treesize of output 31 [2021-12-06 17:40:32,274 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:40:32,274 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 35 treesize of output 31 [2021-12-06 17:40:32,307 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:40:32,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2021-12-06 17:40:32,347 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:40:32,347 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 35 treesize of output 31 [2021-12-06 17:40:32,373 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:40:32,373 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 35 treesize of output 31 [2021-12-06 17:40:32,496 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:32,501 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:32,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 71 [2021-12-06 17:40:32,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:32,505 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:32,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 78 treesize of output 62 [2021-12-06 17:40:32,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:32,518 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:32,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 67 [2021-12-06 17:40:32,520 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:32,521 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:32,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 74 treesize of output 58 [2021-12-06 17:40:32,527 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:32,527 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 65 treesize of output 69 [2021-12-06 17:40:32,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 21 treesize of output 17 [2021-12-06 17:40:32,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:32,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075481874] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:40:32,569 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:40:32,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 46 [2021-12-06 17:40:32,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054601148] [2021-12-06 17:40:32,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:40:32,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-06 17:40:32,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:32,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-06 17:40:32,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1444, Unknown=25, NotChecked=410, Total=2070 [2021-12-06 17:40:32,571 INFO L87 Difference]: Start difference. First operand 360 states and 420 transitions. Second operand has 46 states, 46 states have (on average 2.260869565217391) internal successors, (104), 46 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:32,688 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (<= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1)) (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((v_arrayElimArr_19 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_113| Int)) (or (and (forall ((v_ArrVal_1820 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_arrayElimArr_19) (select v_arrayElimArr_19 (+ |v_ULTIMATE.start_main_~x~0#1.offset_113| 4)) v_ArrVal_1820) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1821 (Array Int Int)) (v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1810 Int)) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1810)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1818) (select v_arrayElimArr_19 (+ |v_ULTIMATE.start_main_~x~0#1.offset_113| 4)) v_ArrVal_1821) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) (= (select v_arrayElimArr_19 (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_113|)) |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= |c_ULTIMATE.start_main_#t~malloc7#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2021-12-06 17:40:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:34,297 INFO L93 Difference]: Finished difference Result 445 states and 505 transitions. [2021-12-06 17:40:34,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-12-06 17:40:34,297 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.260869565217391) internal successors, (104), 46 states have internal predecessors, (104), 0 states have call successors, (0), 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 38 [2021-12-06 17:40:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:34,299 INFO L225 Difference]: With dead ends: 445 [2021-12-06 17:40:34,299 INFO L226 Difference]: Without dead ends: 445 [2021-12-06 17:40:34,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 1223 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=592, Invalid=3820, Unknown=34, NotChecked=810, Total=5256 [2021-12-06 17:40:34,300 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 393 mSDsluCounter, 1519 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 2810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1685 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:34,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [393 Valid, 1602 Invalid, 2810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1073 Invalid, 0 Unknown, 1685 Unchecked, 0.4s Time] [2021-12-06 17:40:34,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-12-06 17:40:34,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 350. [2021-12-06 17:40:34,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 329 states have (on average 1.2401215805471124) internal successors, (408), 349 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:34,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 408 transitions. [2021-12-06 17:40:34,304 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 408 transitions. Word has length 38 [2021-12-06 17:40:34,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:34,305 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 408 transitions. [2021-12-06 17:40:34,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.260869565217391) internal successors, (104), 46 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:34,305 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 408 transitions. [2021-12-06 17:40:34,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-06 17:40:34,305 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:34,305 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:34,325 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-06 17:40:34,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-12-06 17:40:34,506 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:40:34,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:34,507 INFO L85 PathProgramCache]: Analyzing trace with hash 342939421, now seen corresponding path program 1 times [2021-12-06 17:40:34,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:34,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016650771] [2021-12-06 17:40:34,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:34,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:34,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 17:40:34,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:34,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016650771] [2021-12-06 17:40:34,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016650771] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:40:34,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789513679] [2021-12-06 17:40:34,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:34,579 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:40:34,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:40:34,580 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:40:34,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-06 17:40:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:34,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-06 17:40:34,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:40:34,757 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2021-12-06 17:40:34,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 17:40:34,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:40:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 17:40:34,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789513679] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:40:34,860 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:40:34,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-06 17:40:34,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871846232] [2021-12-06 17:40:34,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:40:34,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:40:34,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:34,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:40:34,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:40:34,861 INFO L87 Difference]: Start difference. First operand 350 states and 408 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:34,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:34,965 INFO L93 Difference]: Finished difference Result 362 states and 419 transitions. [2021-12-06 17:40:34,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 17:40:34,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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 17:40:34,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:34,967 INFO L225 Difference]: With dead ends: 362 [2021-12-06 17:40:34,967 INFO L226 Difference]: Without dead ends: 332 [2021-12-06 17:40:34,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:40:34,968 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 30 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:34,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 295 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 180 Invalid, 0 Unknown, 58 Unchecked, 0.1s Time] [2021-12-06 17:40:34,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-12-06 17:40:34,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2021-12-06 17:40:34,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 311 states have (on average 1.247588424437299) internal successors, (388), 331 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 388 transitions. [2021-12-06 17:40:34,971 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 388 transitions. Word has length 39 [2021-12-06 17:40:34,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:34,971 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 388 transitions. [2021-12-06 17:40:34,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:34,972 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 388 transitions. [2021-12-06 17:40:34,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-06 17:40:34,972 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:34,972 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:34,993 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-06 17:40:35,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:40:35,173 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:40:35,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:35,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1235381073, now seen corresponding path program 1 times [2021-12-06 17:40:35,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:35,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340087359] [2021-12-06 17:40:35,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:35,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:35,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:35,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:35,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340087359] [2021-12-06 17:40:35,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340087359] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:40:35,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288705932] [2021-12-06 17:40:35,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:35,384 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:40:35,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:40:35,385 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:40:35,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-06 17:40:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:35,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-06 17:40:35,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:40:35,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:40:35,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:40:35,506 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:40:35,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:40:35,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:35,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 17:40:35,518 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 17:40:35,531 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 20 treesize of output 8 [2021-12-06 17:40:35,541 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 16 treesize of output 18 [2021-12-06 17:40:35,589 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:40:35,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:40:35,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:40:35,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:35,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:40:35,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-06 17:40:35,681 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 16 treesize of output 18 [2021-12-06 17:40:35,696 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 16 treesize of output 18 [2021-12-06 17:40:35,702 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 16 treesize of output 18 [2021-12-06 17:40:35,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:40:35,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:35,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:40:35,760 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1989) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 2)) is different from false [2021-12-06 17:40:35,770 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1989) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) is different from false [2021-12-06 17:40:35,773 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1989) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) is different from false [2021-12-06 17:40:35,783 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (v_ArrVal_1986 Int)) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1986)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1989) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) is different from false [2021-12-06 17:40:35,830 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_40| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_124| Int) (v_ArrVal_1986 Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_124|) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_124| v_ArrVal_1986)) |v_ULTIMATE.start_main_#t~malloc7#1.base_40| v_ArrVal_1989) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_40|) 0)))) is different from false [2021-12-06 17:40:35,863 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_40| Int) (v_ArrVal_1982 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_124| Int) (v_ArrVal_1986 Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_124|) (= 2 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1982))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_124| v_ArrVal_1986))) |v_ULTIMATE.start_main_#t~malloc7#1.base_40| v_ArrVal_1989) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_40|) 0)))) is different from false [2021-12-06 17:40:35,883 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_40| Int) (v_ArrVal_1982 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_124| Int) (v_ArrVal_1986 Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_124|) (= 2 (select (select (store (let ((.cse0 (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) v_ArrVal_1982))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_124| v_ArrVal_1986))) |v_ULTIMATE.start_main_#t~malloc7#1.base_40| v_ArrVal_1989) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_40|) 0)))) is different from false [2021-12-06 17:40:35,913 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-06 17:40:35,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-06 17:40:44,756 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:44,759 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:40:44,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 47 [2021-12-06 17:40:44,763 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:44,764 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 42 treesize of output 38 [2021-12-06 17:40:44,767 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:44,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:40:44,770 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:40:44,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-12-06 17:40:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:44,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288705932] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:40:44,790 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:40:44,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 35 [2021-12-06 17:40:44,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293938741] [2021-12-06 17:40:44,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:40:44,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-06 17:40:44,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:40:44,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-06 17:40:44,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=621, Unknown=32, NotChecked=406, Total=1190 [2021-12-06 17:40:44,791 INFO L87 Difference]: Start difference. First operand 332 states and 388 transitions. Second operand has 35 states, 35 states have (on average 2.4) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:49,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:40:49,806 INFO L93 Difference]: Finished difference Result 479 states and 551 transitions. [2021-12-06 17:40:49,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-06 17:40:49,806 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.4) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 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 17:40:49,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:40:49,808 INFO L225 Difference]: With dead ends: 479 [2021-12-06 17:40:49,808 INFO L226 Difference]: Without dead ends: 479 [2021-12-06 17:40:49,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=432, Invalid=1713, Unknown=45, NotChecked=672, Total=2862 [2021-12-06 17:40:49,809 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 549 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 2639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1560 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:40:49,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [549 Valid, 995 Invalid, 2639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1003 Invalid, 0 Unknown, 1560 Unchecked, 0.4s Time] [2021-12-06 17:40:49,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-12-06 17:40:49,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 337. [2021-12-06 17:40:49,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 316 states have (on average 1.2436708860759493) internal successors, (393), 336 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 393 transitions. [2021-12-06 17:40:49,814 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 393 transitions. Word has length 40 [2021-12-06 17:40:49,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:40:49,815 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 393 transitions. [2021-12-06 17:40:49,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.4) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:40:49,815 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 393 transitions. [2021-12-06 17:40:49,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-06 17:40:49,816 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:40:49,816 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:40:49,837 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-12-06 17:40:50,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-12-06 17:40:50,017 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:40:50,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:40:50,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1006409, now seen corresponding path program 1 times [2021-12-06 17:40:50,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:40:50,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333679329] [2021-12-06 17:40:50,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:50,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:40:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:50,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:50,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:40:50,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333679329] [2021-12-06 17:40:50,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333679329] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:40:50,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121205850] [2021-12-06 17:40:50,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:40:50,253 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:40:50,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:40:50,254 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:40:50,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-06 17:40:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:40:50,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-06 17:40:50,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:40:50,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:40:50,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:40:50,364 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:40:50,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:40:50,373 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 17:40:50,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:50,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 17:40:50,388 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 20 treesize of output 8 [2021-12-06 17:40:50,397 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 16 treesize of output 18 [2021-12-06 17:40:50,441 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:40:50,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:40:50,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:40:50,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:40:50,472 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 21 treesize of output 20 [2021-12-06 17:40:50,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-06 17:40:50,543 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 16 treesize of output 18 [2021-12-06 17:40:50,559 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 16 treesize of output 18 [2021-12-06 17:40:50,565 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 16 treesize of output 18 [2021-12-06 17:40:50,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:40:50,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:40:50,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:40:50,625 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2112 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2112) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 2)) is different from false [2021-12-06 17:40:50,636 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2112 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2112) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) is different from false [2021-12-06 17:40:50,640 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2112 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2112) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) is different from false [2021-12-06 17:40:50,647 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2112 (Array Int Int)) (v_ArrVal_2107 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_2107)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2112) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 2)) is different from false [2021-12-06 17:40:50,700 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_128| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_43| Int) (v_ArrVal_2112 (Array Int Int)) (v_ArrVal_2107 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_43|) 0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_128| v_ArrVal_2107)) |v_ULTIMATE.start_main_#t~malloc7#1.base_43| v_ArrVal_2112) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 2) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_128|))) is different from false [2021-12-06 17:40:50,743 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_128| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_43| Int) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2112 (Array Int Int)) (v_ArrVal_2107 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_43|) 0)) (= 2 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2105))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_128| v_ArrVal_2107))) |v_ULTIMATE.start_main_#t~malloc7#1.base_43| v_ArrVal_2112) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_128|))) is different from false [2021-12-06 17:40:50,769 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_128| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_43| Int) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2112 (Array Int Int)) (v_ArrVal_2107 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_43|) 0)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) v_ArrVal_2105))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_128| v_ArrVal_2107))) |v_ULTIMATE.start_main_#t~malloc7#1.base_43| v_ArrVal_2112) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 2) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_128|))) is different from false [2021-12-06 17:40:50,798 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-06 17:40:50,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-06 17:41:00,891 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:00,894 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:00,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 47 [2021-12-06 17:41:00,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:00,898 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 42 treesize of output 38 [2021-12-06 17:41:00,900 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:00,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:41:00,902 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:00,903 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 21 treesize of output 13 [2021-12-06 17:41:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:00,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121205850] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:41:00,921 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:41:00,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 35 [2021-12-06 17:41:00,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427083961] [2021-12-06 17:41:00,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:41:00,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-06 17:41:00,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:00,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-06 17:41:00,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=621, Unknown=32, NotChecked=406, Total=1190 [2021-12-06 17:41:00,923 INFO L87 Difference]: Start difference. First operand 337 states and 393 transitions. Second operand has 35 states, 35 states have (on average 2.4) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:04,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:04,843 INFO L93 Difference]: Finished difference Result 480 states and 551 transitions. [2021-12-06 17:41:04,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-06 17:41:04,843 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.4) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 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 17:41:04,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:04,845 INFO L225 Difference]: With dead ends: 480 [2021-12-06 17:41:04,845 INFO L226 Difference]: Without dead ends: 480 [2021-12-06 17:41:04,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=411, Invalid=1643, Unknown=44, NotChecked=658, Total=2756 [2021-12-06 17:41:04,846 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 577 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 2220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1391 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:04,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [577 Valid, 815 Invalid, 2220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 745 Invalid, 0 Unknown, 1391 Unchecked, 0.3s Time] [2021-12-06 17:41:04,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-12-06 17:41:04,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 332. [2021-12-06 17:41:04,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 311 states have (on average 1.2443729903536977) internal successors, (387), 331 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 387 transitions. [2021-12-06 17:41:04,850 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 387 transitions. Word has length 40 [2021-12-06 17:41:04,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:04,850 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 387 transitions. [2021-12-06 17:41:04,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.4) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:04,850 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 387 transitions. [2021-12-06 17:41:04,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-06 17:41:04,851 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:04,851 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:41:04,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-12-06 17:41:05,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-12-06 17:41:05,052 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:41:05,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:05,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1860360063, now seen corresponding path program 1 times [2021-12-06 17:41:05,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:05,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27503571] [2021-12-06 17:41:05,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:05,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:05,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:05,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:05,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27503571] [2021-12-06 17:41:05,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27503571] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:41:05,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272119592] [2021-12-06 17:41:05,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:05,298 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:05,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:41:05,299 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:41:05,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-06 17:41:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:05,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 55 conjunts are in the unsatisfiable core [2021-12-06 17:41:05,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:41:05,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:41:05,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:41:05,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:41:05,450 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:41:05,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:41:05,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:41:05,470 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 21 treesize of output 20 [2021-12-06 17:41:05,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:41:05,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:41:05,590 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:41:05,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:41:05,594 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 17:41:05,605 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:41:05,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:41:05,671 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:41:05,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:41:05,682 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:41:05,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:41:05,687 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 17:41:05,730 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:41:05,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:41:05,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:41:05,779 INFO L354 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2021-12-06 17:41:05,779 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 2 case distinctions, treesize of input 38 treesize of output 36 [2021-12-06 17:41:05,787 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 16 treesize of output 18 [2021-12-06 17:41:05,908 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-06 17:41:05,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 63 [2021-12-06 17:41:05,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-06 17:41:05,916 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 20 treesize of output 12 [2021-12-06 17:41:06,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 17:41:06,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:41:06,074 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:06,074 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 27 treesize of output 11 [2021-12-06 17:41:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:06,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:41:06,149 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2238 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2238) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_2237 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2237) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-06 17:41:06,154 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2237 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) v_ArrVal_2237) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_2238 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) v_ArrVal_2238) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) is different from false [2021-12-06 17:41:06,163 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_2237 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4) |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_2237) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_2238 (Array Int Int)) (v_ArrVal_2235 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2235) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_2238) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-06 17:41:06,179 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_26| Int)) (or (and (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_2237 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4) |v_ULTIMATE.start_main_#t~malloc10#1.base_26|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_26| v_ArrVal_2237) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_2238 (Array Int Int)) (v_ArrVal_2235 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2235) |v_ULTIMATE.start_main_#t~malloc10#1.base_26| v_ArrVal_2238) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_26|) 0)))) is different from false [2021-12-06 17:41:06,188 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:06,189 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 1 case distinctions, treesize of input 36 treesize of output 40 [2021-12-06 17:41:06,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 30 treesize of output 22 [2021-12-06 17:41:06,246 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 30 treesize of output 22 [2021-12-06 17:41:06,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-12-06 17:41:06,275 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 30 treesize of output 22 [2021-12-06 17:41:06,287 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 30 treesize of output 22 [2021-12-06 17:41:06,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2021-12-06 17:41:06,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2021-12-06 17:41:06,403 INFO L354 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2021-12-06 17:41:06,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2021-12-06 17:41:06,417 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:41:06,417 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 35 treesize of output 31 [2021-12-06 17:41:06,428 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_24 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_133| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.base| (select v_arrayElimArr_24 (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_133|))) (and (forall ((v_ArrVal_2238 (Array Int Int)) (v_ArrVal_2235 (Array Int Int)) (v_ArrVal_2228 Int)) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_2228)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2235) (select v_arrayElimArr_24 (+ |v_ULTIMATE.start_main_~x~0#1.offset_133| 4)) v_ArrVal_2238) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_2237 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_arrayElimArr_24) (select v_arrayElimArr_24 (+ |v_ULTIMATE.start_main_~x~0#1.offset_133| 4)) v_ArrVal_2237) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|))))) is different from false [2021-12-06 17:41:06,443 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:41:06,443 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 35 treesize of output 31 [2021-12-06 17:41:06,484 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:41:06,485 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 35 treesize of output 31 [2021-12-06 17:41:06,509 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:41:06,509 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 35 treesize of output 31 [2021-12-06 17:41:06,601 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:41:06,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2021-12-06 17:41:06,651 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:41:06,651 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 35 treesize of output 31 [2021-12-06 17:41:06,677 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:41:06,677 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 35 treesize of output 31 [2021-12-06 17:41:06,707 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:41:06,707 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 35 treesize of output 31 [2021-12-06 17:41:06,755 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-12-06 17:41:06,755 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 35 treesize of output 31 [2021-12-06 17:41:06,875 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:06,878 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:06,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 71 [2021-12-06 17:41:06,881 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:06,882 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:06,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 78 treesize of output 62 [2021-12-06 17:41:06,886 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:06,891 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:06,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 67 [2021-12-06 17:41:06,894 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:06,895 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:06,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 74 treesize of output 58 [2021-12-06 17:41:06,902 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:06,902 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 65 treesize of output 69 [2021-12-06 17:41:06,907 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 21 treesize of output 17 [2021-12-06 17:41:06,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:06,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272119592] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:41:06,941 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:41:06,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 38 [2021-12-06 17:41:06,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775362580] [2021-12-06 17:41:06,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:41:06,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-06 17:41:06,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:06,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-06 17:41:06,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=879, Unknown=25, NotChecked=330, Total=1406 [2021-12-06 17:41:06,943 INFO L87 Difference]: Start difference. First operand 332 states and 387 transitions. Second operand has 38 states, 38 states have (on average 2.710526315789474) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:08,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:08,649 INFO L93 Difference]: Finished difference Result 363 states and 417 transitions. [2021-12-06 17:41:08,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 17:41:08,650 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.710526315789474) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-06 17:41:08,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:08,651 INFO L225 Difference]: With dead ends: 363 [2021-12-06 17:41:08,651 INFO L226 Difference]: Without dead ends: 363 [2021-12-06 17:41:08,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 5 IntricatePredicates, 4 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=334, Invalid=1636, Unknown=30, NotChecked=450, Total=2450 [2021-12-06 17:41:08,652 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 222 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1127 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:08,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 1068 Invalid, 1572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 410 Invalid, 0 Unknown, 1127 Unchecked, 0.2s Time] [2021-12-06 17:41:08,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-12-06 17:41:08,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 325. [2021-12-06 17:41:08,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 304 states have (on average 1.243421052631579) internal successors, (378), 324 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:08,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 378 transitions. [2021-12-06 17:41:08,655 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 378 transitions. Word has length 40 [2021-12-06 17:41:08,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:08,655 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 378 transitions. [2021-12-06 17:41:08,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.710526315789474) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:08,656 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 378 transitions. [2021-12-06 17:41:08,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-06 17:41:08,656 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:08,656 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:41:08,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-12-06 17:41:08,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-12-06 17:41:08,857 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:41:08,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:08,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1671753086, now seen corresponding path program 1 times [2021-12-06 17:41:08,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:08,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951682886] [2021-12-06 17:41:08,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:08,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:08,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:08,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951682886] [2021-12-06 17:41:08,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951682886] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:41:08,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328123844] [2021-12-06 17:41:08,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:08,981 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:08,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:41:08,982 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:41:08,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-06 17:41:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:09,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-06 17:41:09,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:41:09,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:41:09,144 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-06 17:41:09,144 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 17:41:09,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:41:09,233 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:41:09,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:41:09,262 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:41:09,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:41:09,274 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:41:09,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-06 17:41:09,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:09,372 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-06 17:41:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:09,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:41:09,628 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:09,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2021-12-06 17:41:09,633 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:09,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2021-12-06 17:41:09,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-06 17:41:10,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:10,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328123844] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:41:10,379 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:41:10,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-12-06 17:41:10,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514553353] [2021-12-06 17:41:10,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:41:10,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-06 17:41:10,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:10,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-06 17:41:10,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=732, Unknown=10, NotChecked=0, Total=870 [2021-12-06 17:41:10,380 INFO L87 Difference]: Start difference. First operand 325 states and 378 transitions. Second operand has 30 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 30 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:10,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:10,939 INFO L93 Difference]: Finished difference Result 455 states and 532 transitions. [2021-12-06 17:41:10,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-06 17:41:10,939 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 30 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-06 17:41:10,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:10,941 INFO L225 Difference]: With dead ends: 455 [2021-12-06 17:41:10,941 INFO L226 Difference]: Without dead ends: 455 [2021-12-06 17:41:10,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=380, Invalid=1680, Unknown=10, NotChecked=0, Total=2070 [2021-12-06 17:41:10,942 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 541 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 820 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:10,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [541 Valid, 1165 Invalid, 1671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 736 Invalid, 0 Unknown, 820 Unchecked, 0.3s Time] [2021-12-06 17:41:10,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2021-12-06 17:41:10,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 368. [2021-12-06 17:41:10,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 347 states have (on average 1.2363112391930835) internal successors, (429), 367 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:10,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 429 transitions. [2021-12-06 17:41:10,946 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 429 transitions. Word has length 40 [2021-12-06 17:41:10,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:10,946 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 429 transitions. [2021-12-06 17:41:10,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 30 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:10,946 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 429 transitions. [2021-12-06 17:41:10,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-06 17:41:10,946 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:10,947 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:41:10,966 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-12-06 17:41:11,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:11,148 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:41:11,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:11,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1671753085, now seen corresponding path program 1 times [2021-12-06 17:41:11,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:11,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518508946] [2021-12-06 17:41:11,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:11,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:11,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:11,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:11,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518508946] [2021-12-06 17:41:11,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518508946] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:41:11,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464799382] [2021-12-06 17:41:11,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:11,307 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:11,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:41:11,308 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:41:11,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-06 17:41:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:11,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-06 17:41:11,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:41:11,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:41:11,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:41:11,467 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:41:11,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:41:11,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:41:11,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:41:11,575 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:41:11,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-06 17:41:11,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 5 treesize of output 3 [2021-12-06 17:41:11,587 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:41:11,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:41:11,632 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:41:11,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:41:11,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:41:11,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-06 17:41:11,653 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:41:11,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-06 17:41:11,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-06 17:41:11,786 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:11,787 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:41:11,789 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:11,790 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:11,790 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 25 treesize of output 16 [2021-12-06 17:41:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:11,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:41:12,399 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:12,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2021-12-06 17:41:12,402 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:12,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 51 [2021-12-06 17:41:12,408 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:12,408 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 74 treesize of output 77 [2021-12-06 17:41:12,414 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:12,414 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 125 treesize of output 120 [2021-12-06 17:41:12,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2021-12-06 17:41:12,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2021-12-06 17:41:12,423 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 81 treesize of output 79 [2021-12-06 17:41:12,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:12,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464799382] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:41:12,764 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:41:12,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-12-06 17:41:12,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123894467] [2021-12-06 17:41:12,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:41:12,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-06 17:41:12,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:12,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-06 17:41:12,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=888, Unknown=8, NotChecked=0, Total=992 [2021-12-06 17:41:12,765 INFO L87 Difference]: Start difference. First operand 368 states and 429 transitions. Second operand has 32 states, 31 states have (on average 3.806451612903226) internal successors, (118), 32 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:13,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:13,865 INFO L93 Difference]: Finished difference Result 517 states and 584 transitions. [2021-12-06 17:41:13,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 17:41:13,866 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.806451612903226) internal successors, (118), 32 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-06 17:41:13,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:13,868 INFO L225 Difference]: With dead ends: 517 [2021-12-06 17:41:13,868 INFO L226 Difference]: Without dead ends: 517 [2021-12-06 17:41:13,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=378, Invalid=2064, Unknown=8, NotChecked=0, Total=2450 [2021-12-06 17:41:13,868 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 724 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 1638 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 555 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:13,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [724 Valid, 1438 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1638 Invalid, 0 Unknown, 555 Unchecked, 0.6s Time] [2021-12-06 17:41:13,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2021-12-06 17:41:13,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 393. [2021-12-06 17:41:13,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 372 states have (on average 1.2338709677419355) internal successors, (459), 392 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:13,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 459 transitions. [2021-12-06 17:41:13,873 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 459 transitions. Word has length 40 [2021-12-06 17:41:13,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:13,876 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 459 transitions. [2021-12-06 17:41:13,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.806451612903226) internal successors, (118), 32 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:13,876 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 459 transitions. [2021-12-06 17:41:13,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-06 17:41:13,876 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:13,876 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:41:13,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-12-06 17:41:14,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:14,078 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:41:14,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:14,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1405293141, now seen corresponding path program 1 times [2021-12-06 17:41:14,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:14,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293074784] [2021-12-06 17:41:14,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:14,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:14,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:14,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:14,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293074784] [2021-12-06 17:41:14,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293074784] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:41:14,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:41:14,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 17:41:14,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111073666] [2021-12-06 17:41:14,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:14,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 17:41:14,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:14,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 17:41:14,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:41:14,194 INFO L87 Difference]: Start difference. First operand 393 states and 459 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:14,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:14,424 INFO L93 Difference]: Finished difference Result 413 states and 478 transitions. [2021-12-06 17:41:14,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 17:41:14,425 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 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 17:41:14,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:14,426 INFO L225 Difference]: With dead ends: 413 [2021-12-06 17:41:14,426 INFO L226 Difference]: Without dead ends: 408 [2021-12-06 17:41:14,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2021-12-06 17:41:14,427 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 177 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:14,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 366 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:41:14,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-12-06 17:41:14,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 384. [2021-12-06 17:41:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 363 states have (on average 1.2369146005509641) internal successors, (449), 383 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:14,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 449 transitions. [2021-12-06 17:41:14,431 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 449 transitions. Word has length 42 [2021-12-06 17:41:14,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:14,431 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 449 transitions. [2021-12-06 17:41:14,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:14,431 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 449 transitions. [2021-12-06 17:41:14,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-06 17:41:14,432 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:14,432 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:41:14,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-12-06 17:41:14,432 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:41:14,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:14,432 INFO L85 PathProgramCache]: Analyzing trace with hash 545888581, now seen corresponding path program 1 times [2021-12-06 17:41:14,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:14,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617858911] [2021-12-06 17:41:14,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:14,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:14,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:14,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617858911] [2021-12-06 17:41:14,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617858911] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:41:14,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292468415] [2021-12-06 17:41:14,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:14,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:14,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:41:14,513 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:41:14,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-06 17:41:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:14,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-06 17:41:14,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:41:14,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:41:14,624 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:41:14,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:41:14,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 17:41:14,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:41:14,640 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 20 treesize of output 8 [2021-12-06 17:41:14,645 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 16 treesize of output 18 [2021-12-06 17:41:14,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:41:14,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:14,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:41:14,972 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2532 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_147| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_147| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_147|) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2532) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_147|)) 0))) is different from false [2021-12-06 17:41:14,981 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2532 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_147| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_147| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_147|) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) v_ArrVal_2532) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_147|)) 0))) is different from false [2021-12-06 17:41:14,994 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:14,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-06 17:41:14,999 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:14,999 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 36 treesize of output 36 [2021-12-06 17:41:15,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:41:15,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:15,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292468415] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-06 17:41:15,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:41:15,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11, 10] total 22 [2021-12-06 17:41:15,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591432872] [2021-12-06 17:41:15,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:15,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 17:41:15,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:15,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 17:41:15,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=342, Unknown=2, NotChecked=78, Total=506 [2021-12-06 17:41:15,094 INFO L87 Difference]: Start difference. First operand 384 states and 449 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:15,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:15,213 INFO L93 Difference]: Finished difference Result 407 states and 472 transitions. [2021-12-06 17:41:15,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 17:41:15,213 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 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 17:41:15,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:15,215 INFO L225 Difference]: With dead ends: 407 [2021-12-06 17:41:15,215 INFO L226 Difference]: Without dead ends: 407 [2021-12-06 17:41:15,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=502, Unknown=4, NotChecked=94, Total=702 [2021-12-06 17:41:15,215 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 38 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 286 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:15,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 594 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 286 Unchecked, 0.1s Time] [2021-12-06 17:41:15,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-12-06 17:41:15,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 384. [2021-12-06 17:41:15,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 363 states have (on average 1.2369146005509641) internal successors, (449), 383 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 449 transitions. [2021-12-06 17:41:15,219 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 449 transitions. Word has length 42 [2021-12-06 17:41:15,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:15,219 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 449 transitions. [2021-12-06 17:41:15,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 449 transitions. [2021-12-06 17:41:15,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-06 17:41:15,220 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:15,220 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:41:15,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2021-12-06 17:41:15,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2021-12-06 17:41:15,421 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:41:15,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:15,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1248860378, now seen corresponding path program 1 times [2021-12-06 17:41:15,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:15,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392576044] [2021-12-06 17:41:15,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:15,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:15,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:15,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392576044] [2021-12-06 17:41:15,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392576044] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:41:15,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813335672] [2021-12-06 17:41:15,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:15,694 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:15,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:41:15,695 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:41:15,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-06 17:41:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:15,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-06 17:41:15,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:41:15,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:41:15,825 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-06 17:41:15,825 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 17:41:15,846 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 17:41:15,872 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:41:15,873 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 17:41:15,928 INFO L354 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2021-12-06 17:41:15,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2021-12-06 17:41:15,971 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-06 17:41:15,971 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 43 treesize of output 36 [2021-12-06 17:41:16,224 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:41:16,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 41 [2021-12-06 17:41:16,400 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:41:16,400 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 45 treesize of output 41 [2021-12-06 17:41:16,477 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-06 17:41:16,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-06 17:41:16,598 INFO L354 Elim1Store]: treesize reduction 72, result has 19.1 percent of original size [2021-12-06 17:41:16,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 46 [2021-12-06 17:41:16,993 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-06 17:41:16,993 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 89 [2021-12-06 17:41:16,998 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 37 treesize of output 21 [2021-12-06 17:41:17,814 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:17,814 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 44 treesize of output 32 [2021-12-06 17:41:17,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:17,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:41:18,159 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:18,160 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 1 case distinctions, treesize of input 25 treesize of output 29 [2021-12-06 17:41:18,882 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:18,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 56 [2021-12-06 17:41:18,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:18,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:18,886 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 66 treesize of output 62 [2021-12-06 17:41:18,889 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 83 treesize of output 67 [2021-12-06 17:41:18,892 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 44 treesize of output 40 [2021-12-06 17:41:18,896 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 54 treesize of output 46 [2021-12-06 17:41:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:19,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813335672] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:41:19,228 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:41:19,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 18] total 44 [2021-12-06 17:41:19,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139788360] [2021-12-06 17:41:19,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:41:19,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-06 17:41:19,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:19,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-06 17:41:19,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1697, Unknown=42, NotChecked=0, Total=1980 [2021-12-06 17:41:19,229 INFO L87 Difference]: Start difference. First operand 384 states and 449 transitions. Second operand has 45 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 45 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:20,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:20,131 INFO L93 Difference]: Finished difference Result 586 states and 683 transitions. [2021-12-06 17:41:20,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-06 17:41:20,132 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 45 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-06 17:41:20,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:20,134 INFO L225 Difference]: With dead ends: 586 [2021-12-06 17:41:20,134 INFO L226 Difference]: Without dead ends: 586 [2021-12-06 17:41:20,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=477, Invalid=3015, Unknown=48, NotChecked=0, Total=3540 [2021-12-06 17:41:20,134 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 226 mSDsluCounter, 2081 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 2203 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1409 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:20,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 2203 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 522 Invalid, 0 Unknown, 1409 Unchecked, 0.2s Time] [2021-12-06 17:41:20,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2021-12-06 17:41:20,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 407. [2021-12-06 17:41:20,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 386 states have (on average 1.2279792746113989) internal successors, (474), 406 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:20,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 474 transitions. [2021-12-06 17:41:20,139 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 474 transitions. Word has length 42 [2021-12-06 17:41:20,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:20,139 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 474 transitions. [2021-12-06 17:41:20,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 45 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:20,140 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 474 transitions. [2021-12-06 17:41:20,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-06 17:41:20,140 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:20,140 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:41:20,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2021-12-06 17:41:20,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-12-06 17:41:20,341 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:41:20,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:20,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1248860377, now seen corresponding path program 1 times [2021-12-06 17:41:20,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:20,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858815647] [2021-12-06 17:41:20,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:20,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:20,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:20,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:20,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858815647] [2021-12-06 17:41:20,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858815647] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:41:20,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268515396] [2021-12-06 17:41:20,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:20,633 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:20,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:41:20,634 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:41:20,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-12-06 17:41:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:20,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 76 conjunts are in the unsatisfiable core [2021-12-06 17:41:20,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:41:20,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:41:20,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:41:20,771 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-06 17:41:20,771 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 17:41:20,802 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 17:41:20,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:41:20,883 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:41:20,883 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 57 treesize of output 54 [2021-12-06 17:41:20,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-06 17:41:20,968 INFO L354 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2021-12-06 17:41:20,968 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 1 case distinctions, treesize of input 18 treesize of output 30 [2021-12-06 17:41:20,991 INFO L354 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2021-12-06 17:41:20,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2021-12-06 17:41:21,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:41:21,065 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 54 treesize of output 35 [2021-12-06 17:41:21,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:41:21,077 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 21 treesize of output 20 [2021-12-06 17:41:21,301 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:41:21,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:41:21,304 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 17:41:21,313 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:41:21,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 65 [2021-12-06 17:41:21,422 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:41:21,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:41:21,425 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 17:41:21,434 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:41:21,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 65 [2021-12-06 17:41:21,505 INFO L354 Elim1Store]: treesize reduction 12, result has 65.7 percent of original size [2021-12-06 17:41:21,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 35 [2021-12-06 17:41:21,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 20 [2021-12-06 17:41:21,578 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:41:21,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:41:21,580 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 17:41:21,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:41:21,595 INFO L354 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2021-12-06 17:41:21,595 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 2 case distinctions, treesize of input 82 treesize of output 54 [2021-12-06 17:41:21,788 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 17:41:21,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 101 [2021-12-06 17:41:21,792 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 26 treesize of output 28 [2021-12-06 17:41:22,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:41:22,208 INFO L354 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2021-12-06 17:41:22,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 36 [2021-12-06 17:41:22,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:41:22,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:22,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:41:22,353 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2818 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2818) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_2819 (Array Int Int)) (v_ArrVal_2818 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2818) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2819) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))))) is different from false [2021-12-06 17:41:22,360 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2818 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) v_ArrVal_2818) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_2819 (Array Int Int)) (v_ArrVal_2818 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2818) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2819) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) is different from false [2021-12-06 17:41:22,371 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2818 (Array Int Int)) (v_ArrVal_2816 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2816) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_2818) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_2819 (Array Int Int)) (v_ArrVal_2818 (Array Int Int)) (v_ArrVal_2816 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2816) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_2818) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4) |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_2819) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))))) is different from false [2021-12-06 17:41:22,449 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:22,449 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 1 case distinctions, treesize of input 55 treesize of output 59 [2021-12-06 17:41:22,459 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 30 treesize of output 22 [2021-12-06 17:41:22,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-12-06 17:41:22,562 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 30 treesize of output 22 [2021-12-06 17:41:22,580 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 30 treesize of output 22 [2021-12-06 17:41:22,592 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 30 treesize of output 22 [2021-12-06 17:41:22,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2021-12-06 17:41:22,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2021-12-06 17:41:22,802 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 38 treesize of output 30 [2021-12-06 17:41:22,930 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 41 treesize of output 33 [2021-12-06 17:41:22,949 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 41 treesize of output 33 [2021-12-06 17:41:22,968 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 41 treesize of output 33 [2021-12-06 17:41:23,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2021-12-06 17:41:23,196 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 41 treesize of output 33 [2021-12-06 17:41:23,247 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 41 treesize of output 33 [2021-12-06 17:41:23,297 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 41 treesize of output 33 [2021-12-06 17:41:23,331 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 41 treesize of output 33 [2021-12-06 17:41:23,349 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 41 treesize of output 33 [2021-12-06 17:41:23,570 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 41 treesize of output 33 [2021-12-06 17:41:23,616 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 41 treesize of output 33 [2021-12-06 17:41:23,660 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 41 treesize of output 33 [2021-12-06 17:41:23,687 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 41 treesize of output 33 [2021-12-06 17:41:23,806 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 47 treesize of output 39 [2021-12-06 17:41:23,857 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 47 treesize of output 39 [2021-12-06 17:41:23,874 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 47 treesize of output 39 [2021-12-06 17:41:23,934 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 47 treesize of output 39 [2021-12-06 17:41:23,989 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 47 treesize of output 39 [2021-12-06 17:41:24,006 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 47 treesize of output 39 [2021-12-06 17:41:24,120 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 47 treesize of output 39 [2021-12-06 17:41:24,298 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 59 treesize of output 51 [2021-12-06 17:41:24,346 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 59 treesize of output 51 [2021-12-06 17:41:24,360 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 59 treesize of output 51 [2021-12-06 17:41:24,407 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 59 treesize of output 51 [2021-12-06 17:41:26,648 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 59 treesize of output 51 [2021-12-06 17:41:26,696 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 59 treesize of output 51 [2021-12-06 17:41:26,713 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 59 treesize of output 51 [2021-12-06 17:41:26,761 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 59 treesize of output 51 [2021-12-06 17:41:26,886 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:26,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 142 [2021-12-06 17:41:26,892 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:26,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 132 [2021-12-06 17:41:26,895 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:26,895 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:26,897 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 175 treesize of output 171 [2021-12-06 17:41:26,902 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:26,902 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:26,905 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 210 treesize of output 202 [2021-12-06 17:41:26,909 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 215 treesize of output 195 [2021-12-06 17:41:26,912 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:26,914 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 186 treesize of output 170 [2021-12-06 17:41:26,916 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:26,918 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 164 treesize of output 152 [2021-12-06 17:41:26,922 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:26,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 120 [2021-12-06 17:41:26,926 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:26,927 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 114 treesize of output 106 [2021-12-06 17:41:26,930 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:26,931 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 103 treesize of output 99 [2021-12-06 17:41:27,060 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:27,061 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:41:27,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:27,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268515396] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:41:27,178 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:41:27,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 18] total 49 [2021-12-06 17:41:27,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815588604] [2021-12-06 17:41:27,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:41:27,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-06 17:41:27,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:27,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-06 17:41:27,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1887, Unknown=60, NotChecked=276, Total=2450 [2021-12-06 17:41:27,179 INFO L87 Difference]: Start difference. First operand 407 states and 474 transitions. Second operand has 50 states, 49 states have (on average 2.4693877551020407) internal successors, (121), 50 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:34,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:34,993 INFO L93 Difference]: Finished difference Result 444 states and 517 transitions. [2021-12-06 17:41:34,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-06 17:41:34,993 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.4693877551020407) internal successors, (121), 50 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-06 17:41:34,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:34,995 INFO L225 Difference]: With dead ends: 444 [2021-12-06 17:41:34,995 INFO L226 Difference]: Without dead ends: 444 [2021-12-06 17:41:34,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=441, Invalid=3539, Unknown=64, NotChecked=378, Total=4422 [2021-12-06 17:41:34,995 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 193 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1769 SdHoareTripleChecker+Invalid, 1664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1088 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:34,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 1769 Invalid, 1664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 563 Invalid, 0 Unknown, 1088 Unchecked, 0.3s Time] [2021-12-06 17:41:34,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-12-06 17:41:34,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 418. [2021-12-06 17:41:34,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 397 states have (on average 1.2267002518891688) internal successors, (487), 417 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:35,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 487 transitions. [2021-12-06 17:41:35,000 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 487 transitions. Word has length 42 [2021-12-06 17:41:35,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:35,000 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 487 transitions. [2021-12-06 17:41:35,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.4693877551020407) internal successors, (121), 50 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:35,000 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 487 transitions. [2021-12-06 17:41:35,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-06 17:41:35,000 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:35,001 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:41:35,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-12-06 17:41:35,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:35,202 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:41:35,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:35,203 INFO L85 PathProgramCache]: Analyzing trace with hash -257322934, now seen corresponding path program 1 times [2021-12-06 17:41:35,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:35,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614166923] [2021-12-06 17:41:35,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:35,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:35,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:35,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:35,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614166923] [2021-12-06 17:41:35,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614166923] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:41:35,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326325061] [2021-12-06 17:41:35,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:35,320 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:35,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:41:35,321 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:41:35,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-12-06 17:41:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:35,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-06 17:41:35,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:41:35,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:41:35,451 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:41:35,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:41:35,463 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 17:41:35,502 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:41:35,502 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 17:41:35,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-06 17:41:35,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:35,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:41:36,046 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2879 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_166| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_166|) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2879) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_166|)) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_main_~x~0#1.offset_166| 0))) is different from false [2021-12-06 17:41:36,055 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2879 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_166| Int)) (or (<= (+ (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) v_ArrVal_2879) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_166|)) 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_166|) (< |v_ULTIMATE.start_main_~x~0#1.offset_166| 0))) is different from false [2021-12-06 17:41:36,069 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:36,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2021-12-06 17:41:36,074 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:36,074 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 40 treesize of output 40 [2021-12-06 17:41:36,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:41:36,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:36,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326325061] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-06 17:41:36,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:41:36,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10, 10] total 24 [2021-12-06 17:41:36,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562634109] [2021-12-06 17:41:36,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:36,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 17:41:36,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:36,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 17:41:36,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=405, Unknown=2, NotChecked=86, Total=600 [2021-12-06 17:41:36,203 INFO L87 Difference]: Start difference. First operand 418 states and 487 transitions. Second operand has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:36,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:36,364 INFO L93 Difference]: Finished difference Result 440 states and 509 transitions. [2021-12-06 17:41:36,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 17:41:36,365 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2021-12-06 17:41:36,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:36,366 INFO L225 Difference]: With dead ends: 440 [2021-12-06 17:41:36,366 INFO L226 Difference]: Without dead ends: 440 [2021-12-06 17:41:36,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=579, Unknown=4, NotChecked=102, Total=812 [2021-12-06 17:41:36,367 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 29 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 282 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:36,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 555 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 185 Invalid, 0 Unknown, 282 Unchecked, 0.1s Time] [2021-12-06 17:41:36,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-12-06 17:41:36,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 427. [2021-12-06 17:41:36,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 406 states have (on average 1.2241379310344827) internal successors, (497), 426 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 497 transitions. [2021-12-06 17:41:36,371 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 497 transitions. Word has length 43 [2021-12-06 17:41:36,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:36,371 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 497 transitions. [2021-12-06 17:41:36,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 497 transitions. [2021-12-06 17:41:36,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-06 17:41:36,372 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:36,372 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:41:36,391 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2021-12-06 17:41:36,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:36,573 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:41:36,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:36,574 INFO L85 PathProgramCache]: Analyzing trace with hash 612923879, now seen corresponding path program 1 times [2021-12-06 17:41:36,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:36,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398422270] [2021-12-06 17:41:36,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:36,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:36,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:36,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:36,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398422270] [2021-12-06 17:41:36,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398422270] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:41:36,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912797892] [2021-12-06 17:41:36,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:36,692 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:36,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:41:36,693 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:41:36,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-12-06 17:41:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:36,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-06 17:41:36,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:41:36,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:41:36,824 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-06 17:41:36,824 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 17:41:36,840 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 17:41:36,893 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:41:36,893 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 17:41:37,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-06 17:41:37,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:37,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:41:37,458 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:37,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2021-12-06 17:41:37,464 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:41:37,464 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 40 treesize of output 40 [2021-12-06 17:41:37,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:41:37,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:37,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912797892] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-06 17:41:37,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:41:37,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11, 9] total 26 [2021-12-06 17:41:37,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567311191] [2021-12-06 17:41:37,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:37,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 17:41:37,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:37,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 17:41:37,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=565, Unknown=8, NotChecked=0, Total=702 [2021-12-06 17:41:37,848 INFO L87 Difference]: Start difference. First operand 427 states and 497 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:37,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:37,950 INFO L93 Difference]: Finished difference Result 441 states and 513 transitions. [2021-12-06 17:41:37,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 17:41:37,950 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2021-12-06 17:41:37,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:37,952 INFO L225 Difference]: With dead ends: 441 [2021-12-06 17:41:37,952 INFO L226 Difference]: Without dead ends: 441 [2021-12-06 17:41:37,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=718, Unknown=8, NotChecked=0, Total=870 [2021-12-06 17:41:37,952 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 34 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 299 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:37,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 507 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 138 Invalid, 0 Unknown, 299 Unchecked, 0.1s Time] [2021-12-06 17:41:37,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2021-12-06 17:41:37,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 428. [2021-12-06 17:41:37,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 407 states have (on average 1.2235872235872236) internal successors, (498), 427 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:37,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 498 transitions. [2021-12-06 17:41:37,957 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 498 transitions. Word has length 44 [2021-12-06 17:41:37,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:37,957 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 498 transitions. [2021-12-06 17:41:37,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:41:37,957 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 498 transitions. [2021-12-06 17:41:37,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-06 17:41:37,958 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:37,958 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:41:37,978 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2021-12-06 17:41:38,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-12-06 17:41:38,159 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:41:38,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:38,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1227235639, now seen corresponding path program 1 times [2021-12-06 17:41:38,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:38,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074214551] [2021-12-06 17:41:38,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:38,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:38,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:38,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074214551] [2021-12-06 17:41:38,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074214551] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:41:38,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104242737] [2021-12-06 17:41:38,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:38,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:38,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:41:38,394 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:41:38,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-12-06 17:41:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:38,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-06 17:41:38,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:41:38,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:41:38,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:41:38,525 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:41:38,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:41:38,534 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 17:41:38,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:41:38,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 17:41:38,549 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 20 treesize of output 8 [2021-12-06 17:41:38,558 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 16 treesize of output 18 [2021-12-06 17:41:38,609 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:41:38,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:41:38,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:41:38,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:41:38,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:41:38,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-06 17:41:38,726 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 16 treesize of output 18 [2021-12-06 17:41:38,743 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 16 treesize of output 18 [2021-12-06 17:41:38,756 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:41:38,756 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 17:41:38,782 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 17:41:38,787 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 16 treesize of output 18 [2021-12-06 17:41:38,815 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 17:41:38,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 17:41:38,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:41:38,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:38,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:41:38,903 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3082 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_3082) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) is different from false [2021-12-06 17:41:38,907 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3082 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) v_ArrVal_3082) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) is different from false [2021-12-06 17:41:38,912 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3079 (Array Int Int)) (v_ArrVal_3082 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3079) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_3082) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) is different from false [2021-12-06 17:41:39,077 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-06 17:41:39,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-06 17:41:39,083 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3079 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_40| Int) (v_ArrVal_3082 (Array Int Int)) (v_ArrVal_3075 Int)) (or (= 2 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3075)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_3079) |v_ULTIMATE.start_main_#t~malloc10#1.base_40| v_ArrVal_3082) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_40| |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2021-12-06 17:41:39,190 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_64| Int) (v_ArrVal_3079 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_40| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_179| Int) (v_ArrVal_3082 (Array Int Int)) (v_ArrVal_3075 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_64|) 0)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_179|) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_40| |c_ULTIMATE.start_main_~head~0#1.base|) (= 2 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_179| v_ArrVal_3075)) |v_ULTIMATE.start_main_#t~malloc7#1.base_64| v_ArrVal_3079) |v_ULTIMATE.start_main_#t~malloc10#1.base_40| v_ArrVal_3082) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2021-12-06 17:41:39,243 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_64| Int) (v_ArrVal_3079 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_40| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_179| Int) (v_ArrVal_3082 (Array Int Int)) (v_ArrVal_3072 (Array Int Int)) (v_ArrVal_3075 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_64|) 0)) (= 2 (select (select (store (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_3072))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_179| v_ArrVal_3075))) |v_ULTIMATE.start_main_#t~malloc7#1.base_64| v_ArrVal_3079) |v_ULTIMATE.start_main_#t~malloc10#1.base_40| v_ArrVal_3082) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_179|) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_40| |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-06 17:41:39,277 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_64| Int) (v_ArrVal_3079 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_40| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_179| Int) (v_ArrVal_3082 (Array Int Int)) (v_ArrVal_3072 (Array Int Int)) (v_ArrVal_3075 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_64|) 0)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_179|) (= 2 (select (select (store (store (let ((.cse0 (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) v_ArrVal_3072))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_179| v_ArrVal_3075))) |v_ULTIMATE.start_main_#t~malloc7#1.base_64| v_ArrVal_3079) |v_ULTIMATE.start_main_#t~malloc10#1.base_40| v_ArrVal_3082) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_40| |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-06 17:41:39,326 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-06 17:41:39,326 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 13 treesize of output 12 [2021-12-06 17:42:01,131 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:42:01,134 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:42:01,135 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 50 [2021-12-06 17:42:01,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:42:01,139 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:42:01,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2021-12-06 17:42:01,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:42:01,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:42:01,146 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:42:01,147 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 21 treesize of output 13 [2021-12-06 17:42:01,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:01,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104242737] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:42:01,174 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:42:01,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 44 [2021-12-06 17:42:01,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585556593] [2021-12-06 17:42:01,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:42:01,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-06 17:42:01,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:01,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-06 17:42:01,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1110, Unknown=57, NotChecked=532, Total=1892 [2021-12-06 17:42:01,175 INFO L87 Difference]: Start difference. First operand 428 states and 498 transitions. Second operand has 44 states, 44 states have (on average 2.159090909090909) internal successors, (95), 44 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:03,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:03,841 INFO L93 Difference]: Finished difference Result 582 states and 671 transitions. [2021-12-06 17:42:03,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-06 17:42:03,841 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.159090909090909) internal successors, (95), 44 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-06 17:42:03,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:03,843 INFO L225 Difference]: With dead ends: 582 [2021-12-06 17:42:03,843 INFO L226 Difference]: Without dead ends: 582 [2021-12-06 17:42:03,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=513, Invalid=2523, Unknown=72, NotChecked=798, Total=3906 [2021-12-06 17:42:03,844 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 700 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 3217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1879 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:03,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [700 Valid, 1257 Invalid, 3217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1215 Invalid, 0 Unknown, 1879 Unchecked, 0.5s Time] [2021-12-06 17:42:03,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-12-06 17:42:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 428. [2021-12-06 17:42:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 407 states have (on average 1.221130221130221) internal successors, (497), 427 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:03,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 497 transitions. [2021-12-06 17:42:03,848 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 497 transitions. Word has length 44 [2021-12-06 17:42:03,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:03,848 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 497 transitions. [2021-12-06 17:42:03,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.159090909090909) internal successors, (95), 44 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:03,849 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 497 transitions. [2021-12-06 17:42:03,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-06 17:42:03,849 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:03,849 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:03,869 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2021-12-06 17:42:04,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-12-06 17:42:04,050 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:04,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:04,051 INFO L85 PathProgramCache]: Analyzing trace with hash 304461578, now seen corresponding path program 1 times [2021-12-06 17:42:04,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:04,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943979662] [2021-12-06 17:42:04,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:04,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:04,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:04,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:04,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943979662] [2021-12-06 17:42:04,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943979662] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:42:04,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954750660] [2021-12-06 17:42:04,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:04,203 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:04,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:04,204 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:42:04,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-12-06 17:42:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:04,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-06 17:42:04,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:04,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:42:04,358 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:42:04,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:42:04,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:42:04,443 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:42:04,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-06 17:42:04,463 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:42:04,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-06 17:42:04,474 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:42:04,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:42:04,501 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-12-06 17:42:04,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 24 [2021-12-06 17:42:04,568 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-06 17:42:04,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 53 [2021-12-06 17:42:04,570 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 20 treesize of output 12 [2021-12-06 17:42:04,677 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:42:04,679 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:42:04,679 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 25 treesize of output 16 [2021-12-06 17:42:04,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:04,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:42:04,874 INFO L354 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2021-12-06 17:42:04,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2021-12-06 17:42:04,884 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_3199 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_182| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_182| 0) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4) |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_3199) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_182|) |c_ULTIMATE.start_main_~x~0#1.base|) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_182|))) is different from false [2021-12-06 17:42:04,957 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:42:04,958 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 1 case distinctions, treesize of input 18 treesize of output 22 [2021-12-06 17:42:05,206 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:42:05,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2021-12-06 17:42:05,213 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:42:05,213 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 146 treesize of output 145 [2021-12-06 17:42:05,218 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 130 treesize of output 122 [2021-12-06 17:42:05,224 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:42:05,224 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 132 treesize of output 110 [2021-12-06 17:42:05,232 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-06 17:42:05,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-06 17:42:05,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:05,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954750660] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:42:05,554 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:42:05,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 37 [2021-12-06 17:42:05,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743564885] [2021-12-06 17:42:05,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:42:05,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-06 17:42:05,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:05,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-06 17:42:05,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1192, Unknown=14, NotChecked=70, Total=1406 [2021-12-06 17:42:05,555 INFO L87 Difference]: Start difference. First operand 428 states and 497 transitions. Second operand has 38 states, 37 states have (on average 3.3513513513513513) internal successors, (124), 38 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:06,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:06,452 INFO L93 Difference]: Finished difference Result 793 states and 911 transitions. [2021-12-06 17:42:06,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-06 17:42:06,452 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.3513513513513513) internal successors, (124), 38 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 44 [2021-12-06 17:42:06,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:06,455 INFO L225 Difference]: With dead ends: 793 [2021-12-06 17:42:06,455 INFO L226 Difference]: Without dead ends: 793 [2021-12-06 17:42:06,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=455, Invalid=2841, Unknown=14, NotChecked=112, Total=3422 [2021-12-06 17:42:06,456 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 702 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 2753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1197 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:06,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [702 Valid, 1434 Invalid, 2753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1444 Invalid, 0 Unknown, 1197 Unchecked, 0.5s Time] [2021-12-06 17:42:06,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2021-12-06 17:42:06,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 453. [2021-12-06 17:42:06,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 432 states have (on average 1.2222222222222223) internal successors, (528), 452 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 528 transitions. [2021-12-06 17:42:06,461 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 528 transitions. Word has length 44 [2021-12-06 17:42:06,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:06,462 INFO L470 AbstractCegarLoop]: Abstraction has 453 states and 528 transitions. [2021-12-06 17:42:06,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.3513513513513513) internal successors, (124), 38 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:06,462 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 528 transitions. [2021-12-06 17:42:06,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-06 17:42:06,462 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:06,462 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:06,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-12-06 17:42:06,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-12-06 17:42:06,663 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:06,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:06,664 INFO L85 PathProgramCache]: Analyzing trace with hash 304461579, now seen corresponding path program 1 times [2021-12-06 17:42:06,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:06,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568208590] [2021-12-06 17:42:06,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:06,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:06,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:06,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:06,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568208590] [2021-12-06 17:42:06,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568208590] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:42:06,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883556455] [2021-12-06 17:42:06,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:06,865 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:06,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:06,866 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:42:06,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-12-06 17:42:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:06,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 63 conjunts are in the unsatisfiable core [2021-12-06 17:42:06,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:06,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:42:07,042 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-06 17:42:07,042 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 17:42:07,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:42:07,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:42:07,170 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:42:07,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-06 17:42:07,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-06 17:42:07,182 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:42:07,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:42:07,246 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:42:07,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:42:07,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:07,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-06 17:42:07,305 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-12-06 17:42:07,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2021-12-06 17:42:07,312 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 14 treesize of output 16 [2021-12-06 17:42:07,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:07,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2021-12-06 17:42:07,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-06 17:42:07,456 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 17:42:07,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 71 [2021-12-06 17:42:07,460 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 24 treesize of output 26 [2021-12-06 17:42:07,708 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:42:07,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:07,709 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:42:07,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 26 [2021-12-06 17:42:07,714 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:42:07,714 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:42:07,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:07,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:42:08,476 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:42:08,476 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 1 case distinctions, treesize of input 51 treesize of output 55 [2021-12-06 17:42:08,483 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:42:08,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 108 [2021-12-06 17:42:08,550 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 30 treesize of output 22 [2021-12-06 17:42:08,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-12-06 17:42:08,622 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 30 treesize of output 22 [2021-12-06 17:42:08,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-12-06 17:42:08,713 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 30 treesize of output 22 [2021-12-06 17:42:08,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-12-06 17:42:08,866 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 30 treesize of output 22 [2021-12-06 17:42:08,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-12-06 17:42:08,957 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 30 treesize of output 22 [2021-12-06 17:42:08,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-12-06 17:42:09,007 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 30 treesize of output 22 [2021-12-06 17:42:09,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-12-06 17:42:09,100 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 30 treesize of output 22 [2021-12-06 17:42:09,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-12-06 17:42:09,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 30 treesize of output 22 [2021-12-06 17:42:09,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-12-06 17:42:09,180 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 30 treesize of output 22 [2021-12-06 17:42:09,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-12-06 17:42:09,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-12-06 17:42:09,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 30 treesize of output 22 [2021-12-06 17:42:09,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-12-06 17:42:09,356 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 30 treesize of output 22 [2021-12-06 17:42:09,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 30 treesize of output 22 [2021-12-06 17:42:09,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-12-06 17:42:09,485 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 30 treesize of output 22 [2021-12-06 17:42:09,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-12-06 17:42:09,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-12-06 17:42:09,663 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 30 treesize of output 22 [2021-12-06 17:42:09,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-12-06 17:42:09,695 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 30 treesize of output 22 [2021-12-06 17:42:09,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-12-06 17:42:09,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-12-06 17:42:09,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-12-06 17:42:09,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-12-06 17:42:09,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-06 17:42:10,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2021-12-06 17:42:10,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-06 17:42:10,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2021-12-06 17:42:10,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-06 17:42:10,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2021-12-06 17:42:10,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-06 17:42:10,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2021-12-06 17:42:10,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-06 17:42:10,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2021-12-06 17:42:10,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-06 17:42:10,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2021-12-06 17:42:10,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 32 treesize of output 24 [2021-12-06 17:42:10,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2021-12-06 17:42:10,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 32 treesize of output 24 [2021-12-06 17:42:10,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2021-12-06 17:42:10,654 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:42:10,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 101 [2021-12-06 17:42:10,660 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:42:10,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 93 [2021-12-06 17:42:10,668 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:42:10,668 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 271 treesize of output 266 [2021-12-06 17:42:10,679 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:42:10,680 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 472 treesize of output 467 [2021-12-06 17:42:10,691 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:42:10,691 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 477 treesize of output 365 [2021-12-06 17:42:10,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 318 treesize of output 310 [2021-12-06 17:42:10,715 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 310 treesize of output 306 [2021-12-06 17:42:10,722 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 306 treesize of output 298 [2021-12-06 17:42:10,729 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 298 treesize of output 294 [2021-12-06 17:42:10,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 290 [2021-12-06 17:42:10,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 290 treesize of output 288 [2021-12-06 17:42:11,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:11,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883556455] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:42:11,444 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:42:11,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 42 [2021-12-06 17:42:11,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937348335] [2021-12-06 17:42:11,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:42:11,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-06 17:42:11,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:11,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-06 17:42:11,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1601, Unknown=40, NotChecked=0, Total=1806 [2021-12-06 17:42:11,446 INFO L87 Difference]: Start difference. First operand 453 states and 528 transitions. Second operand has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:17,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:17,085 INFO L93 Difference]: Finished difference Result 629 states and 724 transitions. [2021-12-06 17:42:17,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-06 17:42:17,085 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 0 states have call successors, (0), 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 44 [2021-12-06 17:42:17,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:17,087 INFO L225 Difference]: With dead ends: 629 [2021-12-06 17:42:17,087 INFO L226 Difference]: Without dead ends: 629 [2021-12-06 17:42:17,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=466, Invalid=3652, Unknown=42, NotChecked=0, Total=4160 [2021-12-06 17:42:17,088 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 308 mSDsluCounter, 2280 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 2399 SdHoareTripleChecker+Invalid, 2681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1335 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:17,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 2399 Invalid, 2681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1296 Invalid, 0 Unknown, 1335 Unchecked, 0.6s Time] [2021-12-06 17:42:17,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-12-06 17:42:17,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 431. [2021-12-06 17:42:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 410 states have (on average 1.226829268292683) internal successors, (503), 430 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:17,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 503 transitions. [2021-12-06 17:42:17,093 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 503 transitions. Word has length 44 [2021-12-06 17:42:17,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:17,093 INFO L470 AbstractCegarLoop]: Abstraction has 431 states and 503 transitions. [2021-12-06 17:42:17,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:17,093 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 503 transitions. [2021-12-06 17:42:17,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-06 17:42:17,093 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:17,093 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:17,113 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2021-12-06 17:42:17,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:17,295 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:17,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:17,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1777201982, now seen corresponding path program 1 times [2021-12-06 17:42:17,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:17,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308638958] [2021-12-06 17:42:17,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:17,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:17,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:17,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:17,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308638958] [2021-12-06 17:42:17,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308638958] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:42:17,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263696850] [2021-12-06 17:42:17,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:17,713 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:17,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:17,714 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:42:17,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-12-06 17:42:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:17,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-06 17:42:17,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:17,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:42:17,867 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-06 17:42:17,867 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 17:42:17,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:42:17,895 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 17:42:17,969 INFO L354 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2021-12-06 17:42:17,969 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 80 treesize of output 52 [2021-12-06 17:42:17,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2021-12-06 17:42:18,088 INFO L354 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-12-06 17:42:18,088 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 22 treesize of output 24 [2021-12-06 17:42:18,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:18,135 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2021-12-06 17:42:18,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:18,143 INFO L354 Elim1Store]: treesize reduction 63, result has 17.1 percent of original size [2021-12-06 17:42:18,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 57 [2021-12-06 17:42:18,328 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 17:42:18,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 80 [2021-12-06 17:42:18,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:18,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2021-12-06 17:42:18,398 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 17:42:18,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 80 [2021-12-06 17:42:18,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:18,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2021-12-06 17:42:18,429 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 17:42:18,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 88 [2021-12-06 17:42:18,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 52 [2021-12-06 17:42:18,738 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 36 [2021-12-06 17:42:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:18,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:42:18,951 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3451 (Array Int Int)) (v_ArrVal_3452 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3452))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3451) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) 0)) (forall ((v_ArrVal_3451 (Array Int Int)) (v_ArrVal_3452 (Array Int Int))) (= (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3451)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3452) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) 0))) is different from false [2021-12-06 17:42:18,977 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3451 (Array Int Int)) (v_ArrVal_3452 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_3451)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_3452) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) 0)) (forall ((v_ArrVal_3451 (Array Int Int)) (v_ArrVal_3452 (Array Int Int))) (= (let ((.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_3452))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_3451) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) 0))) is different from false [2021-12-06 17:42:18,984 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3451 (Array Int Int)) (v_ArrVal_3452 (Array Int Int))) (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3451)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3452) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))) 0)) (forall ((v_ArrVal_3451 (Array Int Int)) (v_ArrVal_3452 (Array Int Int))) (= 0 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_3452))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (select (select (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_3451) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)))))) is different from false [2021-12-06 17:42:19,000 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3451 (Array Int Int)) (v_ArrVal_3452 (Array Int Int)) (v_ArrVal_3446 Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_3452))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3446)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_3451) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) 0)) (forall ((v_ArrVal_3451 (Array Int Int)) (v_ArrVal_3452 (Array Int Int)) (v_ArrVal_3446 Int)) (= (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3446)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_3451)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_3452) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) 0))) is different from false [2021-12-06 17:42:19,029 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_73| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_73|) 0)) (and (forall ((v_ArrVal_3451 (Array Int Int)) (v_ArrVal_3452 (Array Int Int)) (v_ArrVal_3446 Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_73|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_73| v_ArrVal_3452))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3446)) |v_ULTIMATE.start_main_#t~malloc7#1.base_73| v_ArrVal_3451) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) 0)) (forall ((v_ArrVal_3451 (Array Int Int)) (v_ArrVal_3452 (Array Int Int)) (v_ArrVal_3446 Int)) (= (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3446)) |v_ULTIMATE.start_main_#t~malloc7#1.base_73| v_ArrVal_3451)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_73|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_73| v_ArrVal_3452) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) 0))))) is different from false [2021-12-06 17:42:19,131 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_73| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_197| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_73|) 0)) (and (forall ((v_ArrVal_3451 (Array Int Int)) (v_ArrVal_3452 (Array Int Int)) (v_ArrVal_3446 Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197| |v_ULTIMATE.start_main_#t~malloc7#1.base_73|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_73| v_ArrVal_3452))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197| v_ArrVal_3446)) |v_ULTIMATE.start_main_#t~malloc7#1.base_73| v_ArrVal_3451) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) 0)) (forall ((v_ArrVal_3451 (Array Int Int)) (v_ArrVal_3452 (Array Int Int)) (v_ArrVal_3446 Int)) (= (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197| v_ArrVal_3446)) |v_ULTIMATE.start_main_#t~malloc7#1.base_73| v_ArrVal_3451)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197| |v_ULTIMATE.start_main_#t~malloc7#1.base_73|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_73| v_ArrVal_3452) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) 0))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_197|))) is different from false [2021-12-06 17:42:19,322 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_73| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_197| Int)) (or (and (forall ((v_ArrVal_3451 (Array Int Int)) (v_ArrVal_3452 (Array Int Int)) (v_ArrVal_3446 Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (select (let ((.cse0 (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base|) |c_ULTIMATE.start_main_#t~mem4#1.offset| 0)))) (store .cse2 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197| |v_ULTIMATE.start_main_#t~malloc7#1.base_73|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_73| v_ArrVal_3452))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base|) |c_ULTIMATE.start_main_#t~mem4#1.offset| 0)))) (store .cse3 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197| v_ArrVal_3446))) |v_ULTIMATE.start_main_#t~malloc7#1.base_73| v_ArrVal_3451) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) 0)) (forall ((v_ArrVal_3451 (Array Int Int)) (v_ArrVal_3452 (Array Int Int)) (v_ArrVal_3446 Int)) (= (let ((.cse4 (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base|) |c_ULTIMATE.start_main_#t~mem4#1.offset| 0)))) (store .cse7 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197| v_ArrVal_3446))) |v_ULTIMATE.start_main_#t~malloc7#1.base_73| v_ArrVal_3451)) (.cse6 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (select (select .cse4 (select (select (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base|) |c_ULTIMATE.start_main_#t~mem4#1.offset| 0)))) (store .cse5 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_197| |v_ULTIMATE.start_main_#t~malloc7#1.base_73|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_73| v_ArrVal_3452) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6)) (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) .cse6))) 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_73|) 0)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_197|))) is different from false [2021-12-06 17:42:19,782 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:42:19,887 INFO L354 Elim1Store]: treesize reduction 68, result has 58.8 percent of original size [2021-12-06 17:42:19,887 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 6 case distinctions, treesize of input 441 treesize of output 346 [2021-12-06 17:42:19,890 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:42:19,919 INFO L354 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2021-12-06 17:42:19,919 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 3 case distinctions, treesize of input 346 treesize of output 202 [2021-12-06 17:42:19,921 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:42:19,923 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:42:19,958 INFO L354 Elim1Store]: treesize reduction 33, result has 62.1 percent of original size [2021-12-06 17:42:19,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 229 treesize of output 235 [2021-12-06 17:42:19,965 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:42:19,967 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:42:19,977 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:42:19,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 226 treesize of output 218 [2021-12-06 17:42:19,983 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:42:19,985 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:42:20,017 INFO L354 Elim1Store]: treesize reduction 24, result has 60.0 percent of original size [2021-12-06 17:42:20,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 233 treesize of output 242 [2021-12-06 17:42:20,030 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 37 treesize of output 35 [2021-12-06 17:42:20,038 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 35 treesize of output 33 [2021-12-06 17:42:20,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-06 17:42:20,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263696850] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:42:20,593 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:42:20,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 47 [2021-12-06 17:42:20,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512323831] [2021-12-06 17:42:20,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:42:20,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-12-06 17:42:20,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:20,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-12-06 17:42:20,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1403, Unknown=8, NotChecked=574, Total=2162 [2021-12-06 17:42:20,594 INFO L87 Difference]: Start difference. First operand 431 states and 503 transitions. Second operand has 47 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 47 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:20,808 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse14 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse13 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse10 (select .cse14 .cse13)) (.cse9 (select |c_#memory_$Pointer$.base| .cse0)) (.cse3 (select .cse14 .cse2)) (.cse11 (select .cse12 .cse13)) (.cse8 (select .cse12 .cse2))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) 0) (not (= .cse2 |c_ULTIMATE.start_main_~x~0#1.offset|)) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse3) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_73| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_73|) 0)) (and (forall ((v_ArrVal_3451 (Array Int Int)) (v_ArrVal_3452 (Array Int Int)) (v_ArrVal_3446 Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_73|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_73| v_ArrVal_3452))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3446)) |v_ULTIMATE.start_main_#t~malloc7#1.base_73| v_ArrVal_3451) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) 0)) (forall ((v_ArrVal_3451 (Array Int Int)) (v_ArrVal_3452 (Array Int Int)) (v_ArrVal_3446 Int)) (= (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3446)) |v_ULTIMATE.start_main_#t~malloc7#1.base_73| v_ArrVal_3451)) (.cse7 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (select (select .cse6 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_73|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_73| v_ArrVal_3452) |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7))) 0))))) (= (select |c_#valid| .cse0) 1) (<= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select |c_#valid| .cse8) 1) (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) (= (select .cse9 .cse1) 0) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse1) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| .cse10) (= (select (select |c_#memory_$Pointer$.offset| .cse11) .cse10) 0) (= (select .cse9 |c_ULTIMATE.start_main_~head~0#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse8) .cse3) 0) (= 0 (select (select |c_#memory_$Pointer$.base| .cse11) |c_ULTIMATE.start_main_~x~0#1.offset|)) (not (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= .cse8 |c_ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| .cse8) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))))) is different from false [2021-12-06 17:42:22,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:22,579 INFO L93 Difference]: Finished difference Result 536 states and 620 transitions. [2021-12-06 17:42:22,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-12-06 17:42:22,579 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 47 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-06 17:42:22,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:22,581 INFO L225 Difference]: With dead ends: 536 [2021-12-06 17:42:22,581 INFO L226 Difference]: Without dead ends: 536 [2021-12-06 17:42:22,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=502, Invalid=3175, Unknown=15, NotChecked=1000, Total=4692 [2021-12-06 17:42:22,582 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 304 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 2228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1387 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:22,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 1510 Invalid, 2228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 802 Invalid, 0 Unknown, 1387 Unchecked, 0.4s Time] [2021-12-06 17:42:22,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2021-12-06 17:42:22,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 445. [2021-12-06 17:42:22,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 424 states have (on average 1.221698113207547) internal successors, (518), 444 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:22,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 518 transitions. [2021-12-06 17:42:22,587 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 518 transitions. Word has length 45 [2021-12-06 17:42:22,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:22,587 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 518 transitions. [2021-12-06 17:42:22,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 47 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:22,587 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 518 transitions. [2021-12-06 17:42:22,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-06 17:42:22,588 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:22,588 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:22,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-12-06 17:42:22,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2021-12-06 17:42:22,789 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:22,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:22,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2137761846, now seen corresponding path program 1 times [2021-12-06 17:42:22,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:22,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317676244] [2021-12-06 17:42:22,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:22,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:23,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:23,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317676244] [2021-12-06 17:42:23,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317676244] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:42:23,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404201223] [2021-12-06 17:42:23,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:23,212 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:23,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:23,213 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:42:23,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-12-06 17:42:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:23,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 77 conjunts are in the unsatisfiable core [2021-12-06 17:42:23,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:23,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:42:23,358 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-06 17:42:23,358 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 17:42:23,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:42:23,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 17:42:23,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:23,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 52 [2021-12-06 17:42:23,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 42 [2021-12-06 17:42:23,527 INFO L354 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-12-06 17:42:23,527 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 22 treesize of output 24 [2021-12-06 17:42:23,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:23,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:23,582 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-06 17:42:23,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 51 [2021-12-06 17:42:23,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:23,586 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2021-12-06 17:42:23,769 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 17:42:23,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 68 [2021-12-06 17:42:23,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:23,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2021-12-06 17:42:23,847 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 17:42:23,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 68 [2021-12-06 17:42:23,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:23,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2021-12-06 17:42:23,885 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 17:42:23,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 76 [2021-12-06 17:42:23,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2021-12-06 17:42:24,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:24,370 INFO L354 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2021-12-06 17:42:24,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 81 treesize of output 43 [2021-12-06 17:42:24,375 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-06 17:42:24,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2021-12-06 17:42:24,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:24,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:42:24,661 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3580 (Array Int Int)) (v_ArrVal_3579 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3580)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3579)) (.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (and (= (select (select .cse0 .cse1) .cse2) 0) (= (select (select .cse3 .cse1) .cse2) 0)) (and (= .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse2)))))) is different from false [2021-12-06 17:42:24,851 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3580 (Array Int Int)) (v_ArrVal_3579 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_3580)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_3579)) (.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (and (= (select (select .cse0 .cse1) .cse2) 0) (= (select (select .cse3 .cse1) .cse2) 0)) (and (= .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse2)))))) is different from false [2021-12-06 17:42:24,893 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3580 (Array Int Int)) (v_ArrVal_3579 (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_3580)) (.cse3 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_3579)) (.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (and (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse0) (= .cse1 |c_ULTIMATE.start_main_~head~0#1.base|)) (and (= (select (select .cse2 .cse1) .cse0) 0) (= (select (select .cse3 .cse1) .cse0) 0))))))) is different from false [2021-12-06 17:42:26,665 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3580 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_76| Int) (v_ArrVal_3579 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_202| Int) (v_ArrVal_3572 Int)) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_202| v_ArrVal_3572)) |v_ULTIMATE.start_main_#t~malloc7#1.base_76| v_ArrVal_3580)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_202| |v_ULTIMATE.start_main_#t~malloc7#1.base_76|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_76| v_ArrVal_3579)) (.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (and (= (select (select .cse0 .cse1) .cse2) 0) (= (select (select .cse3 .cse1) .cse2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_76|) 0)) (and (= .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse2)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_202|))))) is different from false [2021-12-06 17:42:31,231 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3580 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_76| Int) (v_ArrVal_3579 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_202| Int) (v_ArrVal_3572 Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (let ((.cse3 (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse6 (store (select |c_#memory_$Pointer$.offset| .cse6) .cse7 0)))) (store .cse8 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_202| v_ArrVal_3572))) |v_ULTIMATE.start_main_#t~malloc7#1.base_76| v_ArrVal_3580)) (.cse2 (store (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse6 (store (select |c_#memory_$Pointer$.base| .cse6) .cse7 0)))) (store .cse5 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_202| |v_ULTIMATE.start_main_#t~malloc7#1.base_76|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_76| v_ArrVal_3579))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_76|) 0)) (and (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse1)) (and (= (select (select .cse2 .cse0) .cse1) 0) (= (select (select .cse3 .cse0) .cse1) 0)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_202|))))))) is different from false [2021-12-06 17:42:33,198 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:42:33,252 INFO L354 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2021-12-06 17:42:33,252 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 3 case distinctions, treesize of input 595 treesize of output 387 [2021-12-06 17:42:33,257 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:42:33,291 INFO L354 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2021-12-06 17:42:33,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 339 treesize of output 131 [2021-12-06 17:42:33,297 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:42:33,380 INFO L354 Elim1Store]: treesize reduction 39, result has 67.2 percent of original size [2021-12-06 17:42:33,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 345 treesize of output 291 [2021-12-06 17:42:33,390 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:42:33,434 INFO L354 Elim1Store]: treesize reduction 28, result has 65.9 percent of original size [2021-12-06 17:42:33,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 306 treesize of output 275 [2021-12-06 17:42:33,452 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:42:33,452 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 207 treesize of output 173 [2021-12-06 17:42:33,462 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 89 treesize of output 85 [2021-12-06 17:42:34,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:34,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404201223] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:42:34,259 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 17:42:34,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 22] total 48 [2021-12-06 17:42:34,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534843439] [2021-12-06 17:42:34,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 17:42:34,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-06 17:42:34,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:34,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-06 17:42:34,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1582, Unknown=31, NotChecked=430, Total=2256 [2021-12-06 17:42:34,261 INFO L87 Difference]: Start difference. First operand 445 states and 518 transitions. Second operand has 48 states, 48 states have (on average 2.2916666666666665) internal successors, (110), 48 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:36,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:36,197 INFO L93 Difference]: Finished difference Result 469 states and 541 transitions. [2021-12-06 17:42:36,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-12-06 17:42:36,198 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.2916666666666665) internal successors, (110), 48 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) Word has length 45 [2021-12-06 17:42:36,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:36,199 INFO L225 Difference]: With dead ends: 469 [2021-12-06 17:42:36,199 INFO L226 Difference]: Without dead ends: 469 [2021-12-06 17:42:36,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1342 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=669, Invalid=4712, Unknown=41, NotChecked=740, Total=6162 [2021-12-06 17:42:36,200 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 269 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1392 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:36,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 1282 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 810 Invalid, 0 Unknown, 1392 Unchecked, 0.4s Time] [2021-12-06 17:42:36,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2021-12-06 17:42:36,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 428. [2021-12-06 17:42:36,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 407 states have (on average 1.2235872235872236) internal successors, (498), 427 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:36,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 498 transitions. [2021-12-06 17:42:36,204 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 498 transitions. Word has length 45 [2021-12-06 17:42:36,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:36,204 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 498 transitions. [2021-12-06 17:42:36,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.2916666666666665) internal successors, (110), 48 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:36,204 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 498 transitions. [2021-12-06 17:42:36,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-06 17:42:36,205 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:36,205 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:36,225 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2021-12-06 17:42:36,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:36,406 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:36,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:36,407 INFO L85 PathProgramCache]: Analyzing trace with hash -2130379885, now seen corresponding path program 1 times [2021-12-06 17:42:36,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:36,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615042981] [2021-12-06 17:42:36,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:36,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:36,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:36,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615042981] [2021-12-06 17:42:36,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615042981] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:42:36,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042886897] [2021-12-06 17:42:36,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:36,540 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:36,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:36,541 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:42:36,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-12-06 17:42:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:36,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-06 17:42:36,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:36,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:42:36,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:42:36,681 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:42:36,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 17:42:36,688 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 17:42:36,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:36,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 17:42:36,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-06 17:42:36,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-06 17:42:36,751 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:42:36,752 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 17:42:36,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 17:42:36,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:36,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042886897] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:36,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:42:36,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 17 [2021-12-06 17:42:36,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958446857] [2021-12-06 17:42:36,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:36,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 17:42:36,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:36,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 17:42:36,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2021-12-06 17:42:36,770 INFO L87 Difference]: Start difference. First operand 428 states and 498 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:36,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:36,986 INFO L93 Difference]: Finished difference Result 437 states and 505 transitions. [2021-12-06 17:42:36,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 17:42:36,986 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 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 17:42:36,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:36,988 INFO L225 Difference]: With dead ends: 437 [2021-12-06 17:42:36,988 INFO L226 Difference]: Without dead ends: 436 [2021-12-06 17:42:36,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2021-12-06 17:42:36,988 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 149 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:36,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 377 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:42:36,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2021-12-06 17:42:36,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 428. [2021-12-06 17:42:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 407 states have (on average 1.221130221130221) internal successors, (497), 427 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 497 transitions. [2021-12-06 17:42:36,992 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 497 transitions. Word has length 46 [2021-12-06 17:42:36,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:36,993 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 497 transitions. [2021-12-06 17:42:36,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:36,993 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 497 transitions. [2021-12-06 17:42:36,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-06 17:42:36,993 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:36,993 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:37,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2021-12-06 17:42:37,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2021-12-06 17:42:37,194 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:37,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:37,195 INFO L85 PathProgramCache]: Analyzing trace with hash -63518326, now seen corresponding path program 2 times [2021-12-06 17:42:37,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:37,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763927104] [2021-12-06 17:42:37,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:37,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:37,464 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:37,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:37,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763927104] [2021-12-06 17:42:37,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763927104] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:42:37,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726051347] [2021-12-06 17:42:37,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 17:42:37,465 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:37,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:37,465 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:42:37,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-12-06 17:42:37,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 17:42:37,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:42:37,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-06 17:42:37,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:37,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:42:37,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:42:37,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:42:37,688 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:42:37,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:42:37,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:37,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:42:37,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:37,738 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 21 treesize of output 20 [2021-12-06 17:42:37,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:37,888 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 23 [2021-12-06 17:42:37,894 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:42:37,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:42:37,955 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:42:37,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:42:37,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:37,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 23 [2021-12-06 17:42:37,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:37,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 23 [2021-12-06 17:42:37,984 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:42:37,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:42:38,018 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:42:38,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 17:42:38,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:38,075 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-12-06 17:42:38,075 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 2 case distinctions, treesize of input 36 treesize of output 34 [2021-12-06 17:42:38,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 23 [2021-12-06 17:42:38,258 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-06 17:42:38,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2021-12-06 17:42:38,262 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 23 [2021-12-06 17:42:38,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-12-06 17:42:38,467 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:42:38,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2021-12-06 17:42:38,480 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-06 17:42:38,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2021-12-06 17:42:38,484 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-12-06 17:42:38,484 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:42:38,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2021-12-06 17:42:38,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63180989] [2021-12-06 17:42:38,484 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-06 17:42:38,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-06 17:42:38,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:38,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-06 17:42:38,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=734, Unknown=1, NotChecked=0, Total=870 [2021-12-06 17:42:38,485 INFO L87 Difference]: Start difference. First operand 428 states and 497 transitions. Second operand has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 19 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:38,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 17:42:38,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=734, Unknown=1, NotChecked=0, Total=870 [2021-12-06 17:42:38,485 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:38,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:42:38,505 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2021-12-06 17:42:38,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:38,687 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@2432804b at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-06 17:42:38,697 INFO L158 Benchmark]: Toolchain (without parser) took 179533.68ms. Allocated memory was 81.8MB in the beginning and 142.6MB in the end (delta: 60.8MB). Free memory was 44.2MB in the beginning and 26.5MB in the end (delta: 17.6MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2021-12-06 17:42:38,698 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 81.8MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:42:38,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.62ms. Allocated memory was 81.8MB in the beginning and 117.4MB in the end (delta: 35.7MB). Free memory was 44.0MB in the beginning and 85.7MB in the end (delta: -41.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-06 17:42:38,698 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.57ms. Allocated memory is still 117.4MB. Free memory was 85.7MB in the beginning and 83.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:42:38,699 INFO L158 Benchmark]: Boogie Preprocessor took 25.04ms. Allocated memory is still 117.4MB. Free memory was 83.6MB in the beginning and 82.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:42:38,699 INFO L158 Benchmark]: RCFGBuilder took 472.28ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 61.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-12-06 17:42:38,699 INFO L158 Benchmark]: TraceAbstraction took 178688.65ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 60.5MB in the beginning and 26.5MB in the end (delta: 34.0MB). Peak memory consumption was 61.0MB. Max. memory is 16.1GB. [2021-12-06 17:42:38,701 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 81.8MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.62ms. Allocated memory was 81.8MB in the beginning and 117.4MB in the end (delta: 35.7MB). Free memory was 44.0MB in the beginning and 85.7MB in the end (delta: -41.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.57ms. Allocated memory is still 117.4MB. Free memory was 85.7MB in the beginning and 83.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.04ms. Allocated memory is still 117.4MB. Free memory was 83.6MB in the beginning and 82.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 472.28ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 61.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 178688.65ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 60.5MB in the beginning and 26.5MB in the end (delta: 34.0MB). Peak memory consumption was 61.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@2432804b de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@2432804b: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-06 17:42:38,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/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_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-optional-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/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 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 17:42:40,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 17:42:40,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 17:42:40,306 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 17:42:40,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 17:42:40,308 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 17:42:40,310 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 17:42:40,312 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 17:42:40,314 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 17:42:40,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 17:42:40,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 17:42:40,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 17:42:40,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 17:42:40,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 17:42:40,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 17:42:40,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 17:42:40,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 17:42:40,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 17:42:40,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 17:42:40,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 17:42:40,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 17:42:40,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 17:42:40,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 17:42:40,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 17:42:40,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 17:42:40,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 17:42:40,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 17:42:40,339 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 17:42:40,340 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 17:42:40,341 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 17:42:40,341 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 17:42:40,342 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 17:42:40,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 17:42:40,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 17:42:40,353 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 17:42:40,353 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 17:42:40,353 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 17:42:40,354 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 17:42:40,354 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 17:42:40,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 17:42:40,355 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 17:42:40,356 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-06 17:42:40,379 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 17:42:40,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 17:42:40,380 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 17:42:40,380 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 17:42:40,380 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 17:42:40,381 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 17:42:40,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 17:42:40,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 17:42:40,382 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 17:42:40,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 17:42:40,382 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 17:42:40,382 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-06 17:42:40,382 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 17:42:40,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 17:42:40,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 17:42:40,383 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-06 17:42:40,383 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-06 17:42:40,383 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-06 17:42:40,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 17:42:40,384 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-06 17:42:40,384 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-06 17:42:40,384 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-06 17:42:40,384 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 17:42:40,384 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 17:42:40,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 17:42:40,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 17:42:40,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 17:42:40,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:42:40,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 17:42:40,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 17:42:40,385 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-06 17:42:40,385 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-06 17:42:40,385 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 17:42:40,386 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-06 17:42:40,386 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/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_b8d0174e-0c4d-471e-8a1f-024f3555d04d/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 -> 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 [2021-12-06 17:42:40,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 17:42:40,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 17:42:40,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 17:42:40,627 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 17:42:40,627 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 17:42:40,628 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/forester-heap/sll-optional-1.i [2021-12-06 17:42:40,670 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/data/3f6f22701/034d40b005814a2b98bd90ace59eb819/FLAGa2aaa429b [2021-12-06 17:42:41,104 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 17:42:41,105 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/sv-benchmarks/c/forester-heap/sll-optional-1.i [2021-12-06 17:42:41,114 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/data/3f6f22701/034d40b005814a2b98bd90ace59eb819/FLAGa2aaa429b [2021-12-06 17:42:41,123 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/data/3f6f22701/034d40b005814a2b98bd90ace59eb819 [2021-12-06 17:42:41,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 17:42:41,126 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 17:42:41,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 17:42:41,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 17:42:41,130 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 17:42:41,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:42:41" (1/1) ... [2021-12-06 17:42:41,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ce5e3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:41, skipping insertion in model container [2021-12-06 17:42:41,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:42:41" (1/1) ... [2021-12-06 17:42:41,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 17:42:41,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 17:42:41,388 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_b8d0174e-0c4d-471e-8a1f-024f3555d04d/sv-benchmarks/c/forester-heap/sll-optional-1.i[22688,22701] [2021-12-06 17:42:41,395 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:42:41,408 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 17:42:41,446 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_b8d0174e-0c4d-471e-8a1f-024f3555d04d/sv-benchmarks/c/forester-heap/sll-optional-1.i[22688,22701] [2021-12-06 17:42:41,450 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:42:41,478 INFO L208 MainTranslator]: Completed translation [2021-12-06 17:42:41,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:41 WrapperNode [2021-12-06 17:42:41,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 17:42:41,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 17:42:41,480 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 17:42:41,480 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 17:42:41,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:41" (1/1) ... [2021-12-06 17:42:41,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:41" (1/1) ... [2021-12-06 17:42:41,517 INFO L137 Inliner]: procedures = 122, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 132 [2021-12-06 17:42:41,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 17:42:41,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 17:42:41,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 17:42:41,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 17:42:41,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:41" (1/1) ... [2021-12-06 17:42:41,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:41" (1/1) ... [2021-12-06 17:42:41,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:41" (1/1) ... [2021-12-06 17:42:41,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:41" (1/1) ... [2021-12-06 17:42:41,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:41" (1/1) ... [2021-12-06 17:42:41,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:41" (1/1) ... [2021-12-06 17:42:41,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:41" (1/1) ... [2021-12-06 17:42:41,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 17:42:41,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 17:42:41,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 17:42:41,547 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 17:42:41,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:41" (1/1) ... [2021-12-06 17:42:41,553 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:42:41,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:41,572 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 17:42:41,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 17:42:41,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-06 17:42:41,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 17:42:41,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 17:42:41,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-06 17:42:41,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-06 17:42:41,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 17:42:41,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-06 17:42:41,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-06 17:42:41,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 17:42:41,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 17:42:41,700 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 17:42:41,701 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 17:42:42,193 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 17:42:42,197 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 17:42:42,198 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-06 17:42:42,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:42:42 BoogieIcfgContainer [2021-12-06 17:42:42,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 17:42:42,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 17:42:42,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 17:42:42,203 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 17:42:42,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:42:41" (1/3) ... [2021-12-06 17:42:42,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439406fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:42:42, skipping insertion in model container [2021-12-06 17:42:42,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:41" (2/3) ... [2021-12-06 17:42:42,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439406fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:42:42, skipping insertion in model container [2021-12-06 17:42:42,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:42:42" (3/3) ... [2021-12-06 17:42:42,206 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-optional-1.i [2021-12-06 17:42:42,211 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 17:42:42,211 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2021-12-06 17:42:42,248 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 17:42:42,253 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 17:42:42,253 INFO L340 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2021-12-06 17:42:42,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 73 states have (on average 2.136986301369863) internal successors, (156), 139 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:42,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-06 17:42:42,269 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:42,269 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-06 17:42:42,269 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:42,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:42,273 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-06 17:42:42,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:42:42,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137032643] [2021-12-06 17:42:42,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:42,284 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:42:42,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:42:42,285 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:42:42,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-06 17:42:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:42,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:42:42,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:42,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:42:42,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:42,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:42,412 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:42:42,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137032643] [2021-12-06 17:42:42,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137032643] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:42,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:42:42,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 17:42:42,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973477280] [2021-12-06 17:42:42,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:42,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:42:42,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:42:42,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:42:42,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:42:42,443 INFO L87 Difference]: Start difference. First operand has 140 states, 73 states have (on average 2.136986301369863) internal successors, (156), 139 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:42,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:42,721 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2021-12-06 17:42:42,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:42:42,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-06 17:42:42,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:42,734 INFO L225 Difference]: With dead ends: 142 [2021-12-06 17:42:42,734 INFO L226 Difference]: Without dead ends: 138 [2021-12-06 17:42:42,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:42:42,739 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 125 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:42,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 81 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:42:42,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-06 17:42:42,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 132. [2021-12-06 17:42:42,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 75 states have (on average 1.92) internal successors, (144), 131 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2021-12-06 17:42:42,769 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 3 [2021-12-06 17:42:42,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:42,769 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2021-12-06 17:42:42,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:42,769 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2021-12-06 17:42:42,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-06 17:42:42,770 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:42,770 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-06 17:42:42,777 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-06 17:42:42,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:42:42,972 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:42,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:42,974 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-06 17:42:42,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:42:42,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966875383] [2021-12-06 17:42:42,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:42,977 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:42:42,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:42:42,980 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:42:42,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-06 17:42:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:43,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 17:42:43,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:43,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:42:43,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:43,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:43,094 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:42:43,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966875383] [2021-12-06 17:42:43,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966875383] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:43,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:42:43,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 17:42:43,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332519423] [2021-12-06 17:42:43,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:43,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:42:43,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:42:43,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:42:43,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:42:43,097 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:43,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:43,331 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2021-12-06 17:42:43,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:42:43,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-06 17:42:43,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:43,333 INFO L225 Difference]: With dead ends: 128 [2021-12-06 17:42:43,333 INFO L226 Difference]: Without dead ends: 128 [2021-12-06 17:42:43,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:42:43,335 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 102 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:43,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 94 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:42:43,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-12-06 17:42:43,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2021-12-06 17:42:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 75 states have (on average 1.8133333333333332) internal successors, (136), 123 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:43,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2021-12-06 17:42:43,346 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 3 [2021-12-06 17:42:43,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:43,346 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2021-12-06 17:42:43,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:43,347 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2021-12-06 17:42:43,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-06 17:42:43,347 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:43,347 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:43,354 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-06 17:42:43,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:42:43,549 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:43,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:43,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1404186606, now seen corresponding path program 1 times [2021-12-06 17:42:43,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:42:43,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062699995] [2021-12-06 17:42:43,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:43,555 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:42:43,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:42:43,557 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:42:43,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-06 17:42:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:43,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 17:42:43,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:43,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:42:43,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:42:43,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-06 17:42:43,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:43,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:43,726 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:42:43,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062699995] [2021-12-06 17:42:43,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062699995] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:43,726 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:42:43,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:42:43,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174459493] [2021-12-06 17:42:43,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:43,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:42:43,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:42:43,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:42:43,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:42:43,728 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:44,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:44,140 INFO L93 Difference]: Finished difference Result 167 states and 184 transitions. [2021-12-06 17:42:44,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:42:44,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-06 17:42:44,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:44,142 INFO L225 Difference]: With dead ends: 167 [2021-12-06 17:42:44,142 INFO L226 Difference]: Without dead ends: 167 [2021-12-06 17:42:44,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:42:44,143 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 50 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:44,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 301 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:42:44,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-06 17:42:44,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 123. [2021-12-06 17:42:44,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 75 states have (on average 1.8) internal successors, (135), 122 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:44,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2021-12-06 17:42:44,150 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 10 [2021-12-06 17:42:44,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:44,150 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2021-12-06 17:42:44,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:44,150 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2021-12-06 17:42:44,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-06 17:42:44,151 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:44,151 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:44,158 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-06 17:42:44,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:42:44,353 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:44,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:44,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1404186605, now seen corresponding path program 1 times [2021-12-06 17:42:44,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:42:44,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904953262] [2021-12-06 17:42:44,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:44,358 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:42:44,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:42:44,360 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:42:44,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-06 17:42:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:44,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-06 17:42:44,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:44,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:42:44,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:42:44,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:42:44,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2021-12-06 17:42:44,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 17:42:44,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:44,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:44,528 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:42:44,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904953262] [2021-12-06 17:42:44,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904953262] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:44,529 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:42:44,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:42:44,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281610153] [2021-12-06 17:42:44,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:44,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:42:44,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:42:44,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:42:44,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:42:44,530 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:44,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:44,966 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2021-12-06 17:42:44,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:42:44,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-06 17:42:44,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:44,968 INFO L225 Difference]: With dead ends: 122 [2021-12-06 17:42:44,968 INFO L226 Difference]: Without dead ends: 122 [2021-12-06 17:42:44,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:42:44,969 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 2 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:44,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 337 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:42:44,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-06 17:42:44,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-12-06 17:42:44,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 75 states have (on average 1.7866666666666666) internal successors, (134), 121 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:44,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2021-12-06 17:42:44,974 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 10 [2021-12-06 17:42:44,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:44,975 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2021-12-06 17:42:44,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:44,975 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2021-12-06 17:42:44,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-06 17:42:44,975 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:44,975 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:44,983 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-06 17:42:45,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:42:45,177 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:45,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:45,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1595381600, now seen corresponding path program 1 times [2021-12-06 17:42:45,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:42:45,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583572307] [2021-12-06 17:42:45,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:45,181 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:42:45,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:42:45,184 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:42:45,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-06 17:42:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:45,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 17:42:45,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:45,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:42:45,323 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-06 17:42:45,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 22 [2021-12-06 17:42:45,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:45,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:45,343 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:42:45,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583572307] [2021-12-06 17:42:45,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583572307] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:45,344 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:42:45,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 17:42:45,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599699018] [2021-12-06 17:42:45,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:45,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 17:42:45,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:42:45,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 17:42:45,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 17:42:45,345 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:45,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:45,632 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2021-12-06 17:42:45,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 17:42:45,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-06 17:42:45,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:45,634 INFO L225 Difference]: With dead ends: 124 [2021-12-06 17:42:45,634 INFO L226 Difference]: Without dead ends: 124 [2021-12-06 17:42:45,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:42:45,635 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 168 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:45,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 69 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:42:45,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-06 17:42:45,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 115. [2021-12-06 17:42:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 81 states have (on average 1.6296296296296295) internal successors, (132), 114 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2021-12-06 17:42:45,646 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 10 [2021-12-06 17:42:45,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:45,647 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2021-12-06 17:42:45,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:45,647 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2021-12-06 17:42:45,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-06 17:42:45,647 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:45,648 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:45,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-06 17:42:45,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:42:45,849 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:45,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:45,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1595381601, now seen corresponding path program 1 times [2021-12-06 17:42:45,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:42:45,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680470617] [2021-12-06 17:42:45,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:45,854 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:42:45,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:42:45,856 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:42:45,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-06 17:42:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:45,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-06 17:42:45,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:45,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:42:46,031 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:42:46,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-06 17:42:46,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:46,042 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:46,042 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:42:46,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680470617] [2021-12-06 17:42:46,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680470617] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:46,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:42:46,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 17:42:46,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071863791] [2021-12-06 17:42:46,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:46,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 17:42:46,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:42:46,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 17:42:46,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 17:42:46,044 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:46,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:46,414 INFO L93 Difference]: Finished difference Result 166 states and 185 transitions. [2021-12-06 17:42:46,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 17:42:46,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-06 17:42:46,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:46,416 INFO L225 Difference]: With dead ends: 166 [2021-12-06 17:42:46,416 INFO L226 Difference]: Without dead ends: 166 [2021-12-06 17:42:46,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:42:46,417 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 168 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:46,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 108 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:42:46,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-12-06 17:42:46,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 142. [2021-12-06 17:42:46,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 108 states have (on average 1.5462962962962963) internal successors, (167), 141 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:46,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 167 transitions. [2021-12-06 17:42:46,422 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 167 transitions. Word has length 10 [2021-12-06 17:42:46,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:46,422 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 167 transitions. [2021-12-06 17:42:46,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:46,422 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 167 transitions. [2021-12-06 17:42:46,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-06 17:42:46,423 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:46,423 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:46,430 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-06 17:42:46,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:42:46,624 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:46,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:46,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1355389539, now seen corresponding path program 1 times [2021-12-06 17:42:46,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:42:46,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018608816] [2021-12-06 17:42:46,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:46,628 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:42:46,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:42:46,630 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:42:46,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-06 17:42:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:46,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-06 17:42:46,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:46,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:42:46,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:42:46,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:42:46,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-06 17:42:46,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:42:46,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:46,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:46,791 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:42:46,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018608816] [2021-12-06 17:42:46,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018608816] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:46,791 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:42:46,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:42:46,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641713144] [2021-12-06 17:42:46,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:46,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:42:46,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:42:46,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:42:46,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:42:46,792 INFO L87 Difference]: Start difference. First operand 142 states and 167 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:47,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:47,360 INFO L93 Difference]: Finished difference Result 134 states and 159 transitions. [2021-12-06 17:42:47,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 17:42:47,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-12-06 17:42:47,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:47,361 INFO L225 Difference]: With dead ends: 134 [2021-12-06 17:42:47,361 INFO L226 Difference]: Without dead ends: 134 [2021-12-06 17:42:47,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-06 17:42:47,362 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 24 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:47,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 305 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 17:42:47,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-06 17:42:47,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2021-12-06 17:42:47,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.4615384615384615) internal successors, (152), 127 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:47,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 152 transitions. [2021-12-06 17:42:47,366 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 152 transitions. Word has length 14 [2021-12-06 17:42:47,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:47,366 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 152 transitions. [2021-12-06 17:42:47,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:47,366 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 152 transitions. [2021-12-06 17:42:47,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-06 17:42:47,367 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:47,367 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:47,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-06 17:42:47,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:42:47,568 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:47,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:47,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1355389538, now seen corresponding path program 1 times [2021-12-06 17:42:47,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:42:47,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822908360] [2021-12-06 17:42:47,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:47,572 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:42:47,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:42:47,574 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:42:47,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-06 17:42:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:47,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-06 17:42:47,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:47,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:42:47,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:42:47,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2021-12-06 17:42:47,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:47,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:47,671 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:42:47,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822908360] [2021-12-06 17:42:47,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822908360] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:47,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:42:47,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:42:47,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359046912] [2021-12-06 17:42:47,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:47,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:42:47,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:42:47,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:42:47,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:42:47,673 INFO L87 Difference]: Start difference. First operand 128 states and 152 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:48,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:48,135 INFO L93 Difference]: Finished difference Result 130 states and 155 transitions. [2021-12-06 17:42:48,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 17:42:48,136 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-12-06 17:42:48,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:48,136 INFO L225 Difference]: With dead ends: 130 [2021-12-06 17:42:48,136 INFO L226 Difference]: Without dead ends: 130 [2021-12-06 17:42:48,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:42:48,137 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 49 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:48,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 255 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:42:48,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-06 17:42:48,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2021-12-06 17:42:48,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 126 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 151 transitions. [2021-12-06 17:42:48,140 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 151 transitions. Word has length 14 [2021-12-06 17:42:48,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:48,140 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 151 transitions. [2021-12-06 17:42:48,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:48,141 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 151 transitions. [2021-12-06 17:42:48,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-06 17:42:48,141 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:48,141 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:48,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-06 17:42:48,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:42:48,343 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:48,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:48,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1163410907, now seen corresponding path program 1 times [2021-12-06 17:42:48,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:42:48,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779570534] [2021-12-06 17:42:48,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:48,346 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:42:48,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:42:48,348 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:42:48,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-06 17:42:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:48,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:42:48,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:48,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:48,427 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:48,427 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:42:48,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779570534] [2021-12-06 17:42:48,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779570534] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:48,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:42:48,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:42:48,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014351578] [2021-12-06 17:42:48,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:48,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 17:42:48,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:42:48,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 17:42:48,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 17:42:48,428 INFO L87 Difference]: Start difference. First operand 127 states and 151 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:48,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:48,655 INFO L93 Difference]: Finished difference Result 150 states and 169 transitions. [2021-12-06 17:42:48,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 17:42:48,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-06 17:42:48,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:48,656 INFO L225 Difference]: With dead ends: 150 [2021-12-06 17:42:48,657 INFO L226 Difference]: Without dead ends: 150 [2021-12-06 17:42:48,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:42:48,660 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 151 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:48,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 148 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:42:48,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-06 17:42:48,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 127. [2021-12-06 17:42:48,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 126 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:48,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 149 transitions. [2021-12-06 17:42:48,663 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 149 transitions. Word has length 15 [2021-12-06 17:42:48,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:48,663 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 149 transitions. [2021-12-06 17:42:48,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:48,664 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 149 transitions. [2021-12-06 17:42:48,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-06 17:42:48,664 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:48,664 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:48,671 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-06 17:42:48,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:42:48,866 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:48,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:48,867 INFO L85 PathProgramCache]: Analyzing trace with hash 152694153, now seen corresponding path program 1 times [2021-12-06 17:42:48,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:42:48,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547513626] [2021-12-06 17:42:48,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:48,869 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:42:48,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:42:48,871 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:42:48,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-06 17:42:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:48,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:42:48,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:49,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:49,007 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:49,007 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:42:49,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547513626] [2021-12-06 17:42:49,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547513626] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:49,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:42:49,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:42:49,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631721584] [2021-12-06 17:42:49,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:49,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 17:42:49,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:42:49,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 17:42:49,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 17:42:49,008 INFO L87 Difference]: Start difference. First operand 127 states and 149 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:49,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:49,022 INFO L93 Difference]: Finished difference Result 153 states and 183 transitions. [2021-12-06 17:42:49,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 17:42:49,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-12-06 17:42:49,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:49,024 INFO L225 Difference]: With dead ends: 153 [2021-12-06 17:42:49,024 INFO L226 Difference]: Without dead ends: 153 [2021-12-06 17:42:49,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:42:49,024 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 21 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:49,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 295 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:42:49,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-06 17:42:49,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 131. [2021-12-06 17:42:49,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 130 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:49,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2021-12-06 17:42:49,028 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 18 [2021-12-06 17:42:49,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:49,028 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2021-12-06 17:42:49,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:49,028 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2021-12-06 17:42:49,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-06 17:42:49,029 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:49,029 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:49,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-12-06 17:42:49,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:42:49,232 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:49,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:49,233 INFO L85 PathProgramCache]: Analyzing trace with hash 718816338, now seen corresponding path program 1 times [2021-12-06 17:42:49,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:42:49,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373147880] [2021-12-06 17:42:49,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:49,235 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:42:49,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:42:49,237 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:42:49,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-06 17:42:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:49,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 17:42:49,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:49,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:49,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:49,395 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:42:49,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373147880] [2021-12-06 17:42:49,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373147880] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:49,395 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:42:49,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:42:49,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415466529] [2021-12-06 17:42:49,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:49,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:42:49,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:42:49,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:42:49,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:42:49,396 INFO L87 Difference]: Start difference. First operand 131 states and 153 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:49,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:49,419 INFO L93 Difference]: Finished difference Result 153 states and 179 transitions. [2021-12-06 17:42:49,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 17:42:49,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-06 17:42:49,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:49,420 INFO L225 Difference]: With dead ends: 153 [2021-12-06 17:42:49,420 INFO L226 Difference]: Without dead ends: 153 [2021-12-06 17:42:49,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:42:49,421 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 25 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:49,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 387 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:42:49,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-06 17:42:49,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 135. [2021-12-06 17:42:49,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 134 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:49,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2021-12-06 17:42:49,424 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 20 [2021-12-06 17:42:49,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:49,424 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2021-12-06 17:42:49,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:49,424 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2021-12-06 17:42:49,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-06 17:42:49,425 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:49,425 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:49,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-12-06 17:42:49,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:42:49,625 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:49,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:49,626 INFO L85 PathProgramCache]: Analyzing trace with hash -526850106, now seen corresponding path program 1 times [2021-12-06 17:42:49,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:42:49,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283193607] [2021-12-06 17:42:49,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:49,626 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:42:49,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:42:49,627 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:42:49,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-06 17:42:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:49,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-06 17:42:49,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:49,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:42:49,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:42:49,768 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:42:49,770 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:42:49,770 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 10 [2021-12-06 17:42:49,774 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:42:49,775 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2021-12-06 17:42:49,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:49,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:49,807 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:42:49,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283193607] [2021-12-06 17:42:49,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283193607] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:49,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:42:49,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:42:49,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92899975] [2021-12-06 17:42:49,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:49,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:42:49,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:42:49,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:42:49,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:42:49,809 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:50,565 INFO L93 Difference]: Finished difference Result 254 states and 291 transitions. [2021-12-06 17:42:50,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 17:42:50,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-06 17:42:50,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:50,566 INFO L225 Difference]: With dead ends: 254 [2021-12-06 17:42:50,566 INFO L226 Difference]: Without dead ends: 254 [2021-12-06 17:42:50,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2021-12-06 17:42:50,567 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 301 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:50,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 406 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 17:42:50,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-12-06 17:42:50,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 144. [2021-12-06 17:42:50,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 143 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:50,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 168 transitions. [2021-12-06 17:42:50,571 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 168 transitions. Word has length 20 [2021-12-06 17:42:50,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:50,571 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 168 transitions. [2021-12-06 17:42:50,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:50,572 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 168 transitions. [2021-12-06 17:42:50,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-06 17:42:50,572 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:50,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:50,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-06 17:42:50,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:42:50,773 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:50,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:50,774 INFO L85 PathProgramCache]: Analyzing trace with hash 213685580, now seen corresponding path program 1 times [2021-12-06 17:42:50,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:42:50,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516863064] [2021-12-06 17:42:50,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:50,776 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:42:50,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:42:50,779 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:42:50,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-06 17:42:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:50,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 17:42:50,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:50,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:42:50,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:42:50,946 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 28 treesize of output 16 [2021-12-06 17:42:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:50,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:50,954 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:42:50,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516863064] [2021-12-06 17:42:50,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516863064] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:50,954 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:42:50,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:42:50,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153798800] [2021-12-06 17:42:50,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:50,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:42:50,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:42:50,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:42:50,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:42:50,956 INFO L87 Difference]: Start difference. First operand 144 states and 168 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:51,340 INFO L93 Difference]: Finished difference Result 149 states and 174 transitions. [2021-12-06 17:42:51,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:42:51,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-06 17:42:51,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:51,342 INFO L225 Difference]: With dead ends: 149 [2021-12-06 17:42:51,342 INFO L226 Difference]: Without dead ends: 149 [2021-12-06 17:42:51,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:42:51,342 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 7 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:51,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 271 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:42:51,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-06 17:42:51,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 143. [2021-12-06 17:42:51,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 121 states have (on average 1.3801652892561984) internal successors, (167), 142 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:51,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2021-12-06 17:42:51,346 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 21 [2021-12-06 17:42:51,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:51,346 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2021-12-06 17:42:51,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:51,346 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2021-12-06 17:42:51,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-06 17:42:51,347 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:51,347 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:51,354 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-06 17:42:51,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:42:51,548 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:51,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:51,549 INFO L85 PathProgramCache]: Analyzing trace with hash 213685581, now seen corresponding path program 1 times [2021-12-06 17:42:51,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:42:51,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902218183] [2021-12-06 17:42:51,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:51,551 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:42:51,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:42:51,553 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:42:51,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-06 17:42:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:51,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-06 17:42:51,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:51,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:42:51,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:42:51,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:42:51,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2021-12-06 17:42:51,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 17:42:51,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:51,750 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:51,750 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:42:51,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902218183] [2021-12-06 17:42:51,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902218183] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:51,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:42:51,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 17:42:51,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762071630] [2021-12-06 17:42:51,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:51,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:42:51,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:42:51,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:42:51,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:42:51,751 INFO L87 Difference]: Start difference. First operand 143 states and 167 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:52,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:52,134 INFO L93 Difference]: Finished difference Result 142 states and 166 transitions. [2021-12-06 17:42:52,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:42:52,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-06 17:42:52,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:52,136 INFO L225 Difference]: With dead ends: 142 [2021-12-06 17:42:52,136 INFO L226 Difference]: Without dead ends: 142 [2021-12-06 17:42:52,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:42:52,137 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:52,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 263 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 17:42:52,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-06 17:42:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-12-06 17:42:52,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 121 states have (on average 1.371900826446281) internal successors, (166), 141 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:52,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions. [2021-12-06 17:42:52,140 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 166 transitions. Word has length 21 [2021-12-06 17:42:52,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:52,140 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 166 transitions. [2021-12-06 17:42:52,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:52,140 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 166 transitions. [2021-12-06 17:42:52,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-06 17:42:52,141 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:52,141 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:52,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-06 17:42:52,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:42:52,342 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:52,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:52,344 INFO L85 PathProgramCache]: Analyzing trace with hash -705595017, now seen corresponding path program 1 times [2021-12-06 17:42:52,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:42:52,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211288753] [2021-12-06 17:42:52,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:52,346 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:42:52,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:42:52,348 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:42:52,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-06 17:42:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:52,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-06 17:42:52,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:52,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:42:52,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:42:52,532 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:42:52,534 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:42:52,534 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 10 [2021-12-06 17:42:52,540 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:42:52,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2021-12-06 17:42:52,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:52,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:52,565 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:42:52,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211288753] [2021-12-06 17:42:52,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [211288753] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:52,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:42:52,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:42:52,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854898068] [2021-12-06 17:42:52,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:52,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:42:52,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:42:52,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:42:52,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:42:52,566 INFO L87 Difference]: Start difference. First operand 142 states and 166 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:53,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:53,131 INFO L93 Difference]: Finished difference Result 218 states and 248 transitions. [2021-12-06 17:42:53,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 17:42:53,131 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-06 17:42:53,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:53,132 INFO L225 Difference]: With dead ends: 218 [2021-12-06 17:42:53,132 INFO L226 Difference]: Without dead ends: 218 [2021-12-06 17:42:53,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-12-06 17:42:53,133 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 165 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:53,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 345 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 17:42:53,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-12-06 17:42:53,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 150. [2021-12-06 17:42:53,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 129 states have (on average 1.3488372093023255) internal successors, (174), 149 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 174 transitions. [2021-12-06 17:42:53,136 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 174 transitions. Word has length 22 [2021-12-06 17:42:53,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:53,136 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 174 transitions. [2021-12-06 17:42:53,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:53,136 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 174 transitions. [2021-12-06 17:42:53,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-06 17:42:53,137 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:53,137 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:53,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-12-06 17:42:53,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:42:53,338 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:53,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:53,339 INFO L85 PathProgramCache]: Analyzing trace with hash 887014990, now seen corresponding path program 1 times [2021-12-06 17:42:53,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:42:53,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586426693] [2021-12-06 17:42:53,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:53,341 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:42:53,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:42:53,344 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:42:53,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-06 17:42:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:53,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-06 17:42:53,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:53,464 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-06 17:42:53,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 24 [2021-12-06 17:42:53,561 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-12-06 17:42:53,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 49 [2021-12-06 17:42:53,661 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 17:42:54,018 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:42:54,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 58 [2021-12-06 17:42:55,205 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 58 treesize of output 34 [2021-12-06 17:42:55,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:55,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:55,303 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:42:55,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586426693] [2021-12-06 17:42:55,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [586426693] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:55,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:42:55,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:42:55,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221885854] [2021-12-06 17:42:55,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:55,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:42:55,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:42:55,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:42:55,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:42:55,305 INFO L87 Difference]: Start difference. First operand 150 states and 174 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:55,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:55,852 INFO L93 Difference]: Finished difference Result 257 states and 294 transitions. [2021-12-06 17:42:55,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:42:55,853 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-06 17:42:55,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:55,854 INFO L225 Difference]: With dead ends: 257 [2021-12-06 17:42:55,854 INFO L226 Difference]: Without dead ends: 257 [2021-12-06 17:42:55,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:42:55,855 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 273 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 382 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:55,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 427 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 62 Invalid, 0 Unknown, 382 Unchecked, 0.2s Time] [2021-12-06 17:42:55,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-12-06 17:42:55,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 162. [2021-12-06 17:42:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 141 states have (on average 1.3475177304964538) internal successors, (190), 161 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:55,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 190 transitions. [2021-12-06 17:42:55,858 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 190 transitions. Word has length 24 [2021-12-06 17:42:55,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:55,859 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 190 transitions. [2021-12-06 17:42:55,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:55,859 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 190 transitions. [2021-12-06 17:42:55,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-06 17:42:55,859 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:55,859 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:55,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-06 17:42:56,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:42:56,060 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:56,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:56,060 INFO L85 PathProgramCache]: Analyzing trace with hash 887014991, now seen corresponding path program 1 times [2021-12-06 17:42:56,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:42:56,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507856078] [2021-12-06 17:42:56,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:56,061 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:42:56,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:42:56,061 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:42:56,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-06 17:42:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:56,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-06 17:42:56,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:56,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:42:56,176 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:42:56,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2021-12-06 17:42:56,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:42:56,201 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 17:42:56,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:42:56,275 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:42:56,276 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 17:42:56,279 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 17:42:56,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:42:56,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-06 17:42:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:56,427 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:56,428 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:42:56,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507856078] [2021-12-06 17:42:56,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507856078] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:56,428 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:42:56,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:42:56,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367443745] [2021-12-06 17:42:56,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:56,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:42:56,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:42:56,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:42:56,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:42:56,429 INFO L87 Difference]: Start difference. First operand 162 states and 190 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:57,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:57,571 INFO L93 Difference]: Finished difference Result 246 states and 280 transitions. [2021-12-06 17:42:57,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 17:42:57,572 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-06 17:42:57,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:57,573 INFO L225 Difference]: With dead ends: 246 [2021-12-06 17:42:57,573 INFO L226 Difference]: Without dead ends: 246 [2021-12-06 17:42:57,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-12-06 17:42:57,574 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 196 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:57,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 448 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-06 17:42:57,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-12-06 17:42:57,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 162. [2021-12-06 17:42:57,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 141 states have (on average 1.3404255319148937) internal successors, (189), 161 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:57,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 189 transitions. [2021-12-06 17:42:57,579 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 189 transitions. Word has length 24 [2021-12-06 17:42:57,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:57,579 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 189 transitions. [2021-12-06 17:42:57,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:57,579 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 189 transitions. [2021-12-06 17:42:57,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 17:42:57,580 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:57,580 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:57,587 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-12-06 17:42:57,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:42:57,782 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:57,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:57,783 INFO L85 PathProgramCache]: Analyzing trace with hash 809096703, now seen corresponding path program 1 times [2021-12-06 17:42:57,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:42:57,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91784733] [2021-12-06 17:42:57,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:57,785 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:42:57,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:42:57,787 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:42:57,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-06 17:42:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:57,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-06 17:42:57,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:57,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:42:57,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:42:57,914 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:42:57,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-06 17:42:57,944 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-06 17:42:57,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 17:42:57,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:42:57,989 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 20 treesize of output 8 [2021-12-06 17:42:58,011 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 16 treesize of output 18 [2021-12-06 17:42:58,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 17:42:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:58,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:58,080 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:42:58,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91784733] [2021-12-06 17:42:58,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91784733] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:58,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:42:58,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 17:42:58,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062852954] [2021-12-06 17:42:58,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:58,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 17:42:58,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:42:58,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 17:42:58,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-12-06 17:42:58,082 INFO L87 Difference]: Start difference. First operand 162 states and 189 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:59,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:59,082 INFO L93 Difference]: Finished difference Result 242 states and 272 transitions. [2021-12-06 17:42:59,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 17:42:59,083 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-06 17:42:59,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:59,084 INFO L225 Difference]: With dead ends: 242 [2021-12-06 17:42:59,084 INFO L226 Difference]: Without dead ends: 242 [2021-12-06 17:42:59,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2021-12-06 17:42:59,085 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 339 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:59,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 506 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-06 17:42:59,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-12-06 17:42:59,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 162. [2021-12-06 17:42:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 141 states have (on average 1.3333333333333333) internal successors, (188), 161 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:59,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 188 transitions. [2021-12-06 17:42:59,088 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 188 transitions. Word has length 26 [2021-12-06 17:42:59,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:59,088 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 188 transitions. [2021-12-06 17:42:59,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:42:59,088 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 188 transitions. [2021-12-06 17:42:59,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-06 17:42:59,089 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:59,089 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:59,096 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-12-06 17:42:59,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:42:59,290 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:42:59,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:59,291 INFO L85 PathProgramCache]: Analyzing trace with hash 748762178, now seen corresponding path program 1 times [2021-12-06 17:42:59,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:42:59,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664394503] [2021-12-06 17:42:59,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:59,293 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:42:59,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:42:59,296 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:42:59,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-06 17:42:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:59,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-06 17:42:59,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:59,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:42:59,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:42:59,414 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 17:42:59,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:42:59,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:59,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:42:59,433 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 17:42:59,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:42:59,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:42:59,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:42:59,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:42:59,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:42:59,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:59,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:42:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:42:59,633 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:42:59,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664394503] [2021-12-06 17:42:59,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664394503] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:42:59,633 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:42:59,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2021-12-06 17:42:59,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558431419] [2021-12-06 17:42:59,634 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:42:59,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:42:59,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:42:59,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:42:59,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:42:59,635 INFO L87 Difference]: Start difference. First operand 162 states and 188 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:00,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:00,158 INFO L93 Difference]: Finished difference Result 203 states and 232 transitions. [2021-12-06 17:43:00,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 17:43:00,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-06 17:43:00,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:00,160 INFO L225 Difference]: With dead ends: 203 [2021-12-06 17:43:00,160 INFO L226 Difference]: Without dead ends: 203 [2021-12-06 17:43:00,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:43:00,161 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 80 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:00,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 265 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 17:43:00,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-12-06 17:43:00,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 175. [2021-12-06 17:43:00,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 154 states have (on average 1.3181818181818181) internal successors, (203), 174 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:00,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 203 transitions. [2021-12-06 17:43:00,164 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 203 transitions. Word has length 26 [2021-12-06 17:43:00,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:00,165 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 203 transitions. [2021-12-06 17:43:00,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:00,165 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 203 transitions. [2021-12-06 17:43:00,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-06 17:43:00,165 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:00,165 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:00,172 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2021-12-06 17:43:00,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:43:00,366 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:43:00,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:00,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1851942844, now seen corresponding path program 1 times [2021-12-06 17:43:00,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:43:00,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780156246] [2021-12-06 17:43:00,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:00,366 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:43:00,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:43:00,367 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:43:00,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-06 17:43:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:00,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 17:43:00,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:43:00,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 17:43:00,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 17:43:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:00,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:43:00,617 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:43:00,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780156246] [2021-12-06 17:43:00,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780156246] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:43:00,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:43:00,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 17:43:00,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301414247] [2021-12-06 17:43:00,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:43:00,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 17:43:00,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:43:00,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 17:43:00,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:43:00,618 INFO L87 Difference]: Start difference. First operand 175 states and 203 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:01,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:01,523 INFO L93 Difference]: Finished difference Result 212 states and 235 transitions. [2021-12-06 17:43:01,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 17:43:01,523 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-06 17:43:01,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:01,524 INFO L225 Difference]: With dead ends: 212 [2021-12-06 17:43:01,524 INFO L226 Difference]: Without dead ends: 212 [2021-12-06 17:43:01,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2021-12-06 17:43:01,525 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 186 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:01,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 438 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 17:43:01,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-12-06 17:43:01,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 177. [2021-12-06 17:43:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 156 states have (on average 1.314102564102564) internal successors, (205), 176 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:01,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 205 transitions. [2021-12-06 17:43:01,528 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 205 transitions. Word has length 28 [2021-12-06 17:43:01,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:01,528 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 205 transitions. [2021-12-06 17:43:01,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:01,529 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 205 transitions. [2021-12-06 17:43:01,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-06 17:43:01,529 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:01,529 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:01,540 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2021-12-06 17:43:01,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:43:01,730 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:43:01,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:01,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1693052079, now seen corresponding path program 1 times [2021-12-06 17:43:01,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:43:01,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679598215] [2021-12-06 17:43:01,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:01,730 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:43:01,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:43:01,731 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:43:01,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-06 17:43:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:01,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-06 17:43:01,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:43:01,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:43:01,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:43:01,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:01,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 17:43:01,918 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:43:01,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-06 17:43:01,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:43:01,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:01,960 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 21 treesize of output 20 [2021-12-06 17:43:01,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-06 17:43:02,033 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 16 treesize of output 18 [2021-12-06 17:43:02,054 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 16 treesize of output 18 [2021-12-06 17:43:02,062 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 16 treesize of output 18 [2021-12-06 17:43:02,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:43:02,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:02,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:43:02,200 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32)))) is different from false [2021-12-06 17:43:02,222 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:43:02,230 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_605) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:43:02,244 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_602 (_ BitVec 32)) (v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_602)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:43:02,334 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_6| (_ BitVec 32)) (v_ArrVal_602 (_ BitVec 32)) (v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|)))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_602)) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_605) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2021-12-06 17:43:02,351 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_6| (_ BitVec 32)) (v_ArrVal_602 (_ BitVec 32)) (v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_597 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|)))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_597) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_602)) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_605) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2021-12-06 17:43:02,396 INFO L354 Elim1Store]: treesize reduction 78, result has 27.1 percent of original size [2021-12-06 17:43:02,397 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 3 case distinctions, treesize of input 31 treesize of output 42 [2021-12-06 17:43:02,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2021-12-06 17:43:02,404 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 17:43:02,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:02,432 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:43:02,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679598215] [2021-12-06 17:43:02,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679598215] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:43:02,432 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:43:02,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2021-12-06 17:43:02,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678796440] [2021-12-06 17:43:02,432 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:43:02,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-06 17:43:02,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:43:02,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-06 17:43:02,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=247, Unknown=9, NotChecked=222, Total=552 [2021-12-06 17:43:02,433 INFO L87 Difference]: Start difference. First operand 177 states and 205 transitions. Second operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 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 17:43:03,545 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (_ bv2 32) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (_ bv0 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_602 (_ BitVec 32)) (v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_602)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))) (not (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-06 17:43:03,705 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (_ bv2 32) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32))))) is different from false [2021-12-06 17:43:04,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:04,222 INFO L93 Difference]: Finished difference Result 490 states and 550 transitions. [2021-12-06 17:43:04,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-06 17:43:04,222 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 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) Word has length 30 [2021-12-06 17:43:04,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:04,224 INFO L225 Difference]: With dead ends: 490 [2021-12-06 17:43:04,224 INFO L226 Difference]: Without dead ends: 490 [2021-12-06 17:43:04,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=278, Invalid=930, Unknown=14, NotChecked=584, Total=1806 [2021-12-06 17:43:04,228 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 498 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 2097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1193 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:04,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [498 Valid, 939 Invalid, 2097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 818 Invalid, 0 Unknown, 1193 Unchecked, 1.2s Time] [2021-12-06 17:43:04,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-12-06 17:43:04,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 204. [2021-12-06 17:43:04,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 183 states have (on average 1.3005464480874316) internal successors, (238), 203 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 238 transitions. [2021-12-06 17:43:04,232 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 238 transitions. Word has length 30 [2021-12-06 17:43:04,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:04,233 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 238 transitions. [2021-12-06 17:43:04,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 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 17:43:04,233 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 238 transitions. [2021-12-06 17:43:04,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-06 17:43:04,233 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:04,233 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:04,241 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2021-12-06 17:43:04,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:43:04,434 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:43:04,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:04,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1418753207, now seen corresponding path program 1 times [2021-12-06 17:43:04,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:43:04,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181045545] [2021-12-06 17:43:04,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:04,435 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:43:04,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:43:04,435 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:43:04,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-06 17:43:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:04,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-06 17:43:04,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:43:04,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:43:04,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:43:04,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:04,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 17:43:04,634 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:43:04,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-06 17:43:04,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:43:04,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:04,669 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 21 treesize of output 20 [2021-12-06 17:43:04,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-06 17:43:04,748 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 16 treesize of output 18 [2021-12-06 17:43:04,768 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 16 treesize of output 18 [2021-12-06 17:43:04,778 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 16 treesize of output 18 [2021-12-06 17:43:04,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:43:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:04,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:43:04,926 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_663) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32)))) is different from false [2021-12-06 17:43:04,943 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_663) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:43:04,949 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_663) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:43:04,963 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_657 (_ BitVec 32))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_657)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_663) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32)))) is different from false [2021-12-06 17:43:05,056 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_9| (_ BitVec 32)) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_657 (_ BitVec 32))) (or (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_657)) |v_ULTIMATE.start_main_#t~malloc7#1.base_9| v_ArrVal_663) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_9|))))) is different from false [2021-12-06 17:43:05,074 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_9| (_ BitVec 32)) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_657 (_ BitVec 32)) (v_ArrVal_656 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_9|))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_656) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_657)) |v_ULTIMATE.start_main_#t~malloc7#1.base_9| v_ArrVal_663) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2021-12-06 17:43:05,109 INFO L354 Elim1Store]: treesize reduction 78, result has 27.1 percent of original size [2021-12-06 17:43:05,109 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 3 case distinctions, treesize of input 31 treesize of output 42 [2021-12-06 17:43:05,112 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 27 [2021-12-06 17:43:05,114 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 17:43:05,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:05,141 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:43:05,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181045545] [2021-12-06 17:43:05,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181045545] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:43:05,141 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:43:05,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2021-12-06 17:43:05,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501789375] [2021-12-06 17:43:05,142 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:43:05,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-06 17:43:05,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:43:05,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-06 17:43:05,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=248, Unknown=8, NotChecked=222, Total=552 [2021-12-06 17:43:05,143 INFO L87 Difference]: Start difference. First operand 204 states and 238 transitions. Second operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 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 17:43:06,537 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (_ bv2 32) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (_ bv0 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_657 (_ BitVec 32))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_657)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_663) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32)))) (not (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 32)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|))))) (_ bv1 1)))) is different from false [2021-12-06 17:43:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:07,424 INFO L93 Difference]: Finished difference Result 541 states and 610 transitions. [2021-12-06 17:43:07,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-06 17:43:07,425 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 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) Word has length 30 [2021-12-06 17:43:07,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:07,427 INFO L225 Difference]: With dead ends: 541 [2021-12-06 17:43:07,427 INFO L226 Difference]: Without dead ends: 541 [2021-12-06 17:43:07,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=303, Invalid=1048, Unknown=9, NotChecked=532, Total=1892 [2021-12-06 17:43:07,428 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 527 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 2936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1755 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:07,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [527 Valid, 1101 Invalid, 2936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1097 Invalid, 0 Unknown, 1755 Unchecked, 1.6s Time] [2021-12-06 17:43:07,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2021-12-06 17:43:07,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 202. [2021-12-06 17:43:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 181 states have (on average 1.298342541436464) internal successors, (235), 201 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 235 transitions. [2021-12-06 17:43:07,432 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 235 transitions. Word has length 30 [2021-12-06 17:43:07,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:07,433 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 235 transitions. [2021-12-06 17:43:07,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 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 17:43:07,433 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 235 transitions. [2021-12-06 17:43:07,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-06 17:43:07,433 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:07,433 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:07,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-12-06 17:43:07,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:43:07,634 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:43:07,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:07,636 INFO L85 PathProgramCache]: Analyzing trace with hash 753554603, now seen corresponding path program 1 times [2021-12-06 17:43:07,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:43:07,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671546574] [2021-12-06 17:43:07,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:07,637 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:43:07,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:43:07,637 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:43:07,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-06 17:43:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:07,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-06 17:43:07,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:43:07,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:43:07,770 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:43:07,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-06 17:43:07,779 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 17:43:07,831 INFO L354 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2021-12-06 17:43:07,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 47 [2021-12-06 17:43:07,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2021-12-06 17:43:08,022 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-12-06 17:43:08,022 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 40 [2021-12-06 17:43:08,025 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 10 [2021-12-06 17:43:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:08,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:43:08,074 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:43:08,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671546574] [2021-12-06 17:43:08,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671546574] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:43:08,074 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:43:08,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-06 17:43:08,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796170103] [2021-12-06 17:43:08,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:43:08,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 17:43:08,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:43:08,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 17:43:08,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-12-06 17:43:08,075 INFO L87 Difference]: Start difference. First operand 202 states and 235 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:09,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:09,627 INFO L93 Difference]: Finished difference Result 283 states and 317 transitions. [2021-12-06 17:43:09,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-06 17:43:09,627 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-06 17:43:09,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:09,628 INFO L225 Difference]: With dead ends: 283 [2021-12-06 17:43:09,628 INFO L226 Difference]: Without dead ends: 283 [2021-12-06 17:43:09,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2021-12-06 17:43:09,629 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 157 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:09,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 706 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 648 Invalid, 0 Unknown, 82 Unchecked, 1.2s Time] [2021-12-06 17:43:09,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-12-06 17:43:09,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 199. [2021-12-06 17:43:09,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 178 states have (on average 1.2921348314606742) internal successors, (230), 198 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:09,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 230 transitions. [2021-12-06 17:43:09,633 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 230 transitions. Word has length 31 [2021-12-06 17:43:09,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:09,633 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 230 transitions. [2021-12-06 17:43:09,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:09,633 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 230 transitions. [2021-12-06 17:43:09,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-06 17:43:09,633 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:09,633 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:09,640 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2021-12-06 17:43:09,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:43:09,835 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:43:09,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:09,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1978341344, now seen corresponding path program 1 times [2021-12-06 17:43:09,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:43:09,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226382037] [2021-12-06 17:43:09,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:09,837 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:43:09,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:43:09,838 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:43:09,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-06 17:43:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:09,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-06 17:43:09,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:43:09,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:43:10,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:43:10,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:43:10,060 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:43:10,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2021-12-06 17:43:10,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:10,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:43:10,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:10,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:43:10,195 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:43:10,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:43:10,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:10,203 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 16 treesize of output 18 [2021-12-06 17:43:10,237 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:43:10,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:43:10,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:10,245 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 16 treesize of output 18 [2021-12-06 17:43:10,265 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:43:10,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-06 17:43:10,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-06 17:43:10,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:10,398 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:43:10,401 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:43:10,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 14 [2021-12-06 17:43:10,405 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:43:10,405 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2021-12-06 17:43:10,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:10,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:43:10,582 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_759) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_758) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:43:10,618 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_758) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_759) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-06 17:43:10,630 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_758) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_759) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-06 17:43:10,653 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_751 (_ BitVec 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_751)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_759) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_758) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-06 17:43:10,692 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_12| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_12|)))) (and (forall ((v_ArrVal_759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_751 (_ BitVec 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_751)) |v_ULTIMATE.start_main_#t~malloc7#1.base_12| v_ArrVal_759) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_758 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_12|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_12| v_ArrVal_758) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2021-12-06 17:43:10,809 INFO L354 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2021-12-06 17:43:10,809 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 51 treesize of output 57 [2021-12-06 17:43:10,827 INFO L354 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2021-12-06 17:43:10,828 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 57 treesize of output 62 [2021-12-06 17:43:10,833 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-06 17:43:10,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 60 [2021-12-06 17:43:10,839 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-06 17:43:10,839 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 74 treesize of output 58 [2021-12-06 17:43:10,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2021-12-06 17:43:10,846 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 21 treesize of output 17 [2021-12-06 17:43:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-06 17:43:10,883 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:43:10,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226382037] [2021-12-06 17:43:10,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226382037] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:43:10,883 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:43:10,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2021-12-06 17:43:10,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673870466] [2021-12-06 17:43:10,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:43:10,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-06 17:43:10,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:43:10,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-06 17:43:10,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=252, Unknown=7, NotChecked=180, Total=506 [2021-12-06 17:43:10,884 INFO L87 Difference]: Start difference. First operand 199 states and 230 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 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 17:43:12,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:12,611 INFO L93 Difference]: Finished difference Result 325 states and 361 transitions. [2021-12-06 17:43:12,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 17:43:12,611 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 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) Word has length 32 [2021-12-06 17:43:12,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:12,613 INFO L225 Difference]: With dead ends: 325 [2021-12-06 17:43:12,613 INFO L226 Difference]: Without dead ends: 325 [2021-12-06 17:43:12,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=626, Unknown=7, NotChecked=290, Total=1122 [2021-12-06 17:43:12,614 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 373 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1140 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:12,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 864 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 826 Invalid, 0 Unknown, 1140 Unchecked, 1.3s Time] [2021-12-06 17:43:12,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-12-06 17:43:12,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 206. [2021-12-06 17:43:12,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 185 states have (on average 1.281081081081081) internal successors, (237), 205 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:12,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 237 transitions. [2021-12-06 17:43:12,618 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 237 transitions. Word has length 32 [2021-12-06 17:43:12,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:12,618 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 237 transitions. [2021-12-06 17:43:12,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 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 17:43:12,618 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 237 transitions. [2021-12-06 17:43:12,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-06 17:43:12,619 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:12,619 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:12,626 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2021-12-06 17:43:12,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:43:12,820 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:43:12,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:12,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1630199823, now seen corresponding path program 1 times [2021-12-06 17:43:12,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:43:12,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591821854] [2021-12-06 17:43:12,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:12,823 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:43:12,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:43:12,825 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:43:12,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-06 17:43:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:12,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 17:43:12,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:43:13,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 17:43:13,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:43:13,037 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:43:13,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1591821854] [2021-12-06 17:43:13,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1591821854] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:43:13,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:43:13,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 17:43:13,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925690144] [2021-12-06 17:43:13,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:43:13,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:43:13,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:43:13,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:43:13,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:43:13,038 INFO L87 Difference]: Start difference. First operand 206 states and 237 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:13,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:13,302 INFO L93 Difference]: Finished difference Result 227 states and 252 transitions. [2021-12-06 17:43:13,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 17:43:13,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-06 17:43:13,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:13,303 INFO L225 Difference]: With dead ends: 227 [2021-12-06 17:43:13,304 INFO L226 Difference]: Without dead ends: 227 [2021-12-06 17:43:13,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:43:13,304 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 168 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:13,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 129 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:43:13,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-12-06 17:43:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 208. [2021-12-06 17:43:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 187 states have (on average 1.2780748663101604) internal successors, (239), 207 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:13,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 239 transitions. [2021-12-06 17:43:13,308 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 239 transitions. Word has length 33 [2021-12-06 17:43:13,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:13,308 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 239 transitions. [2021-12-06 17:43:13,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:13,308 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 239 transitions. [2021-12-06 17:43:13,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-06 17:43:13,308 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:13,308 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:13,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-12-06 17:43:13,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:43:13,509 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:43:13,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:13,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1630210808, now seen corresponding path program 1 times [2021-12-06 17:43:13,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:43:13,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447774021] [2021-12-06 17:43:13,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:13,511 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:43:13,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:43:13,512 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:43:13,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-06 17:43:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:13,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 17:43:13,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:43:13,736 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 20 treesize of output 8 [2021-12-06 17:43:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:13,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:43:13,837 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-12-06 17:43:13,838 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 20 treesize of output 15 [2021-12-06 17:43:13,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:13,848 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:43:13,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1447774021] [2021-12-06 17:43:13,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1447774021] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:43:13,848 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:43:13,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-12-06 17:43:13,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233787118] [2021-12-06 17:43:13,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:43:13,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 17:43:13,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:43:13,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 17:43:13,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:43:13,850 INFO L87 Difference]: Start difference. First operand 208 states and 239 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:14,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:14,599 INFO L93 Difference]: Finished difference Result 298 states and 332 transitions. [2021-12-06 17:43:14,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 17:43:14,599 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-06 17:43:14,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:14,601 INFO L225 Difference]: With dead ends: 298 [2021-12-06 17:43:14,601 INFO L226 Difference]: Without dead ends: 298 [2021-12-06 17:43:14,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2021-12-06 17:43:14,601 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 254 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:14,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 474 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 17:43:14,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-12-06 17:43:14,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 257. [2021-12-06 17:43:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 236 states have (on average 1.2796610169491525) internal successors, (302), 256 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 302 transitions. [2021-12-06 17:43:14,605 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 302 transitions. Word has length 33 [2021-12-06 17:43:14,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:14,606 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 302 transitions. [2021-12-06 17:43:14,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:14,606 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 302 transitions. [2021-12-06 17:43:14,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-06 17:43:14,606 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:14,606 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:14,614 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2021-12-06 17:43:14,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:43:14,807 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:43:14,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:14,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1399931191, now seen corresponding path program 1 times [2021-12-06 17:43:14,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:43:14,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059788980] [2021-12-06 17:43:14,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:14,809 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:43:14,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:43:14,810 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:43:14,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-06 17:43:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:14,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-06 17:43:14,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:43:15,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:43:15,033 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 17:43:15,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2021-12-06 17:43:15,054 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 17:43:15,115 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:43:15,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2021-12-06 17:43:15,203 INFO L354 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2021-12-06 17:43:15,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 63 [2021-12-06 17:43:15,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:15,284 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 52 treesize of output 39 [2021-12-06 17:43:15,532 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:43:15,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 60 [2021-12-06 17:43:15,612 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:43:15,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 60 [2021-12-06 17:43:15,647 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:43:15,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 62 [2021-12-06 17:43:15,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 36 [2021-12-06 17:43:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:16,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:43:16,122 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (_ bv1 1)))) is different from false [2021-12-06 17:43:16,129 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (_ bv1 1)))) is different from false [2021-12-06 17:43:16,143 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))))))) is different from false [2021-12-06 17:43:16,341 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_859 (_ BitVec 1)) (v_ArrVal_864 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_859) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_864) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))))) is different from false [2021-12-06 17:43:16,359 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_859 (_ BitVec 1)) (v_ArrVal_864 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_859) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_864) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))))) is different from false [2021-12-06 17:43:16,388 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_859 (_ BitVec 1)) (v_ArrVal_864 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_859) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_858))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_864) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))))))) (_ bv1 1))))) is different from false [2021-12-06 17:43:16,406 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_859 (_ BitVec 1)) (v_ArrVal_864 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_859) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) v_ArrVal_858))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_864) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))))) is different from false [2021-12-06 17:43:16,431 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:43:16,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 55 [2021-12-06 17:43:16,434 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:43:16,435 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 78 treesize of output 74 [2021-12-06 17:43:16,438 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:43:16,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-12-06 17:43:16,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2021-12-06 17:43:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-06 17:43:18,887 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:43:18,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059788980] [2021-12-06 17:43:18,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059788980] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:43:18,887 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:43:18,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 28 [2021-12-06 17:43:18,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479161892] [2021-12-06 17:43:18,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:43:18,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-06 17:43:18,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:43:18,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-06 17:43:18,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=377, Unknown=9, NotChecked=322, Total=812 [2021-12-06 17:43:18,888 INFO L87 Difference]: Start difference. First operand 257 states and 302 transitions. Second operand has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 29 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 17:43:20,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:20,294 INFO L93 Difference]: Finished difference Result 389 states and 453 transitions. [2021-12-06 17:43:20,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-06 17:43:20,294 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 29 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) Word has length 34 [2021-12-06 17:43:20,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:20,296 INFO L225 Difference]: With dead ends: 389 [2021-12-06 17:43:20,296 INFO L226 Difference]: Without dead ends: 389 [2021-12-06 17:43:20,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 37 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=210, Invalid=801, Unknown=9, NotChecked=462, Total=1482 [2021-12-06 17:43:20,297 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 229 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 2772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2360 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:20,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 1185 Invalid, 2772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 387 Invalid, 0 Unknown, 2360 Unchecked, 0.7s Time] [2021-12-06 17:43:20,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-12-06 17:43:20,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 278. [2021-12-06 17:43:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 257 states have (on average 1.2801556420233462) internal successors, (329), 277 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 329 transitions. [2021-12-06 17:43:20,301 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 329 transitions. Word has length 34 [2021-12-06 17:43:20,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:20,301 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 329 transitions. [2021-12-06 17:43:20,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 29 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 17:43:20,301 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 329 transitions. [2021-12-06 17:43:20,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-06 17:43:20,301 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:20,302 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:20,309 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2021-12-06 17:43:20,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:43:20,502 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:43:20,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:20,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1399931192, now seen corresponding path program 1 times [2021-12-06 17:43:20,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:43:20,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417951132] [2021-12-06 17:43:20,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:20,505 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:43:20,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:43:20,508 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:43:20,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-12-06 17:43:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:20,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-06 17:43:20,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:43:20,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:43:20,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:43:20,720 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 17:43:20,721 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 24 treesize of output 31 [2021-12-06 17:43:20,758 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 17:43:20,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:43:20,868 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:43:20,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2021-12-06 17:43:20,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-06 17:43:20,971 INFO L354 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2021-12-06 17:43:20,971 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 1 case distinctions, treesize of input 18 treesize of output 30 [2021-12-06 17:43:20,997 INFO L354 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-12-06 17:43:20,998 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 29 treesize of output 31 [2021-12-06 17:43:21,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:21,064 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 43 treesize of output 30 [2021-12-06 17:43:21,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:21,083 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 21 treesize of output 20 [2021-12-06 17:43:21,274 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:43:21,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:43:21,282 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 17:43:21,298 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:43:21,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 49 [2021-12-06 17:43:21,390 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:43:21,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 49 [2021-12-06 17:43:21,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:21,406 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 16 treesize of output 18 [2021-12-06 17:43:21,426 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:43:21,426 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 64 treesize of output 57 [2021-12-06 17:43:21,431 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 20 treesize of output 22 [2021-12-06 17:43:21,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:43:21,686 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:43:21,686 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 45 treesize of output 21 [2021-12-06 17:43:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:21,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:43:22,080 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_937 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_937) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) (forall ((v_ArrVal_937 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_937) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2021-12-06 17:43:22,161 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_937 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_937) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_937 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_937) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) is different from false [2021-12-06 17:43:22,191 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_937 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_937) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_937 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_937) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) is different from false [2021-12-06 17:43:22,247 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_930 (_ BitVec 32)) (v_ArrVal_937 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_930)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_937) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_930 (_ BitVec 32)) (v_ArrVal_937 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_930)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_937) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) is different from false [2021-12-06 17:43:22,600 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|))) (and (forall ((v_ArrVal_930 (_ BitVec 32)) (v_ArrVal_937 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_930)) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_937) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_930 (_ BitVec 32)) (v_ArrVal_937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_928 (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_930)) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_937) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_928) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))))) is different from false [2021-12-06 17:43:23,036 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|))) (and (forall ((v_ArrVal_930 (_ BitVec 32)) (v_ArrVal_926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_937 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) v_ArrVal_926))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_930))) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_937) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_930 (_ BitVec 32)) (v_ArrVal_926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_928 (_ BitVec 32))) (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (bvule (bvadd (_ bv4 32) (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_926))) (store .cse3 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_930))) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_937) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_928) (select (select (store (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_927))) (store .cse6 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))))))))) is different from false [2021-12-06 17:43:23,128 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:43:23,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 139 [2021-12-06 17:43:23,150 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:43:23,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 129 [2021-12-06 17:43:23,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:43:23,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 161 [2021-12-06 17:43:23,160 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:43:23,164 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 202 treesize of output 192 [2021-12-06 17:43:23,170 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 261 treesize of output 241 [2021-12-06 17:43:23,177 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 296 treesize of output 280 [2021-12-06 17:43:23,186 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 326 treesize of output 314 [2021-12-06 17:43:23,196 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 388 treesize of output 372 [2021-12-06 17:43:23,201 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 385 treesize of output 377 [2021-12-06 17:43:23,415 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:43:28,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:28,473 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:43:28,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1417951132] [2021-12-06 17:43:28,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1417951132] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:43:28,474 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:43:28,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2021-12-06 17:43:28,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641551220] [2021-12-06 17:43:28,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:43:28,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-06 17:43:28,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:43:28,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-06 17:43:28,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=348, Unknown=12, NotChecked=258, Total=702 [2021-12-06 17:43:28,475 INFO L87 Difference]: Start difference. First operand 278 states and 329 transitions. Second operand has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 27 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 17:43:33,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:33,488 INFO L93 Difference]: Finished difference Result 468 states and 548 transitions. [2021-12-06 17:43:33,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-06 17:43:33,488 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 27 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) Word has length 34 [2021-12-06 17:43:33,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:33,490 INFO L225 Difference]: With dead ends: 468 [2021-12-06 17:43:33,490 INFO L226 Difference]: Without dead ends: 468 [2021-12-06 17:43:33,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=230, Invalid=904, Unknown=12, NotChecked=414, Total=1560 [2021-12-06 17:43:33,491 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 353 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 3088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2025 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:33,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 1089 Invalid, 3088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1020 Invalid, 0 Unknown, 2025 Unchecked, 3.0s Time] [2021-12-06 17:43:33,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-12-06 17:43:33,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 292. [2021-12-06 17:43:33,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 271 states have (on average 1.2767527675276753) internal successors, (346), 291 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:33,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 346 transitions. [2021-12-06 17:43:33,495 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 346 transitions. Word has length 34 [2021-12-06 17:43:33,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:33,496 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 346 transitions. [2021-12-06 17:43:33,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 27 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 17:43:33,496 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 346 transitions. [2021-12-06 17:43:33,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-06 17:43:33,496 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:33,496 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:33,504 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2021-12-06 17:43:33,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:43:33,697 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:43:33,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:33,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1521281985, now seen corresponding path program 1 times [2021-12-06 17:43:33,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:43:33,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913618677] [2021-12-06 17:43:33,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:33,700 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:43:33,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:43:33,702 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:43:33,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-12-06 17:43:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:33,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-06 17:43:33,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:43:33,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:43:34,020 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 17:43:34,020 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 22 treesize of output 29 [2021-12-06 17:43:34,047 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 17:43:34,129 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:43:34,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2021-12-06 17:43:34,215 INFO L354 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2021-12-06 17:43:34,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 64 [2021-12-06 17:43:34,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:34,299 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 52 treesize of output 39 [2021-12-06 17:43:34,565 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:43:34,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 58 [2021-12-06 17:43:34,674 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:43:34,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 58 [2021-12-06 17:43:34,717 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:43:34,718 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 63 treesize of output 58 [2021-12-06 17:43:35,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2021-12-06 17:43:35,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:35,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:43:35,378 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))))) (_ bv1 1)))) is different from false [2021-12-06 17:43:35,464 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_21| (_ BitVec 32)) (v_ArrVal_998 (_ BitVec 1))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_998) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))))) (_ bv1 1))))) is different from false [2021-12-06 17:43:35,480 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_21| (_ BitVec 32)) (v_ArrVal_998 (_ BitVec 1))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_998) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|))))) is different from false [2021-12-06 17:43:35,509 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_21| (_ BitVec 32)) (v_ArrVal_997 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_998 (_ BitVec 1))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_998) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_997))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))))))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|))))) is different from false [2021-12-06 17:43:35,529 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_21| (_ BitVec 32)) (v_ArrVal_997 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_998 (_ BitVec 1))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_998) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) v_ArrVal_997))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))))))))))))))) (_ bv1 1))))) is different from false [2021-12-06 17:43:35,558 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:43:35,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 59 [2021-12-06 17:43:35,560 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:43:35,562 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 86 treesize of output 82 [2021-12-06 17:43:35,565 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:43:35,567 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 33 treesize of output 29 [2021-12-06 17:43:35,571 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 77 treesize of output 69 [2021-12-06 17:43:37,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-06 17:43:37,949 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:43:37,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913618677] [2021-12-06 17:43:37,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913618677] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:43:37,949 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:43:37,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2021-12-06 17:43:37,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772223474] [2021-12-06 17:43:37,950 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:43:37,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-06 17:43:37,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:43:37,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-06 17:43:37,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=375, Unknown=7, NotChecked=220, Total=702 [2021-12-06 17:43:37,951 INFO L87 Difference]: Start difference. First operand 292 states and 346 transitions. Second operand has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 27 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 17:43:38,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:38,760 INFO L93 Difference]: Finished difference Result 335 states and 394 transitions. [2021-12-06 17:43:38,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-06 17:43:38,761 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 27 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) Word has length 34 [2021-12-06 17:43:38,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:38,762 INFO L225 Difference]: With dead ends: 335 [2021-12-06 17:43:38,762 INFO L226 Difference]: Without dead ends: 335 [2021-12-06 17:43:38,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=145, Invalid=570, Unknown=7, NotChecked=270, Total=992 [2021-12-06 17:43:38,763 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 57 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 947 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:38,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 1040 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 269 Invalid, 0 Unknown, 947 Unchecked, 0.5s Time] [2021-12-06 17:43:38,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-12-06 17:43:38,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 280. [2021-12-06 17:43:38,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 259 states have (on average 1.274131274131274) internal successors, (330), 279 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 330 transitions. [2021-12-06 17:43:38,767 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 330 transitions. Word has length 34 [2021-12-06 17:43:38,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:38,767 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 330 transitions. [2021-12-06 17:43:38,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 27 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 17:43:38,767 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 330 transitions. [2021-12-06 17:43:38,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-06 17:43:38,768 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:38,768 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:38,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2021-12-06 17:43:38,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:43:38,969 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:43:38,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:38,970 INFO L85 PathProgramCache]: Analyzing trace with hash 956849775, now seen corresponding path program 1 times [2021-12-06 17:43:38,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:43:38,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035223693] [2021-12-06 17:43:38,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:38,971 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:43:38,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:43:38,973 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:43:38,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-12-06 17:43:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:39,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-06 17:43:39,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:43:39,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:43:39,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:43:39,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:39,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 17:43:39,224 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:43:39,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2021-12-06 17:43:39,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:43:39,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:39,258 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 21 treesize of output 20 [2021-12-06 17:43:39,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-06 17:43:39,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 17:43:39,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 17:43:39,372 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:43:39,372 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 19 treesize of output 19 [2021-12-06 17:43:39,398 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 17:43:39,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 17:43:39,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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 17:43:39,473 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 16 treesize of output 18 [2021-12-06 17:43:39,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:43:39,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:39,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:43:39,640 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1073 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1073) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:43:39,647 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1073 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1073) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:43:39,658 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1073 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1072) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1073) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:43:39,747 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1073 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_12| (_ BitVec 32))) (or (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1072) |v_ULTIMATE.start_main_#t~malloc10#1.base_12| v_ArrVal_1073) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_12|)))))) is different from false [2021-12-06 17:43:39,788 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1073 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_12| (_ BitVec 32))) (or (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1072) |v_ULTIMATE.start_main_#t~malloc10#1.base_12| v_ArrVal_1073) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_12|)))))) is different from false [2021-12-06 17:43:39,810 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-06 17:43:39,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2021-12-06 17:43:39,827 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1073 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_12| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_12|) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1072) |v_ULTIMATE.start_main_#t~malloc10#1.base_12| v_ArrVal_1073) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2021-12-06 17:43:39,861 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1073 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_12| (_ BitVec 32)) (v_ArrVal_1064 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_12|) (not (= (_ bv2 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1064)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1072) |v_ULTIMATE.start_main_#t~malloc10#1.base_12| v_ArrVal_1073) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2021-12-06 17:43:39,917 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_24|)))) (forall ((v_ArrVal_1072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1073 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_12| (_ BitVec 32)) (v_ArrVal_1064 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_12|) (not (= (_ bv2 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1064)) |v_ULTIMATE.start_main_#t~malloc7#1.base_24| v_ArrVal_1072) |v_ULTIMATE.start_main_#t~malloc10#1.base_12| v_ArrVal_1073) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2021-12-06 17:43:39,958 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1073 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_12| (_ BitVec 32)) (v_ArrVal_1064 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_24|)))) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_12|) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1064)) |v_ULTIMATE.start_main_#t~malloc7#1.base_24| v_ArrVal_1072) |v_ULTIMATE.start_main_#t~malloc10#1.base_12| v_ArrVal_1073) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32))))) is different from false [2021-12-06 17:43:40,004 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1073 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_12| (_ BitVec 32)) (v_ArrVal_1064 (_ BitVec 32)) (v_ArrVal_1063 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_24|)))) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1063) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1064)) |v_ULTIMATE.start_main_#t~malloc7#1.base_24| v_ArrVal_1072) |v_ULTIMATE.start_main_#t~malloc10#1.base_12| v_ArrVal_1073) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_12|))) is different from false [2021-12-06 17:43:40,047 INFO L354 Elim1Store]: treesize reduction 78, result has 27.1 percent of original size [2021-12-06 17:43:40,048 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 3 case distinctions, treesize of input 34 treesize of output 45 [2021-12-06 17:43:40,051 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:43:40,053 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 39 treesize of output 27 [2021-12-06 17:43:40,055 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 17:43:40,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-06 17:43:40,085 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:43:40,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035223693] [2021-12-06 17:43:40,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2035223693] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:43:40,086 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:43:40,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2021-12-06 17:43:40,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737126423] [2021-12-06 17:43:40,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:43:40,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-06 17:43:40,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:43:40,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-06 17:43:40,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=348, Unknown=12, NotChecked=470, Total=930 [2021-12-06 17:43:40,087 INFO L87 Difference]: Start difference. First operand 280 states and 330 transitions. Second operand has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:47,698 WARN L227 SmtUtils]: Spent 7.01s on a formula simplification. DAG size of input: 40 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 17:43:49,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:49,301 INFO L93 Difference]: Finished difference Result 609 states and 706 transitions. [2021-12-06 17:43:49,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-06 17:43:49,301 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 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 17:43:49,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:49,303 INFO L225 Difference]: With dead ends: 609 [2021-12-06 17:43:49,303 INFO L226 Difference]: Without dead ends: 609 [2021-12-06 17:43:49,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=416, Invalid=1592, Unknown=12, NotChecked=950, Total=2970 [2021-12-06 17:43:49,305 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 647 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 3290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2337 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:49,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [647 Valid, 969 Invalid, 3290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 837 Invalid, 0 Unknown, 2337 Unchecked, 1.4s Time] [2021-12-06 17:43:49,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2021-12-06 17:43:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 295. [2021-12-06 17:43:49,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 274 states have (on average 1.2664233576642336) internal successors, (347), 294 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:49,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 347 transitions. [2021-12-06 17:43:49,310 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 347 transitions. Word has length 34 [2021-12-06 17:43:49,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:49,310 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 347 transitions. [2021-12-06 17:43:49,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:49,310 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 347 transitions. [2021-12-06 17:43:49,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-06 17:43:49,310 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:49,311 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:49,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2021-12-06 17:43:49,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:43:49,512 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:43:49,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:49,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1654366839, now seen corresponding path program 1 times [2021-12-06 17:43:49,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:43:49,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464727682] [2021-12-06 17:43:49,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:49,515 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:43:49,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:43:49,517 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:43:49,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-12-06 17:43:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:49,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-06 17:43:49,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:43:49,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:43:49,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:43:49,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:49,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 17:43:49,755 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:43:49,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2021-12-06 17:43:49,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:43:49,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:49,787 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 21 treesize of output 20 [2021-12-06 17:43:49,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-06 17:43:49,867 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 16 treesize of output 18 [2021-12-06 17:43:49,887 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 16 treesize of output 18 [2021-12-06 17:43:49,903 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:43:49,903 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 22 treesize of output 22 [2021-12-06 17:43:49,932 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 17:43:49,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 17:43:49,987 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 17:43:50,012 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 16 treesize of output 18 [2021-12-06 17:43:50,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:43:50,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:50,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:43:50,179 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1143 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32)))) is different from false [2021-12-06 17:43:50,187 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1143 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1143) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:43:50,199 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1143 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1142) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:43:50,296 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1142 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_15| (_ BitVec 32)) (v_ArrVal_1143 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1142) |v_ULTIMATE.start_main_#t~malloc10#1.base_15| v_ArrVal_1143) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_15|))))) is different from false [2021-12-06 17:43:50,336 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1142 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_15| (_ BitVec 32)) (v_ArrVal_1143 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1142) |v_ULTIMATE.start_main_#t~malloc10#1.base_15| v_ArrVal_1143) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_15|))))) is different from false [2021-12-06 17:43:50,354 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-06 17:43:50,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2021-12-06 17:43:50,367 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1142 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_15| (_ BitVec 32)) (v_ArrVal_1143 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1142) |v_ULTIMATE.start_main_#t~malloc10#1.base_15| v_ArrVal_1143) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_15|))) is different from false [2021-12-06 17:43:50,402 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1136 (_ BitVec 32)) (v_ArrVal_1142 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_15| (_ BitVec 32)) (v_ArrVal_1143 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv2 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1136)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1142) |v_ULTIMATE.start_main_#t~malloc10#1.base_15| v_ArrVal_1143) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_15|))) is different from false [2021-12-06 17:43:50,580 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1136 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_27| (_ BitVec 32)) (v_ArrVal_1142 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_15| (_ BitVec 32)) (v_ArrVal_1143 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_27|)))) (not (= (_ bv2 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1136)) |v_ULTIMATE.start_main_#t~malloc7#1.base_27| v_ArrVal_1142) |v_ULTIMATE.start_main_#t~malloc10#1.base_15| v_ArrVal_1143) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_15|))) is different from false [2021-12-06 17:43:50,632 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1136 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_27| (_ BitVec 32)) (v_ArrVal_1142 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_15| (_ BitVec 32)) (v_ArrVal_1143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1133 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_27|)))) (not (= (_ bv2 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1133) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1136)) |v_ULTIMATE.start_main_#t~malloc7#1.base_27| v_ArrVal_1142) |v_ULTIMATE.start_main_#t~malloc10#1.base_15| v_ArrVal_1143) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_15|))) is different from false [2021-12-06 17:43:50,680 INFO L354 Elim1Store]: treesize reduction 78, result has 27.1 percent of original size [2021-12-06 17:43:50,680 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 3 case distinctions, treesize of input 34 treesize of output 45 [2021-12-06 17:43:50,683 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:43:50,685 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 39 treesize of output 27 [2021-12-06 17:43:50,687 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 17:43:50,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:50,723 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:43:50,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464727682] [2021-12-06 17:43:50,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464727682] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:43:50,723 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:43:50,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2021-12-06 17:43:50,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574506840] [2021-12-06 17:43:50,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:43:50,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-06 17:43:50,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:43:50,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-06 17:43:50,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=380, Unknown=17, NotChecked=432, Total=930 [2021-12-06 17:43:50,725 INFO L87 Difference]: Start difference. First operand 295 states and 347 transitions. Second operand has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:53,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:43:53,126 INFO L93 Difference]: Finished difference Result 447 states and 510 transitions. [2021-12-06 17:43:53,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-06 17:43:53,126 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 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 17:43:53,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:43:53,128 INFO L225 Difference]: With dead ends: 447 [2021-12-06 17:43:53,128 INFO L226 Difference]: Without dead ends: 447 [2021-12-06 17:43:53,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=384, Invalid=1439, Unknown=19, NotChecked=810, Total=2652 [2021-12-06 17:43:53,129 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 332 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1810 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-06 17:43:53,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 867 Invalid, 2946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1064 Invalid, 0 Unknown, 1810 Unchecked, 1.6s Time] [2021-12-06 17:43:53,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2021-12-06 17:43:53,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 287. [2021-12-06 17:43:53,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 266 states have (on average 1.2669172932330828) internal successors, (337), 286 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:53,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 337 transitions. [2021-12-06 17:43:53,134 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 337 transitions. Word has length 34 [2021-12-06 17:43:53,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:43:53,135 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 337 transitions. [2021-12-06 17:43:53,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:43:53,135 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 337 transitions. [2021-12-06 17:43:53,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 17:43:53,135 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:43:53,135 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:43:53,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2021-12-06 17:43:53,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:43:53,337 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:43:53,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:43:53,338 INFO L85 PathProgramCache]: Analyzing trace with hash -199673176, now seen corresponding path program 1 times [2021-12-06 17:43:53,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:43:53,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331258266] [2021-12-06 17:43:53,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:43:53,340 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:43:53,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:43:53,342 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:43:53,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-12-06 17:43:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:43:53,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-06 17:43:53,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:43:53,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:43:53,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:43:53,592 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:43:53,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2021-12-06 17:43:53,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:53,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 17:43:53,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, 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 17:43:53,651 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 20 treesize of output 8 [2021-12-06 17:43:53,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 17:43:53,723 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:43:53,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2021-12-06 17:43:53,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:43:53,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:43:53,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:43:53,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-06 17:43:53,839 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 16 treesize of output 18 [2021-12-06 17:43:53,856 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 16 treesize of output 18 [2021-12-06 17:43:53,865 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 16 treesize of output 18 [2021-12-06 17:43:53,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:43:53,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:53,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:43:54,009 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1212) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-06 17:43:54,027 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1212) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32))) is different from false [2021-12-06 17:43:54,034 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1212) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-06 17:43:54,047 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1207 (_ BitVec 32)) (v_ArrVal_1212 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1207)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1212) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32))) is different from false [2021-12-06 17:43:56,177 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1207 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_30| (_ BitVec 32)) (v_ArrVal_1212 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1207)) |v_ULTIMATE.start_main_#t~malloc7#1.base_30| v_ArrVal_1212) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_30|)))))) is different from false [2021-12-06 17:43:56,201 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1207 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_30| (_ BitVec 32)) (v_ArrVal_1212 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1205 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv2 32) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1205))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1207))) |v_ULTIMATE.start_main_#t~malloc7#1.base_30| v_ArrVal_1212) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_30|)))))) is different from false [2021-12-06 17:43:56,218 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1207 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_30| (_ BitVec 32)) (v_ArrVal_1212 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1205 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv2 32) (select (select (store (let ((.cse0 (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) v_ArrVal_1205))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1207))) |v_ULTIMATE.start_main_#t~malloc7#1.base_30| v_ArrVal_1212) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_30|)))))) is different from false [2021-12-06 17:43:56,251 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-06 17:43:56,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2021-12-06 17:43:56,265 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1203 (_ BitVec 32)) (v_ArrVal_1207 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_30| (_ BitVec 32)) (v_ArrVal_1212 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1205 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_30|) (= (_ bv2 32) (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1203)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1205))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1207))) |v_ULTIMATE.start_main_#t~malloc7#1.base_30| v_ArrVal_1212) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:43:56,412 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-06 17:43:56,412 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 17:43:56,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:43:56,417 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 42 treesize of output 38 [2021-12-06 17:43:56,419 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:43:56,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:43:56,423 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 38 treesize of output 30 [2021-12-06 17:43:56,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:43:56,457 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:43:56,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331258266] [2021-12-06 17:43:56,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331258266] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:43:56,457 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:43:56,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 29 [2021-12-06 17:43:56,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799495666] [2021-12-06 17:43:56,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:43:56,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-06 17:43:56,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:43:56,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-06 17:43:56,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=336, Unknown=16, NotChecked=360, Total=812 [2021-12-06 17:43:56,458 INFO L87 Difference]: Start difference. First operand 287 states and 337 transitions. Second operand has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 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 17:44:05,963 WARN L227 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 48 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 17:44:06,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:06,533 INFO L93 Difference]: Finished difference Result 393 states and 450 transitions. [2021-12-06 17:44:06,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-06 17:44:06,534 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 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) Word has length 36 [2021-12-06 17:44:06,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:06,535 INFO L225 Difference]: With dead ends: 393 [2021-12-06 17:44:06,535 INFO L226 Difference]: Without dead ends: 393 [2021-12-06 17:44:06,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=338, Invalid=1157, Unknown=19, NotChecked=648, Total=2162 [2021-12-06 17:44:06,536 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 434 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 2433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1593 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:44:06,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [434 Valid, 859 Invalid, 2433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 782 Invalid, 0 Unknown, 1593 Unchecked, 1.2s Time] [2021-12-06 17:44:06,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2021-12-06 17:44:06,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 293. [2021-12-06 17:44:06,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 272 states have (on average 1.2647058823529411) internal successors, (344), 292 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:44:06,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 344 transitions. [2021-12-06 17:44:06,540 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 344 transitions. Word has length 36 [2021-12-06 17:44:06,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:06,541 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 344 transitions. [2021-12-06 17:44:06,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 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 17:44:06,541 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 344 transitions. [2021-12-06 17:44:06,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 17:44:06,541 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:06,541 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:44:06,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2021-12-06 17:44:06,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:44:06,742 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:44:06,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:06,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1423076272, now seen corresponding path program 1 times [2021-12-06 17:44:06,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:44:06,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779322559] [2021-12-06 17:44:06,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:06,745 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:44:06,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:44:06,748 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:44:06,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2021-12-06 17:44:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:06,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-06 17:44:06,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:44:06,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:44:06,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:44:06,976 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:44:06,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2021-12-06 17:44:06,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:44:06,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 17:44:07,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:44:07,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2021-12-06 17:44:07,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 17:44:07,098 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:44:07,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-06 17:44:07,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:44:07,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:44:07,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:44:07,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-06 17:44:07,211 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 16 treesize of output 18 [2021-12-06 17:44:07,232 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 16 treesize of output 18 [2021-12-06 17:44:07,242 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 16 treesize of output 18 [2021-12-06 17:44:07,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:44:07,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:44:07,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:44:07,380 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1281) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-06 17:44:07,397 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1281) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32))) is different from false [2021-12-06 17:44:07,404 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1281) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32))) is different from false [2021-12-06 17:44:07,417 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (_ BitVec 32)) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1278)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1281) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-06 17:44:07,519 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (_ BitVec 32)) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_33| (_ BitVec 32))) (or (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1278)) |v_ULTIMATE.start_main_#t~malloc7#1.base_33| v_ArrVal_1281) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_33|)))))) is different from false [2021-12-06 17:44:07,543 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (_ BitVec 32)) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_33| (_ BitVec 32))) (or (= (_ bv2 32) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1274))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1278))) |v_ULTIMATE.start_main_#t~malloc7#1.base_33| v_ArrVal_1281) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_33|)))))) is different from false [2021-12-06 17:44:07,562 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (_ BitVec 32)) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_33| (_ BitVec 32))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) v_ArrVal_1274))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1278))) |v_ULTIMATE.start_main_#t~malloc7#1.base_33| v_ArrVal_1281) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32)) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_33|)))))) is different from false [2021-12-06 17:44:07,595 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-06 17:44:07,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2021-12-06 17:44:07,609 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (_ BitVec 32)) (v_ArrVal_1281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1271 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_33| (_ BitVec 32))) (or (= (_ bv2 32) (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1271)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1274))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1278))) |v_ULTIMATE.start_main_#t~malloc7#1.base_33| v_ArrVal_1281) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_33|))) is different from false [2021-12-06 17:44:07,757 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-06 17:44:07,757 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 17:44:07,761 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:44:07,762 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 42 treesize of output 38 [2021-12-06 17:44:07,764 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:44:07,766 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 21 treesize of output 13 [2021-12-06 17:44:07,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2021-12-06 17:44:07,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:44:07,803 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:44:07,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779322559] [2021-12-06 17:44:07,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779322559] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:44:07,803 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:44:07,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 29 [2021-12-06 17:44:07,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881377915] [2021-12-06 17:44:07,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:44:07,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-06 17:44:07,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:44:07,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-06 17:44:07,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=339, Unknown=13, NotChecked=360, Total=812 [2021-12-06 17:44:07,804 INFO L87 Difference]: Start difference. First operand 293 states and 344 transitions. Second operand has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 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 17:44:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:09,395 INFO L93 Difference]: Finished difference Result 391 states and 449 transitions. [2021-12-06 17:44:09,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 17:44:09,396 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 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) Word has length 36 [2021-12-06 17:44:09,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:09,397 INFO L225 Difference]: With dead ends: 391 [2021-12-06 17:44:09,397 INFO L226 Difference]: Without dead ends: 391 [2021-12-06 17:44:09,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=305, Invalid=1044, Unknown=15, NotChecked=616, Total=1980 [2021-12-06 17:44:09,398 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 512 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 2411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1765 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-06 17:44:09,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [512 Valid, 793 Invalid, 2411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 598 Invalid, 0 Unknown, 1765 Unchecked, 0.9s Time] [2021-12-06 17:44:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-12-06 17:44:09,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 287. [2021-12-06 17:44:09,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 266 states have (on average 1.263157894736842) internal successors, (336), 286 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:44:09,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 336 transitions. [2021-12-06 17:44:09,402 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 336 transitions. Word has length 36 [2021-12-06 17:44:09,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:09,402 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 336 transitions. [2021-12-06 17:44:09,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 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 17:44:09,402 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 336 transitions. [2021-12-06 17:44:09,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 17:44:09,403 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:09,403 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:44:09,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2021-12-06 17:44:09,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:44:09,604 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:44:09,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:09,605 INFO L85 PathProgramCache]: Analyzing trace with hash -2087466742, now seen corresponding path program 1 times [2021-12-06 17:44:09,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:44:09,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894327004] [2021-12-06 17:44:09,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:09,607 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:44:09,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:44:09,609 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:44:09,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2021-12-06 17:44:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:09,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-06 17:44:09,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:44:09,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:44:09,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:44:09,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:44:09,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:44:10,024 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-06 17:44:10,025 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 24 treesize of output 23 [2021-12-06 17:44:10,030 INFO L354 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2021-12-06 17:44:10,031 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 20 treesize of output 12 [2021-12-06 17:44:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:44:10,071 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:44:10,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894327004] [2021-12-06 17:44:10,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894327004] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:44:10,071 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:44:10,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-12-06 17:44:10,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954413299] [2021-12-06 17:44:10,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:44:10,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 17:44:10,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:44:10,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 17:44:10,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-06 17:44:10,072 INFO L87 Difference]: Start difference. First operand 287 states and 336 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:44:11,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:11,117 INFO L93 Difference]: Finished difference Result 381 states and 444 transitions. [2021-12-06 17:44:11,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 17:44:11,117 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-06 17:44:11,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:11,119 INFO L225 Difference]: With dead ends: 381 [2021-12-06 17:44:11,119 INFO L226 Difference]: Without dead ends: 381 [2021-12-06 17:44:11,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2021-12-06 17:44:11,119 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 286 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-06 17:44:11,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 462 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-06 17:44:11,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-12-06 17:44:11,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 314. [2021-12-06 17:44:11,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 293 states have (on average 1.2627986348122866) internal successors, (370), 313 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:44:11,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 370 transitions. [2021-12-06 17:44:11,123 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 370 transitions. Word has length 36 [2021-12-06 17:44:11,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:11,124 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 370 transitions. [2021-12-06 17:44:11,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:44:11,124 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 370 transitions. [2021-12-06 17:44:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 17:44:11,124 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:11,124 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:44:11,131 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (35)] Ended with exit code 0 [2021-12-06 17:44:11,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:44:11,326 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:44:11,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:11,327 INFO L85 PathProgramCache]: Analyzing trace with hash -799151648, now seen corresponding path program 1 times [2021-12-06 17:44:11,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:44:11,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192550198] [2021-12-06 17:44:11,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:11,329 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:44:11,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:44:11,330 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:44:11,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2021-12-06 17:44:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:11,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-06 17:44:11,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:44:11,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:44:11,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:44:11,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:44:11,586 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:44:11,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-06 17:44:11,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:44:11,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:44:11,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:44:11,626 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 21 treesize of output 20 [2021-12-06 17:44:11,750 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:44:11,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:44:11,755 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 17:44:11,770 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:44:11,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:44:11,828 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:44:11,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:44:11,832 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 17:44:11,850 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:44:11,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:44:11,885 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:44:11,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2021-12-06 17:44:11,931 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:44:11,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:44:11,935 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 17:44:11,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:44:11,962 INFO L354 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2021-12-06 17:44:11,962 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 2 case distinctions, treesize of input 38 treesize of output 36 [2021-12-06 17:44:12,153 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-06 17:44:12,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 63 [2021-12-06 17:44:12,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-06 17:44:12,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-06 17:44:12,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:44:12,323 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:44:12,325 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:44:12,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 14 [2021-12-06 17:44:12,329 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:44:12,329 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2021-12-06 17:44:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:44:12,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:44:12,536 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1374) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1373 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1373) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-06 17:44:12,552 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1374) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1373 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1373) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-06 17:44:12,579 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1374 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1374) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1373 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1370) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1373) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-06 17:44:12,757 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:44:12,757 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 1 case distinctions, treesize of input 36 treesize of output 40 [2021-12-06 17:44:12,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-12-06 17:44:12,801 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| (select v_arrayElimArr_13 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|))))) (and (forall ((v_ArrVal_1374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_13) (select v_arrayElimArr_13 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1374) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1373 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1370) (select v_arrayElimArr_13 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1373) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2021-12-06 17:44:12,813 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 30 treesize of output 22 [2021-12-06 17:44:12,850 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 30 treesize of output 22 [2021-12-06 17:44:12,890 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 30 treesize of output 22 [2021-12-06 17:44:12,909 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| (select v_arrayElimArr_13 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|))))) (and (forall ((v_ArrVal_1374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_arrayElimArr_13) (select v_arrayElimArr_13 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1374) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1373 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1370) (select v_arrayElimArr_13 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1373) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:44:12,928 INFO L354 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2021-12-06 17:44:12,928 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 17:44:12,934 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 31 treesize of output 23 [2021-12-06 17:44:12,973 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_99| (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (and (forall ((v_ArrVal_1374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_arrayElimArr_13) (select v_arrayElimArr_13 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_99|)) v_ArrVal_1374) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1373 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1370) (select v_arrayElimArr_13 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_99|)) v_ArrVal_1373) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= |c_ULTIMATE.start_main_~x~0#1.base| (select v_arrayElimArr_13 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_99|))))) is different from false [2021-12-06 17:44:12,981 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 31 treesize of output 23 [2021-12-06 17:44:13,031 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 35 treesize of output 27 [2021-12-06 17:44:13,077 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_99| (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (and (forall ((v_ArrVal_1374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_arrayElimArr_13) (select v_arrayElimArr_13 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_99|)) v_ArrVal_1374) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1373 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1362)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1370) (select v_arrayElimArr_13 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_99|)) v_ArrVal_1373) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= |c_ULTIMATE.start_main_~x~0#1.base| (select v_arrayElimArr_13 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_99|))))) is different from false [2021-12-06 17:44:13,152 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 35 treesize of output 27 [2021-12-06 17:44:13,233 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 35 treesize of output 27 [2021-12-06 17:44:13,299 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 35 treesize of output 27 [2021-12-06 17:44:13,551 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 35 treesize of output 27 [2021-12-06 17:44:13,599 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 35 treesize of output 27 [2021-12-06 17:44:13,642 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_36| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.offset_99| (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_13 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_99|))) (and (forall ((v_ArrVal_1374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_36|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_36| v_arrayElimArr_13) (select v_arrayElimArr_13 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_99|)) v_ArrVal_1374) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1373 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1362 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1362)) |v_ULTIMATE.start_main_#t~malloc7#1.base_36| v_ArrVal_1370) (select v_arrayElimArr_13 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_99|)) v_ArrVal_1373) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_36|))))))) is different from false [2021-12-06 17:44:13,677 INFO L354 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2021-12-06 17:44:13,678 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 65 treesize of output 71 [2021-12-06 17:44:13,682 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:44:13,688 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-06 17:44:13,688 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 78 treesize of output 62 [2021-12-06 17:44:13,713 INFO L354 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2021-12-06 17:44:13,713 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 62 treesize of output 67 [2021-12-06 17:44:13,716 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:44:13,723 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-06 17:44:13,723 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 74 treesize of output 58 [2021-12-06 17:44:13,733 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:44:13,734 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 65 treesize of output 69 [2021-12-06 17:44:13,743 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 21 treesize of output 17 [2021-12-06 17:44:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:44:13,802 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:44:13,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192550198] [2021-12-06 17:44:13,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192550198] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:44:13,802 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:44:13,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2021-12-06 17:44:13,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461304967] [2021-12-06 17:44:13,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:44:13,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-06 17:44:13,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:44:13,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-06 17:44:13,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=385, Unknown=16, NotChecked=376, Total=870 [2021-12-06 17:44:13,803 INFO L87 Difference]: Start difference. First operand 314 states and 370 transitions. Second operand has 30 states, 30 states have (on average 2.3) internal successors, (69), 30 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 17:44:16,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:16,128 INFO L93 Difference]: Finished difference Result 459 states and 525 transitions. [2021-12-06 17:44:16,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-06 17:44:16,128 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.3) internal successors, (69), 30 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) Word has length 36 [2021-12-06 17:44:16,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:16,130 INFO L225 Difference]: With dead ends: 459 [2021-12-06 17:44:16,130 INFO L226 Difference]: Without dead ends: 459 [2021-12-06 17:44:16,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=262, Invalid=1014, Unknown=16, NotChecked=600, Total=1892 [2021-12-06 17:44:16,131 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 279 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 2390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1529 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-06 17:44:16,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 921 Invalid, 2390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 802 Invalid, 0 Unknown, 1529 Unchecked, 1.3s Time] [2021-12-06 17:44:16,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-12-06 17:44:16,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 315. [2021-12-06 17:44:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 294 states have (on average 1.2653061224489797) internal successors, (372), 314 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:44:16,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 372 transitions. [2021-12-06 17:44:16,135 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 372 transitions. Word has length 36 [2021-12-06 17:44:16,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:16,135 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 372 transitions. [2021-12-06 17:44:16,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.3) internal successors, (69), 30 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 17:44:16,135 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 372 transitions. [2021-12-06 17:44:16,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 17:44:16,136 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:16,136 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:44:16,143 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (36)] Ended with exit code 0 [2021-12-06 17:44:16,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:44:16,336 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:44:16,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:16,336 INFO L85 PathProgramCache]: Analyzing trace with hash 782968427, now seen corresponding path program 1 times [2021-12-06 17:44:16,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:44:16,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697426294] [2021-12-06 17:44:16,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:16,337 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:44:16,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:44:16,338 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:44:16,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2021-12-06 17:44:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:16,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-06 17:44:16,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:44:16,485 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-06 17:44:16,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2021-12-06 17:44:16,622 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-12-06 17:44:16,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 53 [2021-12-06 17:44:16,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:44:17,159 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:44:17,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 52 [2021-12-06 17:44:17,397 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:44:17,397 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 52 [2021-12-06 17:44:17,485 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:44:17,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 52 [2021-12-06 17:44:18,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 34 [2021-12-06 17:44:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:44:19,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:44:19,239 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1427) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))))))))))))))))) is different from false [2021-12-06 17:44:19,260 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1427) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 17:44:19,336 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:44:19,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2021-12-06 17:44:19,345 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:44:19,345 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 76 treesize of output 79 [2021-12-06 17:44:19,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2021-12-06 17:44:32,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:44:32,684 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:44:32,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697426294] [2021-12-06 17:44:32,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1697426294] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:44:32,684 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:44:32,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2021-12-06 17:44:32,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252312716] [2021-12-06 17:44:32,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:44:32,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-06 17:44:32,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:44:32,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-06 17:44:32,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=344, Unknown=7, NotChecked=78, Total=506 [2021-12-06 17:44:32,685 INFO L87 Difference]: Start difference. First operand 315 states and 372 transitions. Second operand has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 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 17:44:33,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:33,033 INFO L93 Difference]: Finished difference Result 363 states and 423 transitions. [2021-12-06 17:44:33,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 17:44:33,034 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 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 36 [2021-12-06 17:44:33,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:33,035 INFO L225 Difference]: With dead ends: 363 [2021-12-06 17:44:33,035 INFO L226 Difference]: Without dead ends: 363 [2021-12-06 17:44:33,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=113, Invalid=488, Unknown=7, NotChecked=94, Total=702 [2021-12-06 17:44:33,036 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 102 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 588 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:44:33,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 912 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 588 Unchecked, 0.1s Time] [2021-12-06 17:44:33,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-12-06 17:44:33,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 333. [2021-12-06 17:44:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 312 states have (on average 1.2596153846153846) internal successors, (393), 332 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:44:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 393 transitions. [2021-12-06 17:44:33,040 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 393 transitions. Word has length 36 [2021-12-06 17:44:33,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:33,040 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 393 transitions. [2021-12-06 17:44:33,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 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 17:44:33,040 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 393 transitions. [2021-12-06 17:44:33,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 17:44:33,040 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:33,041 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:44:33,048 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (37)] Ended with exit code 0 [2021-12-06 17:44:33,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:44:33,242 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:44:33,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:33,243 INFO L85 PathProgramCache]: Analyzing trace with hash 782968428, now seen corresponding path program 1 times [2021-12-06 17:44:33,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:44:33,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733763051] [2021-12-06 17:44:33,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:33,245 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:44:33,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:44:33,247 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:44:33,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2021-12-06 17:44:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:33,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-06 17:44:33,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:44:33,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:44:33,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:44:33,444 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:44:33,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-06 17:44:33,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:44:33,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:44:33,566 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:44:33,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:44:33,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:44:33,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-06 17:44:33,602 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:44:33,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:44:33,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:44:33,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-06 17:44:33,628 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:44:33,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-06 17:44:33,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-06 17:44:33,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-06 17:44:33,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:44:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:44:33,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:44:34,237 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1484 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1484) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_1485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1484 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1484) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1485) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:44:34,314 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1484 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1484) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_1485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1484 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1484) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1485) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:44:34,343 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1484 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1484) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1485) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_1484 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1484) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32)))))) is different from false [2021-12-06 17:44:34,370 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:44:34,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2021-12-06 17:44:34,383 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:44:34,383 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 44 treesize of output 43 [2021-12-06 17:44:34,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 15 treesize of output 11 [2021-12-06 17:44:34,450 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:44:34,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-06 17:44:34,461 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:44:34,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-06 17:44:34,464 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:44:34,466 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-06 17:44:34,469 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:44:34,472 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-06 17:44:34,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:44:34,649 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:44:34,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733763051] [2021-12-06 17:44:34,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733763051] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:44:34,650 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:44:34,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-12-06 17:44:34,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438188267] [2021-12-06 17:44:34,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:44:34,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-06 17:44:34,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:44:34,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-06 17:44:34,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=260, Unknown=3, NotChecked=102, Total=420 [2021-12-06 17:44:34,651 INFO L87 Difference]: Start difference. First operand 333 states and 393 transitions. Second operand has 21 states, 20 states have (on average 3.25) internal successors, (65), 21 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 17:44:38,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:38,769 INFO L93 Difference]: Finished difference Result 548 states and 642 transitions. [2021-12-06 17:44:38,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-06 17:44:38,769 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.25) internal successors, (65), 21 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) Word has length 36 [2021-12-06 17:44:38,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:38,771 INFO L225 Difference]: With dead ends: 548 [2021-12-06 17:44:38,771 INFO L226 Difference]: Without dead ends: 548 [2021-12-06 17:44:38,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=178, Invalid=701, Unknown=3, NotChecked=174, Total=1056 [2021-12-06 17:44:38,772 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 403 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 855 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-12-06 17:44:38,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [403 Valid, 815 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1026 Invalid, 0 Unknown, 855 Unchecked, 2.7s Time] [2021-12-06 17:44:38,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2021-12-06 17:44:38,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 408. [2021-12-06 17:44:38,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 387 states have (on average 1.2532299741602067) internal successors, (485), 407 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:44:38,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 485 transitions. [2021-12-06 17:44:38,777 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 485 transitions. Word has length 36 [2021-12-06 17:44:38,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:38,777 INFO L470 AbstractCegarLoop]: Abstraction has 408 states and 485 transitions. [2021-12-06 17:44:38,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.25) internal successors, (65), 21 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 17:44:38,777 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 485 transitions. [2021-12-06 17:44:38,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 17:44:38,778 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:38,778 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:44:38,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (38)] Ended with exit code 0 [2021-12-06 17:44:38,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:44:38,979 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:44:38,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:38,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1037341555, now seen corresponding path program 1 times [2021-12-06 17:44:38,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:44:38,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197592426] [2021-12-06 17:44:38,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:38,982 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:44:38,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:44:38,984 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:44:38,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2021-12-06 17:44:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:39,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-06 17:44:39,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:44:39,265 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-06 17:44:39,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2021-12-06 17:44:39,415 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-12-06 17:44:39,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 57 [2021-12-06 17:44:39,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:44:40,159 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:44:40,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 53 [2021-12-06 17:44:40,556 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:44:40,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 52 [2021-12-06 17:44:40,678 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:44:40,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 54 [2021-12-06 17:44:42,504 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 55 treesize of output 39 [2021-12-06 17:44:43,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:44:43,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:44:43,264 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1538) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))))) (_ bv1 1)))) is different from false [2021-12-06 17:44:43,335 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1538) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))))) (_ bv1 1)))) is different from false [2021-12-06 17:44:43,343 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1538) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))))) (_ bv1 1)))) is different from false [2021-12-06 17:44:43,353 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:44:43,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-06 17:44:43,360 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:44:43,360 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 58 treesize of output 61 [2021-12-06 17:44:43,364 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 23 treesize of output 21 [2021-12-06 17:44:46,102 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_311 (_ BitVec 32)) (v_ArrVal_1533 (_ BitVec 1)) (v_arrayElimCell_309 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_45| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_45| v_ArrVal_1533))) (or (and (not (= v_arrayElimCell_309 |v_ULTIMATE.start_main_#t~malloc7#1.base_45|)) (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select .cse0 v_arrayElimCell_311))))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_45|))) (not (= (_ bv0 1) (bvadd (bvneg v_ArrVal_1533) (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select .cse0 v_arrayElimCell_309))))))))))))) (_ bv1 1))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_45|)))))) is different from false [2021-12-06 17:44:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-06 17:44:50,266 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:44:50,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197592426] [2021-12-06 17:44:50,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197592426] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:44:50,266 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:44:50,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 23 [2021-12-06 17:44:50,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019323844] [2021-12-06 17:44:50,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:44:50,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-06 17:44:50,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:44:50,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-06 17:44:50,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=313, Unknown=7, NotChecked=156, Total=552 [2021-12-06 17:44:50,268 INFO L87 Difference]: Start difference. First operand 408 states and 485 transitions. Second operand has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 24 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 17:44:50,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:50,778 INFO L93 Difference]: Finished difference Result 438 states and 514 transitions. [2021-12-06 17:44:50,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 17:44:50,779 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 24 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 36 [2021-12-06 17:44:50,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:50,780 INFO L225 Difference]: With dead ends: 438 [2021-12-06 17:44:50,780 INFO L226 Difference]: Without dead ends: 438 [2021-12-06 17:44:50,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=101, Invalid=414, Unknown=7, NotChecked=180, Total=702 [2021-12-06 17:44:50,781 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 115 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 686 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:44:50,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 663 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 123 Invalid, 0 Unknown, 686 Unchecked, 0.2s Time] [2021-12-06 17:44:50,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-12-06 17:44:50,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 390. [2021-12-06 17:44:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 369 states have (on average 1.2574525745257452) internal successors, (464), 389 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:44:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 464 transitions. [2021-12-06 17:44:50,785 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 464 transitions. Word has length 36 [2021-12-06 17:44:50,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:50,786 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 464 transitions. [2021-12-06 17:44:50,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 24 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 17:44:50,786 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 464 transitions. [2021-12-06 17:44:50,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-06 17:44:50,786 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:50,786 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:44:50,794 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (39)] Ended with exit code 0 [2021-12-06 17:44:50,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:44:50,988 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:44:50,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:50,989 INFO L85 PathProgramCache]: Analyzing trace with hash -286960362, now seen corresponding path program 1 times [2021-12-06 17:44:50,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:44:50,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272293660] [2021-12-06 17:44:50,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:50,990 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:44:50,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:44:50,993 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:44:50,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2021-12-06 17:44:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:51,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-06 17:44:51,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:44:51,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 17:44:51,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:44:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 17:44:51,580 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:44:51,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272293660] [2021-12-06 17:44:51,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272293660] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:44:51,580 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:44:51,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-12-06 17:44:51,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090660528] [2021-12-06 17:44:51,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:44:51,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:44:51,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:44:51,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:44:51,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:44:51,581 INFO L87 Difference]: Start difference. First operand 390 states and 464 transitions. Second operand has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 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 17:44:51,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:51,590 INFO L93 Difference]: Finished difference Result 420 states and 494 transitions. [2021-12-06 17:44:51,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 17:44:51,590 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 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) Word has length 37 [2021-12-06 17:44:51,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:51,591 INFO L225 Difference]: With dead ends: 420 [2021-12-06 17:44:51,592 INFO L226 Difference]: Without dead ends: 392 [2021-12-06 17:44:51,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:44:51,592 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 2 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:44:51,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 285 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 127 Unchecked, 0.0s Time] [2021-12-06 17:44:51,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-12-06 17:44:51,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2021-12-06 17:44:51,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 371 states have (on average 1.256064690026954) internal successors, (466), 391 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:44:51,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 466 transitions. [2021-12-06 17:44:51,596 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 466 transitions. Word has length 37 [2021-12-06 17:44:51,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:51,596 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 466 transitions. [2021-12-06 17:44:51,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 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 17:44:51,596 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 466 transitions. [2021-12-06 17:44:51,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-06 17:44:51,597 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:51,597 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:44:51,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2021-12-06 17:44:51,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:44:51,798 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:44:51,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:51,799 INFO L85 PathProgramCache]: Analyzing trace with hash 392115214, now seen corresponding path program 1 times [2021-12-06 17:44:51,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:44:51,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287218766] [2021-12-06 17:44:51,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:51,801 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:44:51,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:44:51,803 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:44:51,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2021-12-06 17:44:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:51,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-06 17:44:51,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:44:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 17:44:52,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:44:54,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 17:44:54,250 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:44:54,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287218766] [2021-12-06 17:44:54,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1287218766] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:44:54,250 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:44:54,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-12-06 17:44:54,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576450792] [2021-12-06 17:44:54,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:44:54,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:44:54,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:44:54,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:44:54,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2021-12-06 17:44:54,251 INFO L87 Difference]: Start difference. First operand 392 states and 466 transitions. Second operand has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 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 17:44:54,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:44:54,260 INFO L93 Difference]: Finished difference Result 404 states and 477 transitions. [2021-12-06 17:44:54,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 17:44:54,261 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 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) Word has length 37 [2021-12-06 17:44:54,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:44:54,262 INFO L225 Difference]: With dead ends: 404 [2021-12-06 17:44:54,262 INFO L226 Difference]: Without dead ends: 376 [2021-12-06 17:44:54,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2021-12-06 17:44:54,262 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 2 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:44:54,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 289 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 139 Unchecked, 0.0s Time] [2021-12-06 17:44:54,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-12-06 17:44:54,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 374. [2021-12-06 17:44:54,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 353 states have (on average 1.2662889518413598) internal successors, (447), 373 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:44:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 447 transitions. [2021-12-06 17:44:54,268 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 447 transitions. Word has length 37 [2021-12-06 17:44:54,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:44:54,268 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 447 transitions. [2021-12-06 17:44:54,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 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 17:44:54,268 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 447 transitions. [2021-12-06 17:44:54,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-06 17:44:54,269 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:44:54,269 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:44:54,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2021-12-06 17:44:54,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:44:54,470 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:44:54,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:44:54,472 INFO L85 PathProgramCache]: Analyzing trace with hash 859975415, now seen corresponding path program 1 times [2021-12-06 17:44:54,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:44:54,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160994568] [2021-12-06 17:44:54,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:44:54,474 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:44:54,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:44:54,476 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:44:54,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2021-12-06 17:44:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:44:54,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-06 17:44:54,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:44:54,755 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-06 17:44:54,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2021-12-06 17:44:54,816 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-12-06 17:44:54,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 51 [2021-12-06 17:44:54,876 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 17:44:55,059 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:44:55,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2021-12-06 17:44:55,261 INFO L354 Elim1Store]: treesize reduction 85, result has 36.6 percent of original size [2021-12-06 17:44:55,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 62 treesize of output 95 [2021-12-06 17:44:55,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:44:55,639 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 70 treesize of output 51 [2021-12-06 17:44:57,249 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:44:57,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 94 [2021-12-06 17:44:57,935 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:44:57,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 96 [2021-12-06 17:44:58,349 INFO L354 Elim1Store]: treesize reduction 74, result has 44.8 percent of original size [2021-12-06 17:44:58,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 68 treesize of output 112 [2021-12-06 17:44:59,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:44:59,719 INFO L354 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2021-12-06 17:44:59,720 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 2 case distinctions, treesize of input 117 treesize of output 83 [2021-12-06 17:45:04,635 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-06 17:45:04,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 211 treesize of output 180 [2021-12-06 17:45:04,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 42 [2021-12-06 17:45:04,842 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 54 treesize of output 34 [2021-12-06 17:45:10,105 INFO L354 Elim1Store]: treesize reduction 96, result has 20.7 percent of original size [2021-12-06 17:45:10,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 337 treesize of output 208 [2021-12-06 17:45:12,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:45:12,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:45:12,823 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1660 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1660) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (_ bv1 1)))) is different from false [2021-12-06 17:45:12,833 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1660 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1660) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (_ bv1 1)))) is different from false [2021-12-06 17:45:13,317 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_28| (_ BitVec 32)) (v_ArrVal_1660 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_ArrVal_1657 (_ BitVec 1))) (or (not (= (_ bv0 1) (bvadd (bvneg v_ArrVal_1657) (_ bv1 1)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_ArrVal_1657) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc10#1.base_28|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_28| v_ArrVal_1660) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_28|))))) is different from false [2021-12-06 17:45:13,331 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:45:13,331 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 1 case distinctions, treesize of input 33 treesize of output 37 [2021-12-06 17:45:13,371 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1660 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1657 (_ BitVec 1))) (let ((.cse0 (select v_arrayElimArr_21 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| .cse0 v_ArrVal_1657) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_21) .cse0 v_ArrVal_1660) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvadd (bvneg v_ArrVal_1657) (_ bv1 1)))) (not (= (_ bv0 1) (select |c_#valid| .cse0)))))) is different from false [2021-12-06 17:45:13,457 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1660 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1657 (_ BitVec 1))) (let ((.cse0 (select v_arrayElimArr_21 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)))) (or (not (= (_ bv0 1) (bvadd (bvneg v_ArrVal_1657) (_ bv1 1)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| .cse0 v_ArrVal_1657) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_21) .cse0 v_ArrVal_1660) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))))) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| .cse0)))))) is different from false [2021-12-06 17:45:13,502 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1660 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1657 (_ BitVec 1))) (let ((.cse0 (select v_arrayElimArr_21 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)))) (or (not (= (_ bv0 1) (bvadd (bvneg v_ArrVal_1657) (_ bv1 1)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| .cse0 v_ArrVal_1657) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_arrayElimArr_21) .cse0 v_ArrVal_1660) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| .cse0)))))) is different from false [2021-12-06 17:45:13,549 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_131| (_ BitVec 32)) (v_ArrVal_1660 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1657 (_ BitVec 1))) (let ((.cse0 (select v_arrayElimArr_21 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_131|)))) (or (not (= (_ bv0 1) (bvadd (bvneg v_ArrVal_1657) (_ bv1 1)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| .cse0 v_ArrVal_1657) (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_arrayElimArr_21) .cse0 v_ArrVal_1660) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| .cse0)))))) is different from false [2021-12-06 17:45:13,978 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_131| (_ BitVec 32)) (v_ArrVal_1660 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_50| (_ BitVec 32)) (v_ArrVal_1652 (_ BitVec 1)) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1657 (_ BitVec 1))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_50| v_ArrVal_1652)) (.cse1 (select v_arrayElimArr_21 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_131|)))) (or (not (= (_ bv0 1) (bvadd (bvneg v_ArrVal_1657) (_ bv1 1)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store .cse0 .cse1 v_ArrVal_1657) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_50|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_50| v_arrayElimArr_21) .cse1 v_ArrVal_1660) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|)))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_50|)))) (not (= (_ bv0 1) (bvneg (select .cse0 .cse1))))))) is different from false [2021-12-06 17:45:14,158 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_131| (_ BitVec 32)) (v_ArrVal_1660 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_50| (_ BitVec 32)) (v_ArrVal_1652 (_ BitVec 1)) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1657 (_ BitVec 1))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_50| v_ArrVal_1652)) (.cse1 (select v_arrayElimArr_21 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_131|)))) (or (not (= (_ bv0 1) (bvadd (bvneg v_ArrVal_1657) (_ bv1 1)))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|))))) (_ bv1 1)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_50|)))) (not (= (_ bv0 1) (bvneg (select .cse0 .cse1)))) (= (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store .cse0 .cse1 v_ArrVal_1657) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_50|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_50| v_arrayElimArr_21) .cse1 v_ArrVal_1660) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))))))))))))))) (_ bv0 1))))) is different from false [2021-12-06 17:45:14,341 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_131| (_ BitVec 32)) (v_ArrVal_1660 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_50| (_ BitVec 32)) (v_ArrVal_1652 (_ BitVec 1)) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1657 (_ BitVec 1))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_50| v_ArrVal_1652)) (.cse1 (select v_arrayElimArr_21 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_131|)))) (or (not (= (_ bv0 1) (bvadd (bvneg v_ArrVal_1657) (_ bv1 1)))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|))))) (_ bv1 1)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_50|)))) (not (= (_ bv0 1) (bvneg (select .cse0 .cse1)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store .cse0 .cse1 v_ArrVal_1657) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_50|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_50| v_arrayElimArr_21) .cse1 v_ArrVal_1660) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))))))))))))))) (_ bv1 1)))))) is different from false [2021-12-06 17:45:14,524 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_131| (_ BitVec 32)) (v_ArrVal_1651 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1660 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_50| (_ BitVec 32)) (v_ArrVal_1652 (_ BitVec 1)) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1657 (_ BitVec 1))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_50| v_ArrVal_1652)) (.cse1 (select v_arrayElimArr_21 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_131|)))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store .cse0 .cse1 v_ArrVal_1657) (select (select (store (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1651))) (store .cse2 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_50|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_50| v_arrayElimArr_21) .cse1 v_ArrVal_1660) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))))))))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (bvadd (bvneg v_ArrVal_1657) (_ bv1 1)))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|))))) (_ bv1 1)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_50|)))) (not (= (_ bv0 1) (bvneg (select .cse0 .cse1))))))) is different from false [2021-12-06 17:45:14,707 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_131| (_ BitVec 32)) (v_ArrVal_1651 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1660 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_50| (_ BitVec 32)) (v_ArrVal_1652 (_ BitVec 1)) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1657 (_ BitVec 1))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_50| v_ArrVal_1652)) (.cse1 (select v_arrayElimArr_21 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_131|)))) (or (not (= (_ bv0 1) (bvadd (bvneg v_ArrVal_1657) (_ bv1 1)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store .cse0 .cse1 v_ArrVal_1657) (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (store (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) v_ArrVal_1651))) (store .cse2 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_50|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_50| v_arrayElimArr_21) .cse1 v_ArrVal_1660) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))))))))))))))))))))))))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|))))) (_ bv1 1)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_50|)))) (not (= (_ bv0 1) (bvneg (select .cse0 .cse1))))))) is different from false [2021-12-06 17:45:14,929 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:45:14,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 81 [2021-12-06 17:45:14,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:45:14,934 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:45:14,937 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 116 treesize of output 112 [2021-12-06 17:45:14,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 106 [2021-12-06 17:45:14,946 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:45:14,949 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 54 treesize of output 46 [2021-12-06 17:45:14,955 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 94 treesize of output 90 [2021-12-06 17:45:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-06 17:45:21,104 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:45:21,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160994568] [2021-12-06 17:45:21,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160994568] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:45:21,105 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:45:21,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 36 [2021-12-06 17:45:21,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542018108] [2021-12-06 17:45:21,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:45:21,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-06 17:45:21,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:45:21,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-06 17:45:21,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=524, Unknown=16, NotChecked=684, Total=1332 [2021-12-06 17:45:21,106 INFO L87 Difference]: Start difference. First operand 374 states and 447 transitions. Second operand has 37 states, 36 states have (on average 2.111111111111111) internal successors, (76), 37 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 17:45:27,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:45:27,177 INFO L93 Difference]: Finished difference Result 610 states and 739 transitions. [2021-12-06 17:45:27,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-06 17:45:27,177 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.111111111111111) internal successors, (76), 37 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) Word has length 38 [2021-12-06 17:45:27,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:45:27,179 INFO L225 Difference]: With dead ends: 610 [2021-12-06 17:45:27,179 INFO L226 Difference]: Without dead ends: 610 [2021-12-06 17:45:27,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 38 SyntacticMatches, 11 SemanticMatches, 62 ConstructedPredicates, 12 IntricatePredicates, 1 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=485, Invalid=2197, Unknown=18, NotChecked=1332, Total=4032 [2021-12-06 17:45:27,181 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 436 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 3725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3398 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-06 17:45:27,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [436 Valid, 881 Invalid, 3725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 283 Invalid, 0 Unknown, 3398 Unchecked, 0.7s Time] [2021-12-06 17:45:27,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2021-12-06 17:45:27,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 393. [2021-12-06 17:45:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 372 states have (on average 1.2634408602150538) internal successors, (470), 392 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:45:27,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 470 transitions. [2021-12-06 17:45:27,186 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 470 transitions. Word has length 38 [2021-12-06 17:45:27,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:45:27,186 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 470 transitions. [2021-12-06 17:45:27,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.111111111111111) internal successors, (76), 37 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 17:45:27,186 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 470 transitions. [2021-12-06 17:45:27,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-06 17:45:27,187 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:45:27,187 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:45:27,195 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (42)] Ended with exit code 0 [2021-12-06 17:45:27,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:45:27,388 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:45:27,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:45:27,389 INFO L85 PathProgramCache]: Analyzing trace with hash 859975416, now seen corresponding path program 1 times [2021-12-06 17:45:27,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:45:27,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595091241] [2021-12-06 17:45:27,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:45:27,391 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:45:27,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:45:27,393 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:45:27,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2021-12-06 17:45:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:27,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-06 17:45:27,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:45:27,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:45:27,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:45:27,803 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 17:45:27,803 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 20 treesize of output 27 [2021-12-06 17:45:27,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:45:27,847 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 17:45:27,953 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:45:27,953 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 64 treesize of output 61 [2021-12-06 17:45:27,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-06 17:45:28,054 INFO L354 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-12-06 17:45:28,054 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 29 treesize of output 31 [2021-12-06 17:45:28,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 20 [2021-12-06 17:45:28,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:45:28,114 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 43 treesize of output 30 [2021-12-06 17:45:28,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:45:28,133 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 21 treesize of output 20 [2021-12-06 17:45:28,367 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:45:28,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 49 [2021-12-06 17:45:28,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:45:28,388 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 16 treesize of output 18 [2021-12-06 17:45:28,435 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:45:28,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 49 [2021-12-06 17:45:28,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:45:28,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 17:45:28,488 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:45:28,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-06 17:45:28,515 INFO L354 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2021-12-06 17:45:28,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 20 [2021-12-06 17:45:28,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:45:28,595 INFO L354 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2021-12-06 17:45:28,596 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 2 case distinctions, treesize of input 64 treesize of output 46 [2021-12-06 17:45:28,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:45:28,629 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 16 treesize of output 18 [2021-12-06 17:45:28,867 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-06 17:45:28,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 92 [2021-12-06 17:45:28,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-06 17:45:28,895 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 29 treesize of output 17 [2021-12-06 17:45:29,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:45:29,371 INFO L354 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2021-12-06 17:45:29,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 40 [2021-12-06 17:45:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:45:29,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:45:29,872 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1746 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1745) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1745) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2021-12-06 17:45:29,900 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1746 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1745) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1745) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) is different from false [2021-12-06 17:45:30,051 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1742 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_ArrVal_1746 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1742) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1745) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1742) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1745) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2021-12-06 17:45:30,132 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_31| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_31|)))) (and (forall ((v_ArrVal_1742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1742) |v_ULTIMATE.start_main_#t~malloc10#1.base_31| v_ArrVal_1745) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1742 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_ArrVal_1746 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1742) |v_ULTIMATE.start_main_#t~malloc10#1.base_31| v_ArrVal_1745) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc10#1.base_31| (_ bv12 32)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc10#1.base_31|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_31| v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))))) is different from false [2021-12-06 17:45:30,155 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:45:30,155 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 1 case distinctions, treesize of input 69 treesize of output 73 [2021-12-06 17:45:30,192 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 49 treesize of output 37 [2021-12-06 17:45:30,233 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_23 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| (select v_arrayElimArr_23 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)))))) (and (forall ((v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_10) (select v_arrayElimArr_23 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)) v_prenex_11) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1746 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_23 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1742) .cse1 v_ArrVal_1745) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (select (store |c_#length| .cse1 (_ bv12 32)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_23) .cse1 v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))))) is different from false [2021-12-06 17:45:30,263 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 49 treesize of output 37 [2021-12-06 17:45:30,319 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 49 treesize of output 37 [2021-12-06 17:45:30,364 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 49 treesize of output 37 [2021-12-06 17:45:30,423 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_23 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| (select v_arrayElimArr_23 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)))))) (and (forall ((v_ArrVal_1742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1746 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_23 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|))) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1742) .cse0 v_ArrVal_1745) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select (store |c_#length| .cse0 (_ bv12 32)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_arrayElimArr_23) .cse0 v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) (forall ((v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_prenex_10) (select v_arrayElimArr_23 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)) v_prenex_11) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))))) is different from false [2021-12-06 17:45:30,459 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 57 treesize of output 45 [2021-12-06 17:45:30,507 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_136| (_ BitVec 32)) (v_arrayElimArr_23 (Array (_ BitVec 32) (_ BitVec 32)))) (or (and (forall ((v_ArrVal_1742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1746 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (select v_arrayElimArr_23 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_136|))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1742) .cse1 v_ArrVal_1745) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (select (store |c_#length| .cse1 (_ bv12 32)) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_23) .cse1 v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (forall ((v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_prenex_10) (select v_arrayElimArr_23 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_136|)) v_prenex_11) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| (select v_arrayElimArr_23 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_136|)))))))) is different from false [2021-12-06 17:45:30,547 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 57 treesize of output 45 [2021-12-06 17:45:30,607 INFO L354 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2021-12-06 17:45:30,608 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 22 treesize of output 21 [2021-12-06 17:45:30,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 49 [2021-12-06 17:45:30,727 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_136| (_ BitVec 32)) (v_arrayElimArr_23 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select v_arrayElimArr_23 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_136|)) |c_ULTIMATE.start_main_~x~0#1.base|) (and (forall ((v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1735 (_ BitVec 32)) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1735)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_prenex_10) (select v_arrayElimArr_23 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_136|)) v_prenex_11) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1735 (_ BitVec 32)) (v_ArrVal_1742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1746 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_23 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_136|))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1735)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1742) .cse1 v_ArrVal_1745) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (select (store |c_#length| .cse1 (_ bv12 32)) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_arrayElimArr_23) .cse1 v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))))) is different from false [2021-12-06 17:45:30,768 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 61 treesize of output 49 [2021-12-06 17:45:30,935 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 61 treesize of output 49 [2021-12-06 17:45:31,223 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 61 treesize of output 49 [2021-12-06 17:45:31,337 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_136| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_53| (_ BitVec 32)) (v_arrayElimArr_23 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_53|)))) (= (select v_arrayElimArr_23 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_136|)) |c_ULTIMATE.start_main_~x~0#1.base|) (and (forall ((v_ArrVal_1732 (_ BitVec 32)) (v_ArrVal_1735 (_ BitVec 32)) (v_ArrVal_1742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1746 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_23 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_136|))) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1735)) |v_ULTIMATE.start_main_#t~malloc7#1.base_53| v_ArrVal_1742) .cse0 v_ArrVal_1745) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select (store (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_53| v_ArrVal_1732) .cse0 (_ bv12 32)) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_53|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_53| v_arrayElimArr_23) .cse0 v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) (forall ((v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1735 (_ BitVec 32)) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1735)) |v_ULTIMATE.start_main_#t~malloc7#1.base_53| v_prenex_10) (select v_arrayElimArr_23 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_136|)) v_prenex_11) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))))) is different from false [2021-12-06 17:45:31,361 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 61 treesize of output 49 [2021-12-06 17:45:31,548 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 61 treesize of output 49 [2021-12-06 17:45:31,637 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_136| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_53| (_ BitVec 32)) (v_arrayElimArr_23 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_53|)))) (and (forall ((v_ArrVal_1732 (_ BitVec 32)) (v_ArrVal_1735 (_ BitVec 32)) (v_ArrVal_1742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1746 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_23 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_136|))) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1735)) |v_ULTIMATE.start_main_#t~malloc7#1.base_53| v_ArrVal_1742) .cse0 v_ArrVal_1745) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select (store (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_53| v_ArrVal_1732) .cse0 (_ bv12 32)) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_53|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_53| v_arrayElimArr_23) .cse0 v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) (forall ((v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1735 (_ BitVec 32)) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1735)) |v_ULTIMATE.start_main_#t~malloc7#1.base_53| v_prenex_10) (select v_arrayElimArr_23 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_136|)) v_prenex_11) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) (= (select v_arrayElimArr_23 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_136|)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-06 17:45:31,654 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 61 treesize of output 49 [2021-12-06 17:45:31,832 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 61 treesize of output 49 [2021-12-06 17:45:31,956 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 73 treesize of output 61 [2021-12-06 17:45:32,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 61 [2021-12-06 17:45:32,258 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 73 treesize of output 61 [2021-12-06 17:45:32,485 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_136| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_53| (_ BitVec 32)) (v_arrayElimArr_23 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_53|)))) (= (select v_arrayElimArr_23 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_136|)) |c_ULTIMATE.start_main_~head~0#1.base|) (and (forall ((v_ArrVal_1732 (_ BitVec 32)) (v_ArrVal_1735 (_ BitVec 32)) (v_ArrVal_1731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1746 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_23 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_136|))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1731))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1735))) |v_ULTIMATE.start_main_#t~malloc7#1.base_53| v_ArrVal_1742) .cse1 v_ArrVal_1745) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (select (store (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_53| v_ArrVal_1732) .cse1 (_ bv12 32)) (select (select (store (store (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1730))) (store .cse3 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_53|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_53| v_arrayElimArr_23) .cse1 v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (forall ((v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1735 (_ BitVec 32)) (v_ArrVal_1731 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1731))) (store .cse5 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1735))) |v_ULTIMATE.start_main_#t~malloc7#1.base_53| v_prenex_10) (select v_arrayElimArr_23 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_136|)) v_prenex_11) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse4 (bvadd (_ bv4 32) .cse4))))))) is different from false [2021-12-06 17:45:32,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 85 [2021-12-06 17:45:32,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 85 [2021-12-06 17:45:32,880 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_136| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_53| (_ BitVec 32)) (v_arrayElimArr_23 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_53|)))) (and (forall ((v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1735 (_ BitVec 32)) (v_ArrVal_1731 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) v_ArrVal_1731))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1735))) |v_ULTIMATE.start_main_#t~malloc7#1.base_53| v_prenex_10) (select v_arrayElimArr_23 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_136|)) v_prenex_11) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1732 (_ BitVec 32)) (v_ArrVal_1735 (_ BitVec 32)) (v_ArrVal_1731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1746 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse6)) (.cse5 (select v_arrayElimArr_23 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_136|)))) (bvule (bvadd (_ bv4 32) (select (select (store (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1731))) (store .cse3 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1735))) |v_ULTIMATE.start_main_#t~malloc7#1.base_53| v_ArrVal_1742) .cse5 v_ArrVal_1745) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6)) (select (store (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_53| v_ArrVal_1732) .cse5 (_ bv12 32)) (select (select (store (store (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1730))) (store .cse7 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_53|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_53| v_arrayElimArr_23) .cse5 v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6))))))) (= (select v_arrayElimArr_23 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_136|)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-06 17:45:32,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 85 [2021-12-06 17:45:33,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 85 [2021-12-06 17:45:33,298 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:45:33,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 174 [2021-12-06 17:45:33,303 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:45:33,304 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:45:33,306 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 224 treesize of output 216 [2021-12-06 17:45:33,324 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:45:33,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 1 case distinctions, treesize of input 216 treesize of output 186 [2021-12-06 17:45:33,330 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:45:33,331 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:45:33,333 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 226 treesize of output 220 [2021-12-06 17:45:33,339 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 227 treesize of output 207 [2021-12-06 17:45:33,343 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 282 treesize of output 262 [2021-12-06 17:45:33,348 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 341 treesize of output 325 [2021-12-06 17:45:33,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 392 treesize of output 380 [2021-12-06 17:45:33,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 476 treesize of output 460 [2021-12-06 17:45:33,368 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 473 treesize of output 465 [2021-12-06 17:45:34,424 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:45:36,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-06 17:45:36,536 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:45:36,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595091241] [2021-12-06 17:45:36,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595091241] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:45:36,536 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:45:36,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2021-12-06 17:45:36,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855013866] [2021-12-06 17:45:36,536 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:45:36,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-06 17:45:36,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:45:36,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-06 17:45:36,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=397, Unknown=12, NotChecked=612, Total=1122 [2021-12-06 17:45:36,537 INFO L87 Difference]: Start difference. First operand 393 states and 470 transitions. Second operand has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:45:37,174 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (and (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)) (= (_ bv0 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse1 |c_ULTIMATE.start_main_#t~mem4#1.base|) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_136| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_53| (_ BitVec 32)) (v_arrayElimArr_23 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_53|)))) (= (select v_arrayElimArr_23 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_136|)) |c_ULTIMATE.start_main_~head~0#1.base|) (and (forall ((v_ArrVal_1732 (_ BitVec 32)) (v_ArrVal_1735 (_ BitVec 32)) (v_ArrVal_1731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1746 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select v_arrayElimArr_23 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_136|))) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1731))) (store .cse2 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1735))) |v_ULTIMATE.start_main_#t~malloc7#1.base_53| v_ArrVal_1742) .cse3 v_ArrVal_1745) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (select (store (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_53| v_ArrVal_1732) .cse3 (_ bv12 32)) (select (select (store (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1730))) (store .cse5 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_53|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_53| v_arrayElimArr_23) .cse3 v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))))) (forall ((v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1735 (_ BitVec 32)) (v_ArrVal_1731 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (store (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1731))) (store .cse7 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1735))) |v_ULTIMATE.start_main_#t~malloc7#1.base_53| v_prenex_10) (select v_arrayElimArr_23 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_136|)) v_prenex_11) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse6 (bvadd (_ bv4 32) .cse6))))))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| .cse1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| .cse1))) (_ bv1 1))) (= (select |c_#length| .cse1) (_ bv12 32))))) is different from false [2021-12-06 17:45:37,241 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (and (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)) (= (_ bv0 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_136| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_53| (_ BitVec 32)) (v_arrayElimArr_23 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_53|)))) (and (forall ((v_ArrVal_1732 (_ BitVec 32)) (v_ArrVal_1735 (_ BitVec 32)) (v_ArrVal_1742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1746 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_23 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_136|))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1735)) |v_ULTIMATE.start_main_#t~malloc7#1.base_53| v_ArrVal_1742) .cse1 v_ArrVal_1745) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (select (store (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_53| v_ArrVal_1732) .cse1 (_ bv12 32)) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_53|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_53| v_arrayElimArr_23) .cse1 v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (forall ((v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1735 (_ BitVec 32)) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1735)) |v_ULTIMATE.start_main_#t~malloc7#1.base_53| v_prenex_10) (select v_arrayElimArr_23 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_136|)) v_prenex_11) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))) (= (select v_arrayElimArr_23 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_136|)) |c_ULTIMATE.start_main_~head~0#1.base|))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| .cse4)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| .cse4))) (_ bv1 1))) (= (select |c_#length| .cse4) (_ bv12 32))))) is different from false [2021-12-06 17:45:52,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:45:52,578 INFO L93 Difference]: Finished difference Result 448 states and 531 transitions. [2021-12-06 17:45:52,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-06 17:45:52,580 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 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 38 [2021-12-06 17:45:52,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:45:52,582 INFO L225 Difference]: With dead ends: 448 [2021-12-06 17:45:52,582 INFO L226 Difference]: Without dead ends: 448 [2021-12-06 17:45:52,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 11 SemanticMatches, 41 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=170, Invalid=679, Unknown=19, NotChecked=938, Total=1806 [2021-12-06 17:45:52,583 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 129 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 2609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1915 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2021-12-06 17:45:52,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 1008 Invalid, 2609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 672 Invalid, 0 Unknown, 1915 Unchecked, 5.5s Time] [2021-12-06 17:45:52,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-12-06 17:45:52,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 393. [2021-12-06 17:45:52,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 372 states have (on average 1.260752688172043) internal successors, (469), 392 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:45:52,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 469 transitions. [2021-12-06 17:45:52,589 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 469 transitions. Word has length 38 [2021-12-06 17:45:52,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:45:52,589 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 469 transitions. [2021-12-06 17:45:52,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:45:52,589 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 469 transitions. [2021-12-06 17:45:52,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-06 17:45:52,590 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:45:52,590 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:45:52,600 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (43)] Ended with exit code 0 [2021-12-06 17:45:52,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:45:52,791 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:45:52,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:45:52,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1694180957, now seen corresponding path program 1 times [2021-12-06 17:45:52,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:45:52,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911972111] [2021-12-06 17:45:52,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:45:52,794 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:45:52,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:45:52,796 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:45:52,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2021-12-06 17:45:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:45:53,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-06 17:45:53,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:45:54,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:45:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:45:54,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:45:55,612 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:45:55,612 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 20 treesize of output 23 [2021-12-06 17:45:56,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:45:56,041 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:45:56,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911972111] [2021-12-06 17:45:56,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911972111] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:45:56,041 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:45:56,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2021-12-06 17:45:56,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595777193] [2021-12-06 17:45:56,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:45:56,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-06 17:45:56,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:45:56,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-06 17:45:56,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2021-12-06 17:45:56,043 INFO L87 Difference]: Start difference. First operand 393 states and 469 transitions. Second operand has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:46:01,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:46:01,558 INFO L93 Difference]: Finished difference Result 511 states and 599 transitions. [2021-12-06 17:46:01,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 17:46:01,558 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 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 17:46:01,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:46:01,561 INFO L225 Difference]: With dead ends: 511 [2021-12-06 17:46:01,562 INFO L226 Difference]: Without dead ends: 511 [2021-12-06 17:46:01,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2021-12-06 17:46:01,562 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 554 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:46:01,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [554 Valid, 569 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2021-12-06 17:46:01,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-12-06 17:46:01,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 470. [2021-12-06 17:46:01,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 449 states have (on average 1.269487750556793) internal successors, (570), 469 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:46:01,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 570 transitions. [2021-12-06 17:46:01,572 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 570 transitions. Word has length 39 [2021-12-06 17:46:01,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:46:01,572 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 570 transitions. [2021-12-06 17:46:01,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:46:01,573 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 570 transitions. [2021-12-06 17:46:01,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-06 17:46:01,574 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:46:01,574 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:46:01,585 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (44)] Ended with exit code 0 [2021-12-06 17:46:01,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:46:01,776 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:46:01,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:46:01,777 INFO L85 PathProgramCache]: Analyzing trace with hash -980001879, now seen corresponding path program 1 times [2021-12-06 17:46:01,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:46:01,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058433520] [2021-12-06 17:46:01,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:46:01,778 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:46:01,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:46:01,781 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:46:01,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2021-12-06 17:46:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:46:01,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-06 17:46:01,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:46:04,393 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 19 treesize of output 7 [2021-12-06 17:46:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:46:04,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:46:05,724 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:46:05,724 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 20 treesize of output 23 [2021-12-06 17:46:06,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:46:06,503 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:46:06,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058433520] [2021-12-06 17:46:06,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058433520] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:46:06,503 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:46:06,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2021-12-06 17:46:06,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707850579] [2021-12-06 17:46:06,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:46:06,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-06 17:46:06,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:46:06,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-06 17:46:06,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2021-12-06 17:46:06,505 INFO L87 Difference]: Start difference. First operand 470 states and 570 transitions. Second operand has 19 states, 18 states have (on average 4.444444444444445) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:46:15,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:46:15,131 INFO L93 Difference]: Finished difference Result 516 states and 604 transitions. [2021-12-06 17:46:15,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-06 17:46:15,132 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.444444444444445) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 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 17:46:15,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:46:15,134 INFO L225 Difference]: With dead ends: 516 [2021-12-06 17:46:15,134 INFO L226 Difference]: Without dead ends: 516 [2021-12-06 17:46:15,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2021-12-06 17:46:15,135 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 449 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2021-12-06 17:46:15,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [449 Valid, 584 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2021-12-06 17:46:15,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2021-12-06 17:46:15,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 472. [2021-12-06 17:46:15,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 451 states have (on average 1.2682926829268293) internal successors, (572), 471 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:46:15,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 572 transitions. [2021-12-06 17:46:15,143 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 572 transitions. Word has length 40 [2021-12-06 17:46:15,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:46:15,143 INFO L470 AbstractCegarLoop]: Abstraction has 472 states and 572 transitions. [2021-12-06 17:46:15,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.444444444444445) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:46:15,143 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 572 transitions. [2021-12-06 17:46:15,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-06 17:46:15,144 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:46:15,144 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:46:15,153 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (45)] Ended with exit code 0 [2021-12-06 17:46:15,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:46:15,345 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:46:15,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:46:15,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1839406439, now seen corresponding path program 1 times [2021-12-06 17:46:15,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:46:15,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847398565] [2021-12-06 17:46:15,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:46:15,346 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:46:15,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:46:15,347 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:46:15,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2021-12-06 17:46:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:46:15,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-06 17:46:15,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:46:15,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:46:15,666 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:46:15,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-06 17:46:15,792 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 17:46:15,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:46:15,980 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 20 treesize of output 8 [2021-12-06 17:46:16,107 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 16 treesize of output 18 [2021-12-06 17:46:16,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 17:46:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 17:46:16,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:46:16,803 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:46:16,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847398565] [2021-12-06 17:46:16,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847398565] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:46:16,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:46:16,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 17:46:16,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826673277] [2021-12-06 17:46:16,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:46:16,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:46:16,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:46:16,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:46:16,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:46:16,805 INFO L87 Difference]: Start difference. First operand 472 states and 572 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:46:20,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:46:20,597 INFO L93 Difference]: Finished difference Result 506 states and 605 transitions. [2021-12-06 17:46:20,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 17:46:20,597 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 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 17:46:20,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:46:20,600 INFO L225 Difference]: With dead ends: 506 [2021-12-06 17:46:20,600 INFO L226 Difference]: Without dead ends: 506 [2021-12-06 17:46:20,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2021-12-06 17:46:20,601 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 188 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-12-06 17:46:20,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 330 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-12-06 17:46:20,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-12-06 17:46:20,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 480. [2021-12-06 17:46:20,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 459 states have (on average 1.2657952069716776) internal successors, (581), 479 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:46:20,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 581 transitions. [2021-12-06 17:46:20,608 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 581 transitions. Word has length 40 [2021-12-06 17:46:20,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:46:20,608 INFO L470 AbstractCegarLoop]: Abstraction has 480 states and 581 transitions. [2021-12-06 17:46:20,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:46:20,608 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 581 transitions. [2021-12-06 17:46:20,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-06 17:46:20,609 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:46:20,609 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:46:20,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2021-12-06 17:46:20,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:46:20,810 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:46:20,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:46:20,811 INFO L85 PathProgramCache]: Analyzing trace with hash 593868904, now seen corresponding path program 1 times [2021-12-06 17:46:20,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:46:20,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878632878] [2021-12-06 17:46:20,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:46:20,813 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:46:20,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:46:20,815 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:46:20,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2021-12-06 17:46:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:46:21,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-06 17:46:21,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:46:21,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:46:21,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:46:21,366 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:46:21,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-06 17:46:21,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:46:21,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 17:46:21,551 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 17:46:21,764 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 20 treesize of output 8 [2021-12-06 17:46:21,925 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 16 treesize of output 18 [2021-12-06 17:46:22,286 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:46:22,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-06 17:46:22,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:46:22,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:46:22,618 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 21 treesize of output 20 [2021-12-06 17:46:22,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-06 17:46:23,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 17:46:23,586 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 16 treesize of output 18 [2021-12-06 17:46:23,692 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:46:23,693 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 17 treesize of output 17 [2021-12-06 17:46:23,938 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 17:46:23,970 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 16 treesize of output 18 [2021-12-06 17:46:24,304 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 17:46:24,536 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 16 treesize of output 18 [2021-12-06 17:46:24,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:46:25,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:46:25,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:46:25,858 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1916) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32))) is different from false [2021-12-06 17:46:25,896 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1916) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-06 17:46:25,953 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1915) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1916) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-06 17:46:26,518 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_36| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_36|)))) (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1915) |v_ULTIMATE.start_main_#t~malloc10#1.base_36| v_ArrVal_1916) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:46:26,688 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_36| (_ BitVec 32))) (or (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1915) |v_ULTIMATE.start_main_#t~malloc10#1.base_36| v_ArrVal_1916) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_36|)))))) is different from false [2021-12-06 17:46:26,765 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_36| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_36|)))) (= (_ bv2 32) (select (select (store (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1915) |v_ULTIMATE.start_main_#t~malloc10#1.base_36| v_ArrVal_1916) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:46:26,925 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-06 17:46:26,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2021-12-06 17:46:27,007 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_36| (_ BitVec 32)) (v_ArrVal_1907 (_ BitVec 32))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1907)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1915) |v_ULTIMATE.start_main_#t~malloc10#1.base_36| v_ArrVal_1916) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32)) (= |c_ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_36|))) is different from false [2021-12-06 17:46:27,241 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_58| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_58|))) (forall ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_36| (_ BitVec 32)) (v_ArrVal_1907 (_ BitVec 32))) (or (= (_ bv2 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1907)) |v_ULTIMATE.start_main_#t~malloc7#1.base_58| v_ArrVal_1915) |v_ULTIMATE.start_main_#t~malloc10#1.base_36| v_ArrVal_1916) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= |c_ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_36|))))) is different from false [2021-12-06 17:46:27,430 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_58| (_ BitVec 32)) (v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_36| (_ BitVec 32)) (v_ArrVal_1907 (_ BitVec 32))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1907)) |v_ULTIMATE.start_main_#t~malloc7#1.base_58| v_ArrVal_1915) |v_ULTIMATE.start_main_#t~malloc10#1.base_36| v_ArrVal_1916) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_36|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_58|))))) is different from false [2021-12-06 17:46:27,791 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_58| (_ BitVec 32)) (v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1906 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_36| (_ BitVec 32)) (v_ArrVal_1907 (_ BitVec 32))) (or (= (select (select (store (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1906))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1907))) |v_ULTIMATE.start_main_#t~malloc7#1.base_58| v_ArrVal_1915) |v_ULTIMATE.start_main_#t~malloc10#1.base_36| v_ArrVal_1916) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_36|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_58|))))) is different from false [2021-12-06 17:46:27,997 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_58| (_ BitVec 32)) (v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1906 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_36| (_ BitVec 32)) (v_ArrVal_1907 (_ BitVec 32))) (or (= (_ bv2 32) (select (select (store (store (let ((.cse0 (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) v_ArrVal_1906))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1907))) |v_ULTIMATE.start_main_#t~malloc7#1.base_58| v_ArrVal_1915) |v_ULTIMATE.start_main_#t~malloc10#1.base_36| v_ArrVal_1916) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_36|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_58|))))) is different from false [2021-12-06 17:46:28,280 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-06 17:46:28,281 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 16 treesize of output 15 [2021-12-06 17:46:28,478 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_58| (_ BitVec 32)) (v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1906 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_36| (_ BitVec 32)) (v_ArrVal_1902 (_ BitVec 32)) (v_ArrVal_1907 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_58|) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_36|) (= (_ bv2 32) (select (select (store (store (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1902)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1906))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1907))) |v_ULTIMATE.start_main_#t~malloc7#1.base_58| v_ArrVal_1915) |v_ULTIMATE.start_main_#t~malloc10#1.base_36| v_ArrVal_1916) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:46:28,873 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_44| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_44|))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_58| (_ BitVec 32)) (v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1906 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_36| (_ BitVec 32)) (v_ArrVal_1902 (_ BitVec 32)) (v_ArrVal_1907 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_58|) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_36|) (= (_ bv2 32) (select (select (store (store (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1902)) |v_ULTIMATE.start_main_#t~malloc3#1.base_44| v_ArrVal_1906))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1907))) |v_ULTIMATE.start_main_#t~malloc7#1.base_58| v_ArrVal_1915) |v_ULTIMATE.start_main_#t~malloc10#1.base_36| v_ArrVal_1916) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2021-12-06 17:46:29,033 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-06 17:46:29,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 50 [2021-12-06 17:46:29,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:46:29,057 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:46:29,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2021-12-06 17:46:29,076 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:46:29,084 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 21 treesize of output 13 [2021-12-06 17:46:29,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2021-12-06 17:46:29,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-06 17:46:29,352 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:46:29,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878632878] [2021-12-06 17:46:29,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878632878] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:46:29,353 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:46:29,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 36 [2021-12-06 17:46:29,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518172752] [2021-12-06 17:46:29,353 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:46:29,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-06 17:46:29,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:46:29,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-06 17:46:29,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=417, Unknown=16, NotChecked=702, Total=1260 [2021-12-06 17:46:29,355 INFO L87 Difference]: Start difference. First operand 480 states and 581 transitions. Second operand has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 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 17:46:43,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:46:43,540 INFO L93 Difference]: Finished difference Result 643 states and 770 transitions. [2021-12-06 17:46:43,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-06 17:46:43,541 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 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) Word has length 40 [2021-12-06 17:46:43,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:46:43,545 INFO L225 Difference]: With dead ends: 643 [2021-12-06 17:46:43,545 INFO L226 Difference]: Without dead ends: 643 [2021-12-06 17:46:43,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 47 SyntacticMatches, 10 SemanticMatches, 51 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=329, Invalid=1267, Unknown=16, NotChecked=1144, Total=2756 [2021-12-06 17:46:43,547 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 355 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 3533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2333 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2021-12-06 17:46:43,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [355 Valid, 982 Invalid, 3533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1136 Invalid, 0 Unknown, 2333 Unchecked, 8.7s Time] [2021-12-06 17:46:43,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2021-12-06 17:46:43,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 480. [2021-12-06 17:46:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 459 states have (on average 1.263616557734205) internal successors, (580), 479 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:46:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 580 transitions. [2021-12-06 17:46:43,554 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 580 transitions. Word has length 40 [2021-12-06 17:46:43,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:46:43,555 INFO L470 AbstractCegarLoop]: Abstraction has 480 states and 580 transitions. [2021-12-06 17:46:43,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 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 17:46:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 580 transitions. [2021-12-06 17:46:43,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-06 17:46:43,555 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:46:43,556 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:46:43,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (47)] Ended with exit code 0 [2021-12-06 17:46:43,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:46:43,757 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:46:43,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:46:43,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1092438059, now seen corresponding path program 1 times [2021-12-06 17:46:43,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:46:43,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550671380] [2021-12-06 17:46:43,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:46:43,760 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:46:43,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:46:43,761 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:46:43,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2021-12-06 17:46:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:46:43,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-06 17:46:43,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:46:43,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:46:44,239 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:46:44,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2021-12-06 17:46:44,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:46:44,961 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:46:44,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-06 17:46:45,125 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:46:45,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-06 17:46:45,257 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:46:45,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2021-12-06 17:46:45,511 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-12-06 17:46:45,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 24 [2021-12-06 17:46:46,252 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-06 17:46:46,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 58 [2021-12-06 17:46:46,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 20 treesize of output 12 [2021-12-06 17:46:48,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-12-06 17:46:49,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:46:49,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:46:50,458 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1979) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))))))))))))))) (_ bv1 1)))) is different from false [2021-12-06 17:46:50,563 INFO L354 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2021-12-06 17:46:50,563 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 55 treesize of output 54 [2021-12-06 17:46:50,606 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1979 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1979) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) is different from false [2021-12-06 17:46:51,119 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:46:51,119 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 1 case distinctions, treesize of input 18 treesize of output 22 [2021-12-06 17:46:51,182 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1979 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_27 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_27) .cse0 v_ArrVal_1979) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (_ bv0 1) (bvneg (select |c_#valid| .cse0))))))) is different from false [2021-12-06 17:46:51,354 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1979 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_27 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)))) (or (= |c_ULTIMATE.start_main_#t~mem8#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_arrayElimArr_27) .cse0 v_ArrVal_1979) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (_ bv0 1) (bvneg (select |c_#valid| .cse0))))))) is different from false [2021-12-06 17:46:51,448 INFO L354 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2021-12-06 17:46:51,448 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 23 treesize of output 22 [2021-12-06 17:46:51,524 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1979 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.offset_158| (_ BitVec 32)) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_27 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_158|)))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse0) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_27) .cse0 v_ArrVal_1979) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse1))))) is different from false [2021-12-06 17:46:51,620 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:46:51,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2021-12-06 17:46:51,694 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:46:51,694 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 76 treesize of output 79 [2021-12-06 17:46:51,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2021-12-06 17:46:51,776 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:46:51,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 67 treesize of output 55 [2021-12-06 17:46:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:46:53,104 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:46:53,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550671380] [2021-12-06 17:46:53,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550671380] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:46:53,104 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:46:53,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 24 [2021-12-06 17:46:53,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741325463] [2021-12-06 17:46:53,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:46:53,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-06 17:46:53,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:46:53,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-06 17:46:53,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=320, Unknown=17, NotChecked=200, Total=600 [2021-12-06 17:46:53,106 INFO L87 Difference]: Start difference. First operand 480 states and 580 transitions. Second operand has 25 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 25 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 17:47:07,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:47:07,166 INFO L93 Difference]: Finished difference Result 956 states and 1175 transitions. [2021-12-06 17:47:07,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-06 17:47:07,168 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 25 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) Word has length 40 [2021-12-06 17:47:07,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:47:07,173 INFO L225 Difference]: With dead ends: 956 [2021-12-06 17:47:07,173 INFO L226 Difference]: Without dead ends: 956 [2021-12-06 17:47:07,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 42 SyntacticMatches, 18 SemanticMatches, 43 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=283, Invalid=1274, Unknown=23, NotChecked=400, Total=1980 [2021-12-06 17:47:07,174 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 367 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 2553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1258 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:47:07,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 1197 Invalid, 2553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1243 Invalid, 0 Unknown, 1258 Unchecked, 9.1s Time] [2021-12-06 17:47:07,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2021-12-06 17:47:07,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 507. [2021-12-06 17:47:07,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 486 states have (on average 1.2613168724279835) internal successors, (613), 506 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:47:07,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 613 transitions. [2021-12-06 17:47:07,183 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 613 transitions. Word has length 40 [2021-12-06 17:47:07,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:47:07,183 INFO L470 AbstractCegarLoop]: Abstraction has 507 states and 613 transitions. [2021-12-06 17:47:07,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 25 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 17:47:07,184 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 613 transitions. [2021-12-06 17:47:07,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-06 17:47:07,184 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:47:07,184 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:47:07,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (48)] Ended with exit code 0 [2021-12-06 17:47:07,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:47:07,386 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:47:07,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:47:07,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1092438060, now seen corresponding path program 1 times [2021-12-06 17:47:07,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:47:07,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034700206] [2021-12-06 17:47:07,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:47:07,389 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:47:07,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:47:07,391 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:47:07,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (49)] Waiting until timeout for monitored process [2021-12-06 17:47:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:47:07,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-06 17:47:07,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:47:07,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:47:07,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:47:07,998 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 17:47:07,998 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 22 treesize of output 29 [2021-12-06 17:47:08,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:47:08,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:47:09,357 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:47:09,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 47 [2021-12-06 17:47:09,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:47:09,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-06 17:47:09,718 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:47:09,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 45 [2021-12-06 17:47:09,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:47:09,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-06 17:47:10,001 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-12-06 17:47:10,002 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 36 treesize of output 38 [2021-12-06 17:47:10,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 18 [2021-12-06 17:47:10,354 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-12-06 17:47:10,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 33 [2021-12-06 17:47:10,451 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 14 treesize of output 16 [2021-12-06 17:47:11,198 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 17:47:11,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 69 [2021-12-06 17:47:11,221 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 24 treesize of output 26 [2021-12-06 17:47:12,926 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-12-06 17:47:12,927 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 24 [2021-12-06 17:47:12,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:47:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:47:13,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:47:14,938 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2051 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2050 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2051) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2050) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_2051 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2051) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32)))))) is different from false [2021-12-06 17:47:15,006 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2051 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_2051) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_2051 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2050 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2051) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2050) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2021-12-06 17:47:15,123 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2051 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2048 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2048) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_2051) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_2051 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_ArrVal_2048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2050 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2048) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_2051) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_2050) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:47:16,013 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:47:16,013 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 1 case distinctions, treesize of input 63 treesize of output 67 [2021-12-06 17:47:16,119 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 47 treesize of output 35 [2021-12-06 17:47:16,244 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| (select v_arrayElimArr_29 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)))))) (and (forall ((v_prenex_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_41 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_41) (select v_arrayElimArr_29 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)) v_prenex_40) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_2051 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2050 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2046 (_ BitVec 32))) (let ((.cse1 (select v_arrayElimArr_29 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2048) .cse1 v_ArrVal_2051) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select (store |c_#length| .cse1 v_ArrVal_2046) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_29) .cse1 v_ArrVal_2050) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2021-12-06 17:47:16,334 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 47 treesize of output 35 [2021-12-06 17:47:16,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2021-12-06 17:47:16,621 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 47 treesize of output 35 [2021-12-06 17:47:16,794 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| (select v_arrayElimArr_29 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)))))) (and (forall ((v_ArrVal_2051 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2050 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2046 (_ BitVec 32))) (let ((.cse0 (select v_arrayElimArr_29 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2048) .cse0 v_ArrVal_2051) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select (store |c_#length| .cse0 v_ArrVal_2046) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_arrayElimArr_29) .cse0 v_ArrVal_2050) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_prenex_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_41 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_prenex_41) (select v_arrayElimArr_29 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)) v_prenex_40) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32)))))))) is different from false [2021-12-06 17:47:16,830 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 55 treesize of output 43 [2021-12-06 17:47:17,390 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 55 treesize of output 43 [2021-12-06 17:47:17,607 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:47:17,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 95 [2021-12-06 17:47:17,643 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:47:17,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 95 [2021-12-06 17:47:17,727 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:47:17,728 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 221 treesize of output 224 [2021-12-06 17:47:17,818 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:47:17,818 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 1117 treesize of output 1084 [2021-12-06 17:47:17,895 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:47:17,896 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 1095 treesize of output 829 [2021-12-06 17:47:17,931 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 781 treesize of output 749 [2021-12-06 17:47:17,955 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 749 treesize of output 733 [2021-12-06 17:47:17,979 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 733 treesize of output 701 [2021-12-06 17:47:18,006 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 701 treesize of output 693 [2021-12-06 17:47:18,036 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 693 treesize of output 689 [2021-12-06 17:47:35,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:48:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:48:19,739 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:48:19,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034700206] [2021-12-06 17:48:19,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034700206] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:48:19,740 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:48:19,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2021-12-06 17:48:19,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622027995] [2021-12-06 17:48:19,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:48:19,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-06 17:48:19,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:48:19,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-06 17:48:19,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=20, NotChecked=240, Total=812 [2021-12-06 17:48:19,741 INFO L87 Difference]: Start difference. First operand 507 states and 613 transitions. Second operand has 29 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 29 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:48:30,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:48:30,972 INFO L93 Difference]: Finished difference Result 536 states and 645 transitions. [2021-12-06 17:48:30,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-06 17:48:30,973 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 29 states have internal predecessors, (79), 0 states have call successors, (0), 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 17:48:30,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:48:30,976 INFO L225 Difference]: With dead ends: 536 [2021-12-06 17:48:30,976 INFO L226 Difference]: Without dead ends: 536 [2021-12-06 17:48:30,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 55.6s TimeCoverageRelationStatistics Valid=127, Invalid=740, Unknown=23, NotChecked=300, Total=1190 [2021-12-06 17:48:30,977 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 93 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 818 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-12-06 17:48:30,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 892 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 308 Invalid, 0 Unknown, 818 Unchecked, 2.9s Time] [2021-12-06 17:48:30,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2021-12-06 17:48:30,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 490. [2021-12-06 17:48:30,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 469 states have (on average 1.2665245202558635) internal successors, (594), 489 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:48:30,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 594 transitions. [2021-12-06 17:48:30,983 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 594 transitions. Word has length 40 [2021-12-06 17:48:30,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:48:30,983 INFO L470 AbstractCegarLoop]: Abstraction has 490 states and 594 transitions. [2021-12-06 17:48:30,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 29 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:48:30,984 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 594 transitions. [2021-12-06 17:48:30,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-06 17:48:30,984 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:48:30,984 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:48:30,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (49)] Forceful destruction successful, exit code 0 [2021-12-06 17:48:31,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:48:31,186 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:48:31,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:48:31,187 INFO L85 PathProgramCache]: Analyzing trace with hash -523340448, now seen corresponding path program 1 times [2021-12-06 17:48:31,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:48:31,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095119611] [2021-12-06 17:48:31,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:48:31,189 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:48:31,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:48:31,191 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:48:31,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2021-12-06 17:48:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:48:31,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-06 17:48:31,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:48:31,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:48:31,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:48:31,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:48:31,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 17:48:31,999 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:48:31,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-06 17:48:32,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:48:32,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:48:32,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:48:32,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-06 17:48:33,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 17:48:33,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 16 treesize of output 18 [2021-12-06 17:48:33,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 17:48:33,367 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:48:33,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2021-12-06 17:48:33,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:48:33,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 17:48:33,906 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 16 treesize of output 8 [2021-12-06 17:48:34,303 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 16 treesize of output 18 [2021-12-06 17:48:34,444 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 16 treesize of output 18 [2021-12-06 17:48:34,506 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 16 treesize of output 18 [2021-12-06 17:48:34,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:48:35,193 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:48:35,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:48:35,823 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2142 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2142) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:48:35,931 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2142 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2142) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:48:35,971 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2142 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2142) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:48:36,028 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2138 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2138) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2142) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:48:36,114 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_67| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_67|))))))) (forall ((v_ArrVal_2142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2138 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2138) |v_ULTIMATE.start_main_#t~malloc7#1.base_67| v_ArrVal_2142) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2021-12-06 17:48:36,188 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2138 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_67| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_67|))))))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2138) |v_ULTIMATE.start_main_#t~malloc7#1.base_67| v_ArrVal_2142) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2021-12-06 17:48:36,462 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2138 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_67| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_67|))))))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2138) |v_ULTIMATE.start_main_#t~malloc7#1.base_67| v_ArrVal_2142) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2021-12-06 17:48:36,537 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2138 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_67| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_67|))))))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2138) |v_ULTIMATE.start_main_#t~malloc7#1.base_67| v_ArrVal_2142) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2021-12-06 17:48:36,692 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-06 17:48:36,692 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 17:48:36,774 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2132 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_67| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_67|) (not (= (_ bv2 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_2132)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2138) |v_ULTIMATE.start_main_#t~malloc7#1.base_67| v_ArrVal_2142) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2021-12-06 17:48:37,007 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_69| (_ BitVec 32))) (or (forall ((v_ArrVal_2142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2132 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_67| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_67|) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_2132)) |v_ULTIMATE.start_main_#t~malloc7#1.base_69| v_ArrVal_2138) |v_ULTIMATE.start_main_#t~malloc7#1.base_67| v_ArrVal_2142) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_69|))))) is different from false [2021-12-06 17:48:37,197 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_69| (_ BitVec 32)) (v_ArrVal_2142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2132 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_67| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_67|) (not (= (_ bv2 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_2132)) |v_ULTIMATE.start_main_#t~malloc7#1.base_69| v_ArrVal_2138) |v_ULTIMATE.start_main_#t~malloc7#1.base_67| v_ArrVal_2142) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_69|))))) is different from false [2021-12-06 17:48:37,398 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_69| (_ BitVec 32)) (v_ArrVal_2142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2127 (_ BitVec 32)) (v_ArrVal_2138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2132 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_67| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_67|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_69|))) (not (= (_ bv2 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_2127) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_2132)) |v_ULTIMATE.start_main_#t~malloc7#1.base_69| v_ArrVal_2138) |v_ULTIMATE.start_main_#t~malloc7#1.base_67| v_ArrVal_2142) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2021-12-06 17:48:37,645 INFO L354 Elim1Store]: treesize reduction 78, result has 27.1 percent of original size [2021-12-06 17:48:37,645 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 3 case distinctions, treesize of input 34 treesize of output 45 [2021-12-06 17:48:37,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:48:37,674 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 39 treesize of output 27 [2021-12-06 17:48:37,689 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 17:48:37,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-06 17:48:37,923 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:48:37,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095119611] [2021-12-06 17:48:37,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095119611] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:48:37,923 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:48:37,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2021-12-06 17:48:37,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783636563] [2021-12-06 17:48:37,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:48:37,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-06 17:48:37,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:48:37,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-06 17:48:37,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=344, Unknown=12, NotChecked=588, Total=1056 [2021-12-06 17:48:37,925 INFO L87 Difference]: Start difference. First operand 490 states and 594 transitions. Second operand has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 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 17:48:48,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:48:48,077 INFO L93 Difference]: Finished difference Result 707 states and 841 transitions. [2021-12-06 17:48:48,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 17:48:48,078 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 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 40 [2021-12-06 17:48:48,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:48:48,082 INFO L225 Difference]: With dead ends: 707 [2021-12-06 17:48:48,082 INFO L226 Difference]: Without dead ends: 707 [2021-12-06 17:48:48,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=291, Invalid=935, Unknown=12, NotChecked=924, Total=2162 [2021-12-06 17:48:48,083 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 307 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 2983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2070 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:48:48,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 731 Invalid, 2983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 819 Invalid, 0 Unknown, 2070 Unchecked, 6.2s Time] [2021-12-06 17:48:48,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2021-12-06 17:48:48,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 516. [2021-12-06 17:48:48,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 495 states have (on average 1.2646464646464646) internal successors, (626), 515 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:48:48,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 626 transitions. [2021-12-06 17:48:48,092 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 626 transitions. Word has length 40 [2021-12-06 17:48:48,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:48:48,092 INFO L470 AbstractCegarLoop]: Abstraction has 516 states and 626 transitions. [2021-12-06 17:48:48,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 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 17:48:48,092 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 626 transitions. [2021-12-06 17:48:48,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-06 17:48:48,092 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:48:48,093 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:48:48,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (50)] Forceful destruction successful, exit code 0 [2021-12-06 17:48:48,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:48:48,294 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:48:48,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:48:48,295 INFO L85 PathProgramCache]: Analyzing trace with hash 521180008, now seen corresponding path program 1 times [2021-12-06 17:48:48,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:48:48,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630757576] [2021-12-06 17:48:48,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:48:48,297 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:48:48,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:48:48,299 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:48:48,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (51)] Waiting until timeout for monitored process [2021-12-06 17:48:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:48:48,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-06 17:48:48,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:48:48,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:48:48,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:48:48,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:48:48,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-06 17:48:49,116 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:48:49,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-06 17:48:49,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:48:49,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-06 17:48:49,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:48:49,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-06 17:48:50,125 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 16 treesize of output 18 [2021-12-06 17:48:50,301 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 16 treesize of output 18 [2021-12-06 17:48:50,364 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 16 treesize of output 18 [2021-12-06 17:48:50,501 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:48:50,501 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 18 treesize of output 18 [2021-12-06 17:48:50,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-06 17:48:50,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 17:48:51,036 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 16 treesize of output 8 [2021-12-06 17:48:51,450 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 16 treesize of output 18 [2021-12-06 17:48:51,613 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 16 treesize of output 18 [2021-12-06 17:48:51,661 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 16 treesize of output 18 [2021-12-06 17:48:52,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-06 17:48:52,389 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:48:52,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:48:53,005 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2233 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2233) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:48:53,101 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2233 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2233) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-06 17:48:53,136 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2233 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2233) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32)))) is different from false [2021-12-06 17:48:53,188 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2233 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2230) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2233) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32)))) is different from false [2021-12-06 17:48:53,745 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2233 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_72| (_ BitVec 32))) (or (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2230) |v_ULTIMATE.start_main_#t~malloc7#1.base_72| v_ArrVal_2233) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_72|))))) is different from false [2021-12-06 17:48:53,995 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2233 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_72| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_72|))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2230) |v_ULTIMATE.start_main_#t~malloc7#1.base_72| v_ArrVal_2233) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2021-12-06 17:48:54,062 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2233 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_72| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_72|))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2230) |v_ULTIMATE.start_main_#t~malloc7#1.base_72| v_ArrVal_2233) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2021-12-06 17:48:54,202 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-06 17:48:54,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2021-12-06 17:48:54,273 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2224 (_ BitVec 32)) (v_ArrVal_2230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2233 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_72| (_ BitVec 32))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_2224)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2230) |v_ULTIMATE.start_main_#t~malloc7#1.base_72| v_ArrVal_2233) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32))) (= |c_ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_72|))) is different from false [2021-12-06 17:48:55,060 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2224 (_ BitVec 32)) (v_ArrVal_2230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2233 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_72| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_74| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_74|)))))) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_72|) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_2224)) |v_ULTIMATE.start_main_#t~malloc7#1.base_74| v_ArrVal_2230) |v_ULTIMATE.start_main_#t~malloc7#1.base_72| v_ArrVal_2233) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32))))) is different from false [2021-12-06 17:48:55,251 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2224 (_ BitVec 32)) (v_ArrVal_2230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2233 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_72| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_74| (_ BitVec 32)) (v_ArrVal_2220 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_74|)))))) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_72|) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_2220) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_2224)) |v_ULTIMATE.start_main_#t~malloc7#1.base_74| v_ArrVal_2230) |v_ULTIMATE.start_main_#t~malloc7#1.base_72| v_ArrVal_2233) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32))))) is different from false [2021-12-06 17:48:55,497 INFO L354 Elim1Store]: treesize reduction 78, result has 27.1 percent of original size [2021-12-06 17:48:55,497 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 3 case distinctions, treesize of input 34 treesize of output 45 [2021-12-06 17:48:55,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:48:55,526 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 39 treesize of output 27 [2021-12-06 17:48:55,541 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 17:48:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2021-12-06 17:48:55,804 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:48:55,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630757576] [2021-12-06 17:48:55,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630757576] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:48:55,805 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:48:55,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2021-12-06 17:48:55,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615885570] [2021-12-06 17:48:55,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:48:55,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-06 17:48:55,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:48:55,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-06 17:48:55,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=411, Unknown=19, NotChecked=510, Total=1056 [2021-12-06 17:48:55,806 INFO L87 Difference]: Start difference. First operand 516 states and 626 transitions. Second operand has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 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 17:49:07,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:49:07,691 INFO L93 Difference]: Finished difference Result 709 states and 843 transitions. [2021-12-06 17:49:07,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 17:49:07,693 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 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 40 [2021-12-06 17:49:07,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:49:07,697 INFO L225 Difference]: With dead ends: 709 [2021-12-06 17:49:07,697 INFO L226 Difference]: Without dead ends: 709 [2021-12-06 17:49:07,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 48 SyntacticMatches, 9 SemanticMatches, 45 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=308, Invalid=1045, Unknown=19, NotChecked=790, Total=2162 [2021-12-06 17:49:07,698 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 303 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 3291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2212 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2021-12-06 17:49:07,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 990 Invalid, 3291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1010 Invalid, 0 Unknown, 2212 Unchecked, 7.6s Time] [2021-12-06 17:49:07,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-12-06 17:49:07,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 492. [2021-12-06 17:49:07,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 471 states have (on average 1.2653927813163481) internal successors, (596), 491 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:49:07,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 596 transitions. [2021-12-06 17:49:07,706 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 596 transitions. Word has length 40 [2021-12-06 17:49:07,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:49:07,706 INFO L470 AbstractCegarLoop]: Abstraction has 492 states and 596 transitions. [2021-12-06 17:49:07,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 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 17:49:07,706 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 596 transitions. [2021-12-06 17:49:07,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-06 17:49:07,707 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:49:07,707 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:49:07,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (51)] Forceful destruction successful, exit code 0 [2021-12-06 17:49:07,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:49:07,908 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:49:07,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:49:07,909 INFO L85 PathProgramCache]: Analyzing trace with hash -315286939, now seen corresponding path program 1 times [2021-12-06 17:49:07,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:49:07,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179724532] [2021-12-06 17:49:07,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:49:07,911 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:49:07,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:49:07,913 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:49:07,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (52)] Waiting until timeout for monitored process [2021-12-06 17:49:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:49:08,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-06 17:49:08,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:49:09,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-06 17:49:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:49:09,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:49:11,118 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 17:49:11,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2021-12-06 17:49:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:49:12,165 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:49:12,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179724532] [2021-12-06 17:49:12,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179724532] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:49:12,165 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:49:12,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-12-06 17:49:12,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719081180] [2021-12-06 17:49:12,166 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:49:12,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-06 17:49:12,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:49:12,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-06 17:49:12,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:49:12,166 INFO L87 Difference]: Start difference. First operand 492 states and 596 transitions. Second operand has 16 states, 15 states have (on average 4.4) internal successors, (66), 16 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 17:49:20,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:49:20,070 INFO L93 Difference]: Finished difference Result 523 states and 614 transitions. [2021-12-06 17:49:20,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 17:49:20,071 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.4) internal successors, (66), 16 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 41 [2021-12-06 17:49:20,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:49:20,074 INFO L225 Difference]: With dead ends: 523 [2021-12-06 17:49:20,074 INFO L226 Difference]: Without dead ends: 523 [2021-12-06 17:49:20,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2021-12-06 17:49:20,075 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 406 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2021-12-06 17:49:20,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 539 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 717 Invalid, 0 Unknown, 66 Unchecked, 5.8s Time] [2021-12-06 17:49:20,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2021-12-06 17:49:20,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 494. [2021-12-06 17:49:20,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 473 states have (on average 1.2642706131078225) internal successors, (598), 493 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:49:20,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 598 transitions. [2021-12-06 17:49:20,082 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 598 transitions. Word has length 41 [2021-12-06 17:49:20,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:49:20,083 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 598 transitions. [2021-12-06 17:49:20,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.4) internal successors, (66), 16 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 17:49:20,083 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 598 transitions. [2021-12-06 17:49:20,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-06 17:49:20,083 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:49:20,083 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:49:20,093 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (52)] Ended with exit code 0 [2021-12-06 17:49:20,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:49:20,285 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:49:20,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:49:20,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1187024525, now seen corresponding path program 1 times [2021-12-06 17:49:20,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:49:20,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971011548] [2021-12-06 17:49:20,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:49:20,288 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:49:20,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:49:20,290 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:49:20,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (53)] Waiting until timeout for monitored process [2021-12-06 17:49:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:49:20,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-06 17:49:20,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:49:20,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:49:20,645 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:49:20,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-06 17:49:20,759 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 17:49:21,164 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:49:21,165 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 32 treesize of output 33 [2021-12-06 17:49:22,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2021-12-06 17:49:22,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 17:49:22,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:49:22,338 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:49:22,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971011548] [2021-12-06 17:49:22,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971011548] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:49:22,339 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:49:22,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:49:22,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524957819] [2021-12-06 17:49:22,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:49:22,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 17:49:22,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:49:22,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 17:49:22,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:49:22,340 INFO L87 Difference]: Start difference. First operand 494 states and 598 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:49:26,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:49:26,363 INFO L93 Difference]: Finished difference Result 520 states and 622 transitions. [2021-12-06 17:49:26,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 17:49:26,364 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2021-12-06 17:49:26,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:49:26,367 INFO L225 Difference]: With dead ends: 520 [2021-12-06 17:49:26,367 INFO L226 Difference]: Without dead ends: 520 [2021-12-06 17:49:26,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2021-12-06 17:49:26,368 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 160 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:49:26,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 297 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2021-12-06 17:49:26,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2021-12-06 17:49:26,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 495. [2021-12-06 17:49:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 474 states have (on average 1.2637130801687764) internal successors, (599), 494 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:49:26,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 599 transitions. [2021-12-06 17:49:26,374 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 599 transitions. Word has length 41 [2021-12-06 17:49:26,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:49:26,375 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 599 transitions. [2021-12-06 17:49:26,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:49:26,375 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 599 transitions. [2021-12-06 17:49:26,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-06 17:49:26,375 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:49:26,375 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:49:26,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (53)] Ended with exit code 0 [2021-12-06 17:49:26,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:49:26,577 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:49:26,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:49:26,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1049857630, now seen corresponding path program 1 times [2021-12-06 17:49:26,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:49:26,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758307958] [2021-12-06 17:49:26,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:49:26,579 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:49:26,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:49:26,580 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:49:26,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (54)] Waiting until timeout for monitored process [2021-12-06 17:49:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:49:26,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-06 17:49:26,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:49:26,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:49:27,108 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 17:49:27,109 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 21 treesize of output 28 [2021-12-06 17:49:27,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:49:27,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:49:27,991 INFO L354 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2021-12-06 17:49:27,991 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 84 treesize of output 56 [2021-12-06 17:49:28,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2021-12-06 17:49:28,805 INFO L354 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-12-06 17:49:28,806 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 29 treesize of output 31 [2021-12-06 17:49:29,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:49:29,184 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2021-12-06 17:49:29,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:49:29,290 INFO L354 Elim1Store]: treesize reduction 63, result has 17.1 percent of original size [2021-12-06 17:49:29,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 57 [2021-12-06 17:49:30,626 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 17:49:30,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 80 [2021-12-06 17:49:30,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:49:30,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2021-12-06 17:49:31,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:49:31,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2021-12-06 17:49:31,164 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 17:49:31,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 80 [2021-12-06 17:49:31,448 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-06 17:49:31,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 88 [2021-12-06 17:49:31,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 52 [2021-12-06 17:49:33,206 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-06 17:49:33,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 44 [2021-12-06 17:49:33,219 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2021-12-06 17:49:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:49:33,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:49:34,919 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2367)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2366) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) (forall ((v_ArrVal_2366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2366))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2367) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (_ bv0 32)))) is different from false [2021-12-06 17:49:35,111 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2367)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2366) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (_ bv0 32))) (forall ((v_ArrVal_2366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2366))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2367) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (_ bv0 32)))) is different from false [2021-12-06 17:49:35,176 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2366))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2367) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (_ bv0 32))) (forall ((v_ArrVal_2366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_2367)) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select .cse3 (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2366) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5)) (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse5)))) (_ bv0 32)))) is different from false [2021-12-06 17:49:35,299 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2358 (_ BitVec 32)) (v_ArrVal_2366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_2358)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2367)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2366) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) (forall ((v_ArrVal_2358 (_ BitVec 32)) (v_ArrVal_2366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2366))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_2358)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2367) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (_ bv0 32)))) is different from false [2021-12-06 17:49:40,941 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_77| (_ BitVec 32))) (or (and (forall ((v_ArrVal_2358 (_ BitVec 32)) (v_ArrVal_2366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (let ((.cse0 (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base|) |c_ULTIMATE.start_main_#t~mem4#1.offset| (_ bv0 32))))) (store .cse2 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_77|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_77| v_ArrVal_2366))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base|) |c_ULTIMATE.start_main_#t~mem4#1.offset| (_ bv0 32))))) (store .cse3 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_2358))) |v_ULTIMATE.start_main_#t~malloc7#1.base_77| v_ArrVal_2367) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) (forall ((v_ArrVal_2358 (_ BitVec 32)) (v_ArrVal_2366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse4 (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base|) |c_ULTIMATE.start_main_#t~mem4#1.offset| (_ bv0 32))))) (store .cse7 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_2358))) |v_ULTIMATE.start_main_#t~malloc7#1.base_77| v_ArrVal_2367)) (.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select .cse4 (select (select (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base|) |c_ULTIMATE.start_main_#t~mem4#1.offset| (_ bv0 32))))) (store .cse5 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_77|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_77| v_ArrVal_2366) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6)) (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) .cse6))) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_77|))))) is different from false [2021-12-06 17:49:41,367 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_77| (_ BitVec 32))) (or (and (forall ((v_ArrVal_2358 (_ BitVec 32)) (v_ArrVal_2366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (let ((.cse0 (store (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse3 (_ bv0 32))))) (store .cse5 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_2358))) |v_ULTIMATE.start_main_#t~malloc7#1.base_77| v_ArrVal_2367))) (select (select .cse0 (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) .cse3 (_ bv0 32))))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_77|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_77| v_ArrVal_2366) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))))) (_ bv0 32))) (forall ((v_ArrVal_2358 (_ BitVec 32)) (v_ArrVal_2366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (let ((.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse7))) (select (let ((.cse6 (store (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse9 (store (select |c_#memory_$Pointer$.base| .cse9) .cse10 (_ bv0 32))))) (store .cse8 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_77|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_77| v_ArrVal_2366))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7))) (select (select (store (let ((.cse11 (store |c_#memory_$Pointer$.offset| .cse9 (store (select |c_#memory_$Pointer$.offset| .cse9) .cse10 (_ bv0 32))))) (store .cse11 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_2358))) |v_ULTIMATE.start_main_#t~malloc7#1.base_77| v_ArrVal_2367) |c_ULTIMATE.start_main_~head~0#1.base|) .cse7))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_77|))))) is different from false [2021-12-06 17:49:42,986 INFO L354 Elim1Store]: treesize reduction 124, result has 43.9 percent of original size [2021-12-06 17:49:42,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 441 treesize of output 346 [2021-12-06 17:49:43,500 INFO L354 Elim1Store]: treesize reduction 62, result has 44.1 percent of original size [2021-12-06 17:49:43,501 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 3 case distinctions, treesize of input 346 treesize of output 202 [2021-12-06 17:49:43,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:49:43,992 INFO L354 Elim1Store]: treesize reduction 43, result has 55.7 percent of original size [2021-12-06 17:49:43,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 229 treesize of output 235 [2021-12-06 17:49:44,006 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:49:44,319 INFO L354 Elim1Store]: treesize reduction 10, result has 71.4 percent of original size [2021-12-06 17:49:44,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 226 treesize of output 218 [2021-12-06 17:49:44,334 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 17:49:44,803 INFO L354 Elim1Store]: treesize reduction 34, result has 51.4 percent of original size [2021-12-06 17:49:44,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 233 treesize of output 242 [2021-12-06 17:49:44,833 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 37 treesize of output 35 [2021-12-06 17:49:44,855 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 35 treesize of output 33 [2021-12-06 17:49:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:49:53,284 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:49:53,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758307958] [2021-12-06 17:49:53,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758307958] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:49:53,284 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:49:53,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 31 [2021-12-06 17:49:53,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513823648] [2021-12-06 17:49:53,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:49:53,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-06 17:49:53,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:49:53,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-06 17:49:53,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=507, Unknown=23, NotChecked=306, Total=930 [2021-12-06 17:49:53,285 INFO L87 Difference]: Start difference. First operand 495 states and 599 transitions. Second operand has 31 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 31 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:49:53,746 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (and (= (_ bv0 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_77| (_ BitVec 32))) (or (and (forall ((v_ArrVal_2358 (_ BitVec 32)) (v_ArrVal_2366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (let ((.cse0 (store (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse3 (_ bv0 32))))) (store .cse5 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_2358))) |v_ULTIMATE.start_main_#t~malloc7#1.base_77| v_ArrVal_2367))) (select (select .cse0 (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) .cse3 (_ bv0 32))))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_77|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_77| v_ArrVal_2366) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))))) (_ bv0 32))) (forall ((v_ArrVal_2358 (_ BitVec 32)) (v_ArrVal_2366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (let ((.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse7))) (select (let ((.cse6 (store (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse9 (store (select |c_#memory_$Pointer$.base| .cse9) .cse10 (_ bv0 32))))) (store .cse8 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_77|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_77| v_ArrVal_2366))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7))) (select (select (store (let ((.cse11 (store |c_#memory_$Pointer$.offset| .cse9 (store (select |c_#memory_$Pointer$.offset| .cse9) .cse10 (_ bv0 32))))) (store .cse11 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_2358))) |v_ULTIMATE.start_main_#t~malloc7#1.base_77| v_ArrVal_2367) |c_ULTIMATE.start_main_~head~0#1.base|) .cse7))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_77|))))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| .cse12)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| .cse12))) (_ bv1 1))))) is different from false [2021-12-06 17:49:55,965 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (and (= (_ bv0 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse0 |c_ULTIMATE.start_main_#t~mem4#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_77| (_ BitVec 32))) (or (and (forall ((v_ArrVal_2358 (_ BitVec 32)) (v_ArrVal_2366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (let ((.cse1 (store (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base|) |c_ULTIMATE.start_main_#t~mem4#1.offset| (_ bv0 32))))) (store .cse3 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_77|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_77| v_ArrVal_2366))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (select (select (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base|) |c_ULTIMATE.start_main_#t~mem4#1.offset| (_ bv0 32))))) (store .cse4 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_2358))) |v_ULTIMATE.start_main_#t~malloc7#1.base_77| v_ArrVal_2367) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (forall ((v_ArrVal_2358 (_ BitVec 32)) (v_ArrVal_2366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse5 (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base|) |c_ULTIMATE.start_main_#t~mem4#1.offset| (_ bv0 32))))) (store .cse8 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_2358))) |v_ULTIMATE.start_main_#t~malloc7#1.base_77| v_ArrVal_2367)) (.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select .cse5 (select (select (store (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base|) |c_ULTIMATE.start_main_#t~mem4#1.offset| (_ bv0 32))))) (store .cse6 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_77|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_77| v_ArrVal_2366) |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (select (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7))) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_77|))))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| .cse0)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| .cse0))) (_ bv1 1))) (= |c_ULTIMATE.start_main_#t~mem4#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))))) is different from false [2021-12-06 17:50:10,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:50:10,740 INFO L93 Difference]: Finished difference Result 631 states and 744 transitions. [2021-12-06 17:50:10,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-06 17:50:10,742 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 31 states have internal predecessors, (74), 0 states have call successors, (0), 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 41 [2021-12-06 17:50:10,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:50:10,745 INFO L225 Difference]: With dead ends: 631 [2021-12-06 17:50:10,745 INFO L226 Difference]: Without dead ends: 631 [2021-12-06 17:50:10,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=297, Invalid=1602, Unknown=25, NotChecked=728, Total=2652 [2021-12-06 17:50:10,745 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 430 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 2464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1545 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2021-12-06 17:50:10,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 1313 Invalid, 2464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 863 Invalid, 0 Unknown, 1545 Unchecked, 6.8s Time] [2021-12-06 17:50:10,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2021-12-06 17:50:10,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 492. [2021-12-06 17:50:10,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 471 states have (on average 1.2611464968152866) internal successors, (594), 491 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:50:10,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 594 transitions. [2021-12-06 17:50:10,753 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 594 transitions. Word has length 41 [2021-12-06 17:50:10,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:50:10,753 INFO L470 AbstractCegarLoop]: Abstraction has 492 states and 594 transitions. [2021-12-06 17:50:10,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.3870967741935485) internal successors, (74), 31 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:50:10,753 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 594 transitions. [2021-12-06 17:50:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-06 17:50:10,754 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:50:10,754 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:50:10,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (54)] Ended with exit code 0 [2021-12-06 17:50:10,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:50:10,955 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:50:10,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:50:10,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1856945627, now seen corresponding path program 1 times [2021-12-06 17:50:10,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:50:10,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528055057] [2021-12-06 17:50:10,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:50:10,958 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:50:10,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:50:10,960 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:50:10,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (55)] Waiting until timeout for monitored process [2021-12-06 17:50:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:50:11,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-06 17:50:11,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:50:12,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-06 17:50:12,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:50:12,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:50:12,791 INFO L354 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2021-12-06 17:50:12,791 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 25 treesize of output 24 [2021-12-06 17:50:12,923 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-12-06 17:50:12,924 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 15 treesize of output 11 [2021-12-06 17:50:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:50:13,192 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:50:13,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528055057] [2021-12-06 17:50:13,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528055057] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:50:13,192 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:50:13,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2021-12-06 17:50:13,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990456990] [2021-12-06 17:50:13,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:50:13,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:50:13,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:50:13,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:50:13,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:50:13,193 INFO L87 Difference]: Start difference. First operand 492 states and 594 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:50:16,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:50:16,849 INFO L93 Difference]: Finished difference Result 523 states and 609 transitions. [2021-12-06 17:50:16,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 17:50:16,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 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 17:50:16,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:50:16,853 INFO L225 Difference]: With dead ends: 523 [2021-12-06 17:50:16,853 INFO L226 Difference]: Without dead ends: 523 [2021-12-06 17:50:16,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-06 17:50:16,854 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 98 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:50:16,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 431 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2021-12-06 17:50:16,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2021-12-06 17:50:16,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 476. [2021-12-06 17:50:16,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 455 states have (on average 1.2637362637362637) internal successors, (575), 475 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:50:16,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 575 transitions. [2021-12-06 17:50:16,861 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 575 transitions. Word has length 42 [2021-12-06 17:50:16,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:50:16,861 INFO L470 AbstractCegarLoop]: Abstraction has 476 states and 575 transitions. [2021-12-06 17:50:16,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:50:16,861 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 575 transitions. [2021-12-06 17:50:16,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-06 17:50:16,861 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:50:16,862 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-06 17:50:16,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (55)] Ended with exit code 0 [2021-12-06 17:50:17,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:50:17,063 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-06 17:50:17,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:50:17,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1044436873, now seen corresponding path program 2 times [2021-12-06 17:50:17,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:50:17,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451523384] [2021-12-06 17:50:17,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 17:50:17,066 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:50:17,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:50:17,068 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:50:17,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (56)] Waiting until timeout for monitored process [2021-12-06 17:50:17,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 17:50:17,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:50:17,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-06 17:50:17,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:50:17,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 17:50:17,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:50:17,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-06 17:50:18,033 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:50:18,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2021-12-06 17:50:18,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:50:18,280 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 21 treesize of output 20 [2021-12-06 17:50:18,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:50:18,328 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 21 treesize of output 20 [2021-12-06 17:50:19,195 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:50:19,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:50:19,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:50:19,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-06 17:50:19,531 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:50:19,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:50:19,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:50:19,591 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 16 treesize of output 18 [2021-12-06 17:50:19,744 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:50:19,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:50:19,759 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 17:50:19,906 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 17:50:19,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-06 17:50:20,143 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 17:50:20,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2021-12-06 17:50:20,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:50:20,497 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-12-06 17:50:20,497 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 2 case distinctions, treesize of input 36 treesize of output 34 [2021-12-06 17:50:20,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 17:50:20,571 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 16 treesize of output 18 [2021-12-06 17:50:21,509 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:50:21,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:50:21,535 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 17:50:21,761 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-06 17:50:21,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2021-12-06 17:50:21,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-12-06 17:50:22,562 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 17:50:22,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-06 17:50:22,588 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 17:50:22,809 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-06 17:50:22,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2021-12-06 17:50:22,819 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:50:22,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451523384] [2021-12-06 17:50:22,820 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-12-06 17:50:22,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1329116310] [2021-12-06 17:50:22,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 17:50:22,820 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 17:50:22,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 17:50:22,821 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 17:50:22,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (57)] Waiting until timeout for monitored process [2021-12-06 17:50:22,950 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@36944d58 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:119) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:274) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1226) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:388) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-06 17:50:22,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363509117] [2021-12-06 17:50:22,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 17:50:22,952 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:50:22,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:50:22,953 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:50:22,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2021-12-06 17:50:23,032 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@36944d58 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:119) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:274) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1226) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:388) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-06 17:50:23,033 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:50:23,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-12-06 17:50:23,033 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-12-06 17:50:23,033 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-12-06 17:50:23,037 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK (65 of 66 remaining) [2021-12-06 17:50:23,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (64 of 66 remaining) [2021-12-06 17:50:23,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (63 of 66 remaining) [2021-12-06 17:50:23,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (62 of 66 remaining) [2021-12-06 17:50:23,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (61 of 66 remaining) [2021-12-06 17:50:23,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (60 of 66 remaining) [2021-12-06 17:50:23,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (59 of 66 remaining) [2021-12-06 17:50:23,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (58 of 66 remaining) [2021-12-06 17:50:23,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (57 of 66 remaining) [2021-12-06 17:50:23,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (56 of 66 remaining) [2021-12-06 17:50:23,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (55 of 66 remaining) [2021-12-06 17:50:23,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (54 of 66 remaining) [2021-12-06 17:50:23,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (53 of 66 remaining) [2021-12-06 17:50:23,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (52 of 66 remaining) [2021-12-06 17:50:23,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (51 of 66 remaining) [2021-12-06 17:50:23,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (50 of 66 remaining) [2021-12-06 17:50:23,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (49 of 66 remaining) [2021-12-06 17:50:23,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (48 of 66 remaining) [2021-12-06 17:50:23,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (47 of 66 remaining) [2021-12-06 17:50:23,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (46 of 66 remaining) [2021-12-06 17:50:23,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (45 of 66 remaining) [2021-12-06 17:50:23,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (44 of 66 remaining) [2021-12-06 17:50:23,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (43 of 66 remaining) [2021-12-06 17:50:23,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (42 of 66 remaining) [2021-12-06 17:50:23,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (41 of 66 remaining) [2021-12-06 17:50:23,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (40 of 66 remaining) [2021-12-06 17:50:23,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (39 of 66 remaining) [2021-12-06 17:50:23,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (38 of 66 remaining) [2021-12-06 17:50:23,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (37 of 66 remaining) [2021-12-06 17:50:23,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (36 of 66 remaining) [2021-12-06 17:50:23,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (35 of 66 remaining) [2021-12-06 17:50:23,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (34 of 66 remaining) [2021-12-06 17:50:23,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (33 of 66 remaining) [2021-12-06 17:50:23,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (32 of 66 remaining) [2021-12-06 17:50:23,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (31 of 66 remaining) [2021-12-06 17:50:23,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (30 of 66 remaining) [2021-12-06 17:50:23,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (29 of 66 remaining) [2021-12-06 17:50:23,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (28 of 66 remaining) [2021-12-06 17:50:23,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (27 of 66 remaining) [2021-12-06 17:50:23,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (26 of 66 remaining) [2021-12-06 17:50:23,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (25 of 66 remaining) [2021-12-06 17:50:23,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (24 of 66 remaining) [2021-12-06 17:50:23,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (23 of 66 remaining) [2021-12-06 17:50:23,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (22 of 66 remaining) [2021-12-06 17:50:23,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (21 of 66 remaining) [2021-12-06 17:50:23,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION (20 of 66 remaining) [2021-12-06 17:50:23,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (19 of 66 remaining) [2021-12-06 17:50:23,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (18 of 66 remaining) [2021-12-06 17:50:23,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (17 of 66 remaining) [2021-12-06 17:50:23,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION (16 of 66 remaining) [2021-12-06 17:50:23,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (15 of 66 remaining) [2021-12-06 17:50:23,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION (14 of 66 remaining) [2021-12-06 17:50:23,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION (13 of 66 remaining) [2021-12-06 17:50:23,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION (12 of 66 remaining) [2021-12-06 17:50:23,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION (11 of 66 remaining) [2021-12-06 17:50:23,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (10 of 66 remaining) [2021-12-06 17:50:23,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION (9 of 66 remaining) [2021-12-06 17:50:23,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION (8 of 66 remaining) [2021-12-06 17:50:23,043 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION (7 of 66 remaining) [2021-12-06 17:50:23,043 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE (6 of 66 remaining) [2021-12-06 17:50:23,043 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE (5 of 66 remaining) [2021-12-06 17:50:23,043 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE (4 of 66 remaining) [2021-12-06 17:50:23,043 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE (3 of 66 remaining) [2021-12-06 17:50:23,043 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (2 of 66 remaining) [2021-12-06 17:50:23,043 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE (1 of 66 remaining) [2021-12-06 17:50:23,043 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK (0 of 66 remaining) [2021-12-06 17:50:23,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2021-12-06 17:50:23,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (56)] Ended with exit code 0 [2021-12-06 17:50:23,449 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (57)] Ended with exit code 0 [2021-12-06 17:50:23,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,56 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3,57 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt [2021-12-06 17:50:23,651 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:50:23,653 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 17:50:23,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:50:23 BoogieIcfgContainer [2021-12-06 17:50:23,662 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 17:50:23,662 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 17:50:23,662 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 17:50:23,662 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 17:50:23,662 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:42:42" (3/4) ... [2021-12-06 17:50:23,664 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-06 17:50:23,664 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 17:50:23,665 INFO L158 Benchmark]: Toolchain (without parser) took 462538.65ms. Allocated memory was 58.7MB in the beginning and 117.4MB in the end (delta: 58.7MB). Free memory was 35.9MB in the beginning and 72.2MB in the end (delta: -36.3MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2021-12-06 17:50:23,665 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 58.7MB. Free memory is still 39.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:50:23,665 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.00ms. Allocated memory was 58.7MB in the beginning and 79.7MB in the end (delta: 21.0MB). Free memory was 35.8MB in the beginning and 54.6MB in the end (delta: -18.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 17:50:23,665 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.81ms. Allocated memory is still 79.7MB. Free memory was 54.6MB in the beginning and 52.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:50:23,665 INFO L158 Benchmark]: Boogie Preprocessor took 28.46ms. Allocated memory is still 79.7MB. Free memory was 52.4MB in the beginning and 50.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:50:23,665 INFO L158 Benchmark]: RCFGBuilder took 652.26ms. Allocated memory is still 79.7MB. Free memory was 50.4MB in the beginning and 55.4MB in the end (delta: -5.0MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2021-12-06 17:50:23,665 INFO L158 Benchmark]: TraceAbstraction took 461461.19ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 54.5MB in the beginning and 72.2MB in the end (delta: -17.7MB). Peak memory consumption was 70.2MB. Max. memory is 16.1GB. [2021-12-06 17:50:23,665 INFO L158 Benchmark]: Witness Printer took 2.39ms. Allocated memory is still 117.4MB. Free memory is still 72.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:50:23,665 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 58.7MB. Free memory is still 39.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.00ms. Allocated memory was 58.7MB in the beginning and 79.7MB in the end (delta: 21.0MB). Free memory was 35.8MB in the beginning and 54.6MB in the end (delta: -18.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.81ms. Allocated memory is still 79.7MB. Free memory was 54.6MB in the beginning and 52.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.46ms. Allocated memory is still 79.7MB. Free memory was 52.4MB in the beginning and 50.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 652.26ms. Allocated memory is still 79.7MB. Free memory was 50.4MB in the beginning and 55.4MB in the end (delta: -5.0MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * TraceAbstraction took 461461.19ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 54.5MB in the beginning and 72.2MB in the end (delta: -17.7MB). Peak memory consumption was 70.2MB. Max. memory is 16.1GB. * Witness Printer took 2.39ms. Allocated memory is still 117.4MB. Free memory is still 72.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1007]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: unable to decide satisfiability of path constraint, overapproximation of memtrack at line 1007. Possible FailurePath: [L996] SLL* head = malloc(sizeof(SLL)); [L997] head->next = ((void*)0) [L998] COND FALSE !(__VERIFIER_nondet_int()) [L998] COND FALSE !(__VERIFIER_nondet_int()) [L998] head->data = 0 [L998] head->opt = head [L999] SLL* x = head; [L1001] COND TRUE __VERIFIER_nondet_int() [L1001] x->next = malloc(sizeof(SLL)) [L1001] EXPR x->next [L1001] x = x->next [L1001] x->next = ((void*)0) [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1001] COND TRUE __VERIFIER_nondet_int() [L1001] x->data = 1 [L1001] x->opt = x [L1001] COND TRUE __VERIFIER_nondet_int() [L1001] x->next = malloc(sizeof(SLL)) [L1001] EXPR x->next [L1001] x = x->next [L1001] x->next = ((void*)0) [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1001] COND TRUE __VERIFIER_nondet_int() [L1001] x->data = 1 [L1001] x->opt = x [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1004] x = head [L1005] COND TRUE x != ((void*)0) [L1007] EXPR x->data [L1007] EXPR x->data == 2 && x->opt != x [L1007] EXPR x->data == 2 && x->opt != x && x->opt->next == ((void*)0) [L1007] EXPR (x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x [L1007] EXPR x->opt [L1007] EXPR (x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x [L1007] COND TRUE !((x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x) [L1007] reach_error() - UnprovableResult [Line: 997]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 997]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 993]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 66 error locations. Started 1 CEGAR loops. OverallTime: 461.4s, OverallIterations: 55, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 191.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12439 SdHoareTripleChecker+Valid, 101.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12439 mSDsluCounter, 31855 SdHoareTripleChecker+Invalid, 90.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 36928 IncrementalHoareTripleChecker+Unchecked, 27237 mSDsCounter, 1746 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24558 IncrementalHoareTripleChecker+Invalid, 63232 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1746 mSolverCounterUnsat, 4618 mSDtfsCounter, 24558 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3271 GetRequests, 1852 SyntacticMatches, 179 SemanticMatches, 1240 ConstructedPredicates, 169 IntricatePredicates, 12 DeprecatedPredicates, 6208 ImplicationChecksByTransitivity, 222.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=516occurred in iteration=49, InterpolantAutomatonStates: 858, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 54 MinimizatonAttempts, 4693 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 249.2s InterpolantComputationTime, 1626 NumberOfCodeBlocks, 1626 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 2625 ConstructedInterpolants, 719 QuantifiedInterpolants, 68120 SizeOfPredicates, 575 NumberOfNonLiveVariables, 8101 ConjunctsInSsa, 1145 ConjunctsInUnsatCore, 85 InterpolantComputations, 23 PerfectInterpolantSequences, 11/131 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-06 17:50:23,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8d0174e-0c4d-471e-8a1f-024f3555d04d/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN