./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-properties/alternating_list-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/alternating_list-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc --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 941f3dd0e4566f414ae914eed10af26405f8e9f2f3d427c146090b07336d2fc2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:04:28,425 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:04:28,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:04:28,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:04:28,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:04:28,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:04:28,463 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:04:28,465 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:04:28,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:04:28,467 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:04:28,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:04:28,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:04:28,470 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:04:28,471 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:04:28,472 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:04:28,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:04:28,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:04:28,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:04:28,477 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:04:28,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:04:28,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:04:28,482 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:04:28,483 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:04:28,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:04:28,487 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:04:28,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:04:28,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:04:28,489 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:04:28,490 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:04:28,491 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:04:28,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:04:28,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:04:28,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:04:28,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:04:28,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:04:28,496 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:04:28,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:04:28,498 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:04:28,498 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:04:28,499 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:04:28,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:04:28,505 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 21:04:28,536 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:04:28,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:04:28,537 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:04:28,537 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:04:28,538 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:04:28,538 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:04:28,539 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:04:28,539 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:04:28,539 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:04:28,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:04:28,539 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:04:28,540 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 21:04:28,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:04:28,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:04:28,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:04:28,540 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 21:04:28,540 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 21:04:28,541 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 21:04:28,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:04:28,541 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 21:04:28,541 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:04:28,541 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:04:28,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:04:28,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:04:28,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:04:28,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:04:28,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:04:28,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:04:28,542 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:04:28,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:04:28,547 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_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/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_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc 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 -> 941f3dd0e4566f414ae914eed10af26405f8e9f2f3d427c146090b07336d2fc2 [2022-11-02 21:04:28,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:04:28,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:04:28,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:04:28,854 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:04:28,855 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:04:28,857 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-properties/alternating_list-1.i [2022-11-02 21:04:28,931 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/data/1cc5724c1/e9df43a36c224a3db339ba57db6d707a/FLAG0e2d2d15d [2022-11-02 21:04:29,550 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:04:29,551 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/sv-benchmarks/c/list-properties/alternating_list-1.i [2022-11-02 21:04:29,570 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/data/1cc5724c1/e9df43a36c224a3db339ba57db6d707a/FLAG0e2d2d15d [2022-11-02 21:04:29,803 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/data/1cc5724c1/e9df43a36c224a3db339ba57db6d707a [2022-11-02 21:04:29,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:04:29,810 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:04:29,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:04:29,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:04:29,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:04:29,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:04:29" (1/1) ... [2022-11-02 21:04:29,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d0d7f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:29, skipping insertion in model container [2022-11-02 21:04:29,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:04:29" (1/1) ... [2022-11-02 21:04:29,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:04:29,861 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:04:30,330 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_13626697-6eea-43dc-8208-ec5c7478af45/sv-benchmarks/c/list-properties/alternating_list-1.i[23574,23587] [2022-11-02 21:04:30,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:04:30,347 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:04:30,405 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_13626697-6eea-43dc-8208-ec5c7478af45/sv-benchmarks/c/list-properties/alternating_list-1.i[23574,23587] [2022-11-02 21:04:30,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:04:30,438 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:04:30,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:30 WrapperNode [2022-11-02 21:04:30,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:04:30,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:04:30,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:04:30,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:04:30,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:30" (1/1) ... [2022-11-02 21:04:30,461 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:30" (1/1) ... [2022-11-02 21:04:30,482 INFO L138 Inliner]: procedures = 124, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 91 [2022-11-02 21:04:30,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:04:30,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:04:30,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:04:30,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:04:30,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:30" (1/1) ... [2022-11-02 21:04:30,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:30" (1/1) ... [2022-11-02 21:04:30,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:30" (1/1) ... [2022-11-02 21:04:30,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:30" (1/1) ... [2022-11-02 21:04:30,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:30" (1/1) ... [2022-11-02 21:04:30,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:30" (1/1) ... [2022-11-02 21:04:30,511 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:30" (1/1) ... [2022-11-02 21:04:30,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:30" (1/1) ... [2022-11-02 21:04:30,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:04:30,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:04:30,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:04:30,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:04:30,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:30" (1/1) ... [2022-11-02 21:04:30,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:04:30,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:30,576 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:04:30,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:04:30,622 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-02 21:04:30,622 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-02 21:04:30,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:04:30,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:04:30,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:04:30,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:04:30,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:04:30,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:04:30,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:04:30,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:04:30,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:04:30,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:04:30,752 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:04:30,754 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:04:30,796 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-02 21:04:31,136 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:04:31,142 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:04:31,159 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 21:04:31,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:04:31 BoogieIcfgContainer [2022-11-02 21:04:31,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:04:31,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:04:31,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:04:31,167 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:04:31,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:04:29" (1/3) ... [2022-11-02 21:04:31,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158e174d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:04:31, skipping insertion in model container [2022-11-02 21:04:31,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:30" (2/3) ... [2022-11-02 21:04:31,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158e174d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:04:31, skipping insertion in model container [2022-11-02 21:04:31,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:04:31" (3/3) ... [2022-11-02 21:04:31,171 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list-1.i [2022-11-02 21:04:31,224 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:04:31,225 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-02 21:04:31,294 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:04:31,304 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@101938f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:04:31,304 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-11-02 21:04:31,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 74 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:31,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 21:04:31,330 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:31,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 21:04:31,331 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:04:31,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:31,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1037517576, now seen corresponding path program 1 times [2022-11-02 21:04:31,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:31,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032281482] [2022-11-02 21:04:31,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:31,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:31,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:31,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:31,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032281482] [2022-11-02 21:04:31,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032281482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:31,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:31,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:04:31,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945369244] [2022-11-02 21:04:31,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:31,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 21:04:31,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:31,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 21:04:31,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:04:31,609 INFO L87 Difference]: Start difference. First operand has 76 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 74 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:31,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:31,639 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-11-02 21:04:31,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 21:04:31,641 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-02 21:04:31,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:31,648 INFO L225 Difference]: With dead ends: 76 [2022-11-02 21:04:31,648 INFO L226 Difference]: Without dead ends: 70 [2022-11-02 21:04:31,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:04:31,654 INFO L413 NwaCegarLoop]: 83 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, 83 SdHoareTripleChecker+Invalid, 0 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 [2022-11-02 21:04:31,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:04:31,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-02 21:04:31,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-02 21:04:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 40 states have (on average 1.875) internal successors, (75), 69 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) [2022-11-02 21:04:31,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-11-02 21:04:31,698 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 6 [2022-11-02 21:04:31,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:31,699 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-11-02 21:04:31,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-11-02 21:04:31,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 21:04:31,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:31,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:31,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:04:31,701 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:04:31,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:31,703 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238131, now seen corresponding path program 1 times [2022-11-02 21:04:31,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:31,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420343689] [2022-11-02 21:04:31,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:31,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:31,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:31,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420343689] [2022-11-02 21:04:31,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420343689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:31,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:31,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:04:31,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894027849] [2022-11-02 21:04:31,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:31,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:31,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:31,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:31,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:31,864 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:32,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:32,023 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-11-02 21:04:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:04:32,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-02 21:04:32,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:32,025 INFO L225 Difference]: With dead ends: 91 [2022-11-02 21:04:32,025 INFO L226 Difference]: Without dead ends: 91 [2022-11-02 21:04:32,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:32,027 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 122 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:32,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 49 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:04:32,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-02 21:04:32,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2022-11-02 21:04:32,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 70 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:32,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2022-11-02 21:04:32,041 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 7 [2022-11-02 21:04:32,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:32,041 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2022-11-02 21:04:32,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-11-02 21:04:32,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 21:04:32,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:32,042 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:32,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:04:32,043 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:04:32,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:32,044 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238132, now seen corresponding path program 1 times [2022-11-02 21:04:32,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:32,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502336867] [2022-11-02 21:04:32,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:32,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:32,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:32,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502336867] [2022-11-02 21:04:32,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502336867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:32,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:32,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:04:32,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644521255] [2022-11-02 21:04:32,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:32,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:32,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:32,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:32,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:32,226 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:32,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:32,392 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2022-11-02 21:04:32,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:32,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-02 21:04:32,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:32,400 INFO L225 Difference]: With dead ends: 99 [2022-11-02 21:04:32,401 INFO L226 Difference]: Without dead ends: 99 [2022-11-02 21:04:32,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:32,408 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 135 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:32,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 61 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:04:32,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-02 21:04:32,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2022-11-02 21:04:32,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.546875) internal successors, (99), 86 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:32,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2022-11-02 21:04:32,415 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 7 [2022-11-02 21:04:32,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:32,415 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2022-11-02 21:04:32,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:32,416 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2022-11-02 21:04:32,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 21:04:32,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:32,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:32,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:04:32,417 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:04:32,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:32,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1723954815, now seen corresponding path program 1 times [2022-11-02 21:04:32,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:32,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247417804] [2022-11-02 21:04:32,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:32,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:32,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:32,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:32,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247417804] [2022-11-02 21:04:32,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247417804] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:32,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:32,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:04:32,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331887399] [2022-11-02 21:04:32,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:32,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:04:32,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:32,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:04:32,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:04:32,555 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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) [2022-11-02 21:04:32,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:32,571 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-11-02 21:04:32,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:04:32,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 [2022-11-02 21:04:32,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:32,573 INFO L225 Difference]: With dead ends: 136 [2022-11-02 21:04:32,573 INFO L226 Difference]: Without dead ends: 136 [2022-11-02 21:04:32,573 INFO L412 NwaCegarLoop]: 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 [2022-11-02 21:04:32,574 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 51 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:32,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 134 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:04:32,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-02 21:04:32,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 96. [2022-11-02 21:04:32,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 73 states have (on average 1.5342465753424657) internal successors, (112), 95 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2022-11-02 21:04:32,583 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 14 [2022-11-02 21:04:32,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:32,584 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2022-11-02 21:04:32,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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) [2022-11-02 21:04:32,584 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2022-11-02 21:04:32,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 21:04:32,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:32,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:32,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:04:32,586 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:04:32,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:32,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1723646985, now seen corresponding path program 1 times [2022-11-02 21:04:32,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:32,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337645685] [2022-11-02 21:04:32,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:32,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:32,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:32,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:32,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337645685] [2022-11-02 21:04:32,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337645685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:32,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:32,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:04:32,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893392041] [2022-11-02 21:04:32,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:32,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:04:32,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:32,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:04:32,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:04:32,756 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) 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) [2022-11-02 21:04:32,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:32,959 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2022-11-02 21:04:32,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:04:32,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) 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 [2022-11-02 21:04:32,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:32,961 INFO L225 Difference]: With dead ends: 141 [2022-11-02 21:04:32,961 INFO L226 Difference]: Without dead ends: 141 [2022-11-02 21:04:32,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:04:32,963 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 78 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:32,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 202 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:04:32,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-02 21:04:32,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 99. [2022-11-02 21:04:32,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 76 states have (on average 1.513157894736842) internal successors, (115), 98 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) [2022-11-02 21:04:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2022-11-02 21:04:32,970 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 14 [2022-11-02 21:04:32,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:32,971 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2022-11-02 21:04:32,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) 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) [2022-11-02 21:04:32,971 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2022-11-02 21:04:32,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 21:04:32,972 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:32,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:32,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:04:32,973 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:04:32,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:32,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1862079005, now seen corresponding path program 1 times [2022-11-02 21:04:32,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:32,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118036506] [2022-11-02 21:04:32,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:32,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:33,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:33,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:33,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118036506] [2022-11-02 21:04:33,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118036506] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:33,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:33,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:04:33,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892488240] [2022-11-02 21:04:33,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:33,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:33,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:33,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:33,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:33,038 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand has 4 states, 3 states have (on average 5.0) 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) [2022-11-02 21:04:33,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:33,140 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2022-11-02 21:04:33,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:33,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) 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 [2022-11-02 21:04:33,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:33,141 INFO L225 Difference]: With dead ends: 106 [2022-11-02 21:04:33,141 INFO L226 Difference]: Without dead ends: 106 [2022-11-02 21:04:33,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:33,143 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 107 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:33,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 72 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:04:33,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-02 21:04:33,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2022-11-02 21:04:33,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 99 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:33,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 116 transitions. [2022-11-02 21:04:33,149 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 116 transitions. Word has length 15 [2022-11-02 21:04:33,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:33,150 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 116 transitions. [2022-11-02 21:04:33,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) 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) [2022-11-02 21:04:33,150 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2022-11-02 21:04:33,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 21:04:33,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:33,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:33,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:04:33,165 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:04:33,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:33,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1889920183, now seen corresponding path program 1 times [2022-11-02 21:04:33,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:33,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481084214] [2022-11-02 21:04:33,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:33,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:33,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:33,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:33,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481084214] [2022-11-02 21:04:33,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481084214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:33,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:33,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:04:33,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992654882] [2022-11-02 21:04:33,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:33,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:04:33,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:33,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:04:33,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:04:33,330 INFO L87 Difference]: Start difference. First operand 100 states and 116 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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) [2022-11-02 21:04:33,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:33,557 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2022-11-02 21:04:33,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:04:33,557 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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 [2022-11-02 21:04:33,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:33,558 INFO L225 Difference]: With dead ends: 116 [2022-11-02 21:04:33,558 INFO L226 Difference]: Without dead ends: 116 [2022-11-02 21:04:33,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:04:33,560 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 44 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:33,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 242 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:04:33,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-02 21:04:33,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2022-11-02 21:04:33,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 80 states have (on average 1.4875) internal successors, (119), 102 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2022-11-02 21:04:33,566 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 16 [2022-11-02 21:04:33,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:33,567 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2022-11-02 21:04:33,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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) [2022-11-02 21:04:33,567 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2022-11-02 21:04:33,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 21:04:33,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:33,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:33,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:04:33,569 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:04:33,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:33,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1543433373, now seen corresponding path program 1 times [2022-11-02 21:04:33,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:33,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792992993] [2022-11-02 21:04:33,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:33,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:33,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:33,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:33,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792992993] [2022-11-02 21:04:33,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792992993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:33,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:33,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:33,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593221385] [2022-11-02 21:04:33,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:33,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:04:33,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:33,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:04:33,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:33,669 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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) [2022-11-02 21:04:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:33,820 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2022-11-02 21:04:33,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:04:33,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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 [2022-11-02 21:04:33,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:33,821 INFO L225 Difference]: With dead ends: 110 [2022-11-02 21:04:33,821 INFO L226 Difference]: Without dead ends: 99 [2022-11-02 21:04:33,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:04:33,823 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 17 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:33,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 162 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:04:33,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-02 21:04:33,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-11-02 21:04:33,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 76 states have (on average 1.5) internal successors, (114), 98 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2022-11-02 21:04:33,828 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 17 [2022-11-02 21:04:33,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:33,828 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2022-11-02 21:04:33,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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) [2022-11-02 21:04:33,828 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2022-11-02 21:04:33,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 21:04:33,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:33,829 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:33,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:04:33,829 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:04:33,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:33,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1088042016, now seen corresponding path program 1 times [2022-11-02 21:04:33,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:33,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179101563] [2022-11-02 21:04:33,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:33,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:33,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:33,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:33,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179101563] [2022-11-02 21:04:33,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179101563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:33,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:33,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:04:33,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486118700] [2022-11-02 21:04:33,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:33,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:04:33,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:33,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:04:33,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:04:33,975 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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) [2022-11-02 21:04:34,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:34,133 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2022-11-02 21:04:34,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:04:34,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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 [2022-11-02 21:04:34,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:34,135 INFO L225 Difference]: With dead ends: 104 [2022-11-02 21:04:34,135 INFO L226 Difference]: Without dead ends: 104 [2022-11-02 21:04:34,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:04:34,136 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 95 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:34,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 123 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:04:34,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-02 21:04:34,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2022-11-02 21:04:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 95 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:34,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2022-11-02 21:04:34,141 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 17 [2022-11-02 21:04:34,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:34,141 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2022-11-02 21:04:34,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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) [2022-11-02 21:04:34,141 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2022-11-02 21:04:34,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 21:04:34,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:34,142 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:34,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:04:34,142 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:04:34,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:34,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1088042017, now seen corresponding path program 1 times [2022-11-02 21:04:34,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:34,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296031904] [2022-11-02 21:04:34,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:34,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:34,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:34,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:34,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296031904] [2022-11-02 21:04:34,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296031904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:34,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:34,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:04:34,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169197172] [2022-11-02 21:04:34,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:34,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:04:34,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:34,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:04:34,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:04:34,398 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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) [2022-11-02 21:04:34,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:34,615 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2022-11-02 21:04:34,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:04:34,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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 [2022-11-02 21:04:34,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:34,617 INFO L225 Difference]: With dead ends: 92 [2022-11-02 21:04:34,617 INFO L226 Difference]: Without dead ends: 92 [2022-11-02 21:04:34,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:04:34,618 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 65 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:34,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 144 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:04:34,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-02 21:04:34,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2022-11-02 21:04:34,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 83 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:34,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 97 transitions. [2022-11-02 21:04:34,623 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 97 transitions. Word has length 17 [2022-11-02 21:04:34,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:34,623 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 97 transitions. [2022-11-02 21:04:34,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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) [2022-11-02 21:04:34,624 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2022-11-02 21:04:34,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 21:04:34,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:34,625 INFO L195 NwaCegarLoop]: 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] [2022-11-02 21:04:34,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:04:34,626 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:04:34,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:34,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1458314748, now seen corresponding path program 1 times [2022-11-02 21:04:34,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:34,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871532125] [2022-11-02 21:04:34,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:34,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:35,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:35,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:35,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871532125] [2022-11-02 21:04:35,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871532125] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:35,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305436318] [2022-11-02 21:04:35,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:35,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:35,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:35,075 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:35,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:04:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:35,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-02 21:04:35,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:35,394 INFO L390 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 [2022-11-02 21:04:35,467 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:04:35,468 INFO L390 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 [2022-11-02 21:04:35,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:35,547 INFO L390 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 [2022-11-02 21:04:35,558 INFO L390 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 [2022-11-02 21:04:35,606 INFO L390 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 [2022-11-02 21:04:35,682 INFO L390 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 [2022-11-02 21:04:35,745 INFO L390 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 [2022-11-02 21:04:35,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:35,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:04:35,772 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_130 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_130) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-02 21:04:35,790 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_130 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_130) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-02 21:04:35,797 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_130 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_130) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-02 21:04:35,807 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_130 (Array Int Int)) (v_ArrVal_129 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_129)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_130) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-02 21:04:35,954 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:04:35,954 INFO L390 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 23 treesize of output 29 [2022-11-02 21:04:35,980 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-02 21:04:35,980 INFO L390 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 29 [2022-11-02 21:04:35,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 21:04:36,013 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 21:04:36,014 INFO L390 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 [2022-11-02 21:04:36,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:04:36,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305436318] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:04:36,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:04:36,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 28 [2022-11-02 21:04:36,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776271204] [2022-11-02 21:04:36,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:04:36,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-02 21:04:36,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:36,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-02 21:04:36,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=450, Unknown=4, NotChecked=188, Total=756 [2022-11-02 21:04:36,101 INFO L87 Difference]: Start difference. First operand 84 states and 97 transitions. Second operand has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 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) [2022-11-02 21:04:37,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:37,168 INFO L93 Difference]: Finished difference Result 384 states and 409 transitions. [2022-11-02 21:04:37,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-02 21:04:37,169 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 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 24 [2022-11-02 21:04:37,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:37,170 INFO L225 Difference]: With dead ends: 384 [2022-11-02 21:04:37,171 INFO L226 Difference]: Without dead ends: 384 [2022-11-02 21:04:37,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=337, Invalid=1315, Unknown=4, NotChecked=324, Total=1980 [2022-11-02 21:04:37,172 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 521 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 774 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:37,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 783 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 673 Invalid, 0 Unknown, 774 Unchecked, 0.6s Time] [2022-11-02 21:04:37,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-11-02 21:04:37,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 101. [2022-11-02 21:04:37,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 100 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:37,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2022-11-02 21:04:37,179 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 24 [2022-11-02 21:04:37,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:37,179 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2022-11-02 21:04:37,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 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) [2022-11-02 21:04:37,180 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2022-11-02 21:04:37,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 21:04:37,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:37,181 INFO L195 NwaCegarLoop]: 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] [2022-11-02 21:04:37,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:04:37,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:37,407 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:04:37,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:37,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1281158610, now seen corresponding path program 1 times [2022-11-02 21:04:37,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:37,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400674858] [2022-11-02 21:04:37,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:37,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:37,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:37,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:37,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400674858] [2022-11-02 21:04:37,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400674858] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:37,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293766193] [2022-11-02 21:04:37,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:37,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:37,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:37,852 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:37,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 21:04:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:37,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-02 21:04:37,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:38,094 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 21:04:38,095 INFO L390 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 [2022-11-02 21:04:38,204 INFO L390 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 [2022-11-02 21:04:38,471 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:04:38,471 INFO L390 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 [2022-11-02 21:04:38,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:04:38,769 INFO L390 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 31 treesize of output 13 [2022-11-02 21:04:38,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:38,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:04:39,232 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:04:39,233 INFO L390 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 [2022-11-02 21:04:39,245 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:04:39,246 INFO L390 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 39 [2022-11-02 21:04:39,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2022-11-02 21:04:42,010 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:04:42,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 111 treesize of output 381 [2022-11-02 21:04:50,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:50,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293766193] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:04:50,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:04:50,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2022-11-02 21:04:50,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617217497] [2022-11-02 21:04:50,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:04:50,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-02 21:04:50,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:50,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-02 21:04:50,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1020, Unknown=7, NotChecked=0, Total=1190 [2022-11-02 21:04:50,279 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand has 35 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 35 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) [2022-11-02 21:04:50,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:50,556 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2022-11-02 21:04:50,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:04:50,557 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 35 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-02 21:04:50,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:50,558 INFO L225 Difference]: With dead ends: 108 [2022-11-02 21:04:50,558 INFO L226 Difference]: Without dead ends: 108 [2022-11-02 21:04:50,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=229, Invalid=1170, Unknown=7, NotChecked=0, Total=1406 [2022-11-02 21:04:50,559 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 67 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 248 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:50,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 566 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 248 Unchecked, 0.1s Time] [2022-11-02 21:04:50,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-02 21:04:50,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2022-11-02 21:04:50,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 89 states have (on average 1.348314606741573) internal successors, (120), 103 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2022-11-02 21:04:50,563 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 26 [2022-11-02 21:04:50,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:50,564 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2022-11-02 21:04:50,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 35 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) [2022-11-02 21:04:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2022-11-02 21:04:50,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 21:04:50,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:50,565 INFO L195 NwaCegarLoop]: 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] [2022-11-02 21:04:50,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:04:50,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 21:04:50,780 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:04:50,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:50,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1281158611, now seen corresponding path program 1 times [2022-11-02 21:04:50,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:50,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837137618] [2022-11-02 21:04:50,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:50,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:51,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:51,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:51,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837137618] [2022-11-02 21:04:51,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837137618] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:51,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803306226] [2022-11-02 21:04:51,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:51,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:51,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:51,391 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:51,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 21:04:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:51,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-02 21:04:51,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:51,596 INFO L390 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 [2022-11-02 21:04:51,615 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:04:51,615 INFO L390 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 [2022-11-02 21:04:51,680 INFO L390 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 [2022-11-02 21:04:51,687 INFO L390 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 [2022-11-02 21:04:51,921 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:04:51,922 INFO L390 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 [2022-11-02 21:04:51,928 INFO L390 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 [2022-11-02 21:04:52,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:04:52,184 INFO L390 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 19 treesize of output 7 [2022-11-02 21:04:52,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:04:52,192 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:04:52,193 INFO L390 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 31 treesize of output 16 [2022-11-02 21:04:52,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:52,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:04:52,544 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_229 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_45| Int)) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_45| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_45|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_45| 4))))) (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_228 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_45| Int)) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_45| |c_ULTIMATE.start_main_~a~0#1.offset|)) (let ((.cse0 (+ |v_ULTIMATE.start_main_~p~0#1.offset_45| 4))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_228) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_45|))))) is different from false [2022-11-02 21:04:52,613 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_228 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_45| Int)) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_45| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_45|)) (let ((.cse0 (+ |v_ULTIMATE.start_main_~p~0#1.offset_45| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_228) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (forall ((v_ArrVal_229 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_45| Int)) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_45| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_45|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_45| 4)))))) is different from false [2022-11-02 21:04:52,642 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))) (and (forall ((v_ArrVal_229 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_45| Int)) (or (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_45| 4))) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_45| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_45|)))) (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_228 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_45| Int)) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_45| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_45|)) (let ((.cse1 (+ |v_ULTIMATE.start_main_~p~0#1.offset_45| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_228) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))))) is different from false [2022-11-02 21:04:52,659 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:04:52,660 INFO L390 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 [2022-11-02 21:04:52,669 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:04:52,669 INFO L390 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 35 [2022-11-02 21:04:52,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2022-11-02 21:04:52,718 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:04:52,719 INFO L390 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 45 treesize of output 46 [2022-11-02 21:04:52,729 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:04:52,730 INFO L390 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 35 treesize of output 36 [2022-11-02 21:04:52,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:04:52,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:52,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:52,739 INFO L390 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 33 treesize of output 21 [2022-11-02 21:04:52,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:04:52,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:52,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:52,749 INFO L390 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 24 treesize of output 12 [2022-11-02 21:04:53,033 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:04:53,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2022-11-02 21:04:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:04:53,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803306226] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:04:53,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:04:53,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2022-11-02 21:04:53,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7549634] [2022-11-02 21:04:53,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:04:53,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-02 21:04:53,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:53,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-02 21:04:53,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=973, Unknown=3, NotChecked=198, Total=1332 [2022-11-02 21:04:53,913 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 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) [2022-11-02 21:04:54,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:54,856 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2022-11-02 21:04:54,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:04:54,857 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 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 26 [2022-11-02 21:04:54,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:54,858 INFO L225 Difference]: With dead ends: 126 [2022-11-02 21:04:54,858 INFO L226 Difference]: Without dead ends: 126 [2022-11-02 21:04:54,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=256, Invalid=1475, Unknown=3, NotChecked=246, Total=1980 [2022-11-02 21:04:54,860 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 87 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 322 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:54,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 570 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 401 Invalid, 0 Unknown, 322 Unchecked, 0.3s Time] [2022-11-02 21:04:54,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-02 21:04:54,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2022-11-02 21:04:54,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 94 states have (on average 1.351063829787234) internal successors, (127), 108 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) [2022-11-02 21:04:54,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 127 transitions. [2022-11-02 21:04:54,864 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 127 transitions. Word has length 26 [2022-11-02 21:04:54,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:54,865 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 127 transitions. [2022-11-02 21:04:54,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 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) [2022-11-02 21:04:54,865 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2022-11-02 21:04:54,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 21:04:54,866 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:54,866 INFO L195 NwaCegarLoop]: 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] [2022-11-02 21:04:54,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 21:04:55,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 21:04:55,080 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:04:55,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:55,081 INFO L85 PathProgramCache]: Analyzing trace with hash 978686096, now seen corresponding path program 1 times [2022-11-02 21:04:55,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:55,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61062339] [2022-11-02 21:04:55,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:55,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:55,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:55,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61062339] [2022-11-02 21:04:55,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61062339] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:55,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145905426] [2022-11-02 21:04:55,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:55,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:55,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:55,516 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:55,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 21:04:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:55,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-02 21:04:55,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:55,680 INFO L390 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 [2022-11-02 21:04:55,735 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:04:55,736 INFO L390 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 [2022-11-02 21:04:55,783 INFO L390 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 [2022-11-02 21:04:55,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:55,795 INFO L390 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 [2022-11-02 21:04:55,837 INFO L390 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 [2022-11-02 21:04:55,914 INFO L390 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 [2022-11-02 21:04:55,966 INFO L390 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 [2022-11-02 21:04:55,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:55,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:04:56,091 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_282 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_282) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2022-11-02 21:04:56,105 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_282 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_282) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2022-11-02 21:04:56,112 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_282 (Array Int Int))) (< (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_282) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2022-11-02 21:04:56,130 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_282 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_278)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_282) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2022-11-02 21:04:56,250 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:04:56,250 INFO L390 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 23 treesize of output 29 [2022-11-02 21:04:56,278 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-02 21:04:56,278 INFO L390 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 29 [2022-11-02 21:04:56,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 21:04:56,303 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 21:04:56,303 INFO L390 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 [2022-11-02 21:04:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:04:56,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145905426] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:04:56,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:04:56,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 34 [2022-11-02 21:04:56,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048522390] [2022-11-02 21:04:56,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:04:56,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-02 21:04:56,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:56,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-02 21:04:56,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=745, Unknown=4, NotChecked=236, Total=1122 [2022-11-02 21:04:56,382 INFO L87 Difference]: Start difference. First operand 109 states and 127 transitions. Second operand has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:57,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:57,775 INFO L93 Difference]: Finished difference Result 269 states and 288 transitions. [2022-11-02 21:04:57,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-02 21:04:57,776 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-02 21:04:57,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:57,777 INFO L225 Difference]: With dead ends: 269 [2022-11-02 21:04:57,777 INFO L226 Difference]: Without dead ends: 269 [2022-11-02 21:04:57,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=584, Invalid=2508, Unknown=4, NotChecked=444, Total=3540 [2022-11-02 21:04:57,779 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 612 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 861 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:57,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 954 Invalid, 1835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 837 Invalid, 0 Unknown, 861 Unchecked, 0.6s Time] [2022-11-02 21:04:57,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-11-02 21:04:57,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 129. [2022-11-02 21:04:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 114 states have (on average 1.4035087719298245) internal successors, (160), 128 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 160 transitions. [2022-11-02 21:04:57,792 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 160 transitions. Word has length 27 [2022-11-02 21:04:57,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:57,792 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 160 transitions. [2022-11-02 21:04:57,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 160 transitions. [2022-11-02 21:04:57,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 21:04:57,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:57,797 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:04:57,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 21:04:58,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:58,003 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:04:58,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:58,004 INFO L85 PathProgramCache]: Analyzing trace with hash -494851387, now seen corresponding path program 1 times [2022-11-02 21:04:58,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:58,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603139708] [2022-11-02 21:04:58,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:58,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:58,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:58,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:58,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603139708] [2022-11-02 21:04:58,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603139708] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:58,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966214377] [2022-11-02 21:04:58,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:58,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:58,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:58,583 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:58,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 21:04:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:58,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-02 21:04:58,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:58,816 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:04:58,817 INFO L390 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 [2022-11-02 21:04:58,854 INFO L390 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 [2022-11-02 21:04:58,861 INFO L390 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 [2022-11-02 21:04:58,935 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:04:58,935 INFO L390 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 52 treesize of output 49 [2022-11-02 21:04:58,941 INFO L390 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 23 treesize of output 15 [2022-11-02 21:04:58,954 INFO L390 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 [2022-11-02 21:04:59,099 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:04:59,100 INFO L390 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 15 [2022-11-02 21:04:59,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:04:59,109 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:04:59,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 18 [2022-11-02 21:04:59,120 INFO L390 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 [2022-11-02 21:04:59,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:59,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:04:59,262 INFO L390 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 79 treesize of output 57 [2022-11-02 21:04:59,659 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:04:59,659 INFO L390 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 [2022-11-02 21:04:59,668 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:04:59,669 INFO L390 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 35 [2022-11-02 21:04:59,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2022-11-02 21:04:59,722 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:04:59,723 INFO L390 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 1 [2022-11-02 21:04:59,955 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:04:59,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2022-11-02 21:05:00,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:00,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966214377] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:00,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:00,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2022-11-02 21:05:00,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486594219] [2022-11-02 21:05:00,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:00,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-02 21:05:00,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:00,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-02 21:05:00,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=751, Unknown=11, NotChecked=0, Total=870 [2022-11-02 21:05:00,184 INFO L87 Difference]: Start difference. First operand 129 states and 160 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) [2022-11-02 21:05:01,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:01,218 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2022-11-02 21:05:01,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 21:05:01,219 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 31 [2022-11-02 21:05:01,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:01,223 INFO L225 Difference]: With dead ends: 170 [2022-11-02 21:05:01,223 INFO L226 Difference]: Without dead ends: 170 [2022-11-02 21:05:01,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=308, Invalid=1661, Unknown=11, NotChecked=0, Total=1980 [2022-11-02 21:05:01,228 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 289 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 322 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:01,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 562 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 557 Invalid, 0 Unknown, 322 Unchecked, 0.5s Time] [2022-11-02 21:05:01,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-02 21:05:01,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 108. [2022-11-02 21:05:01,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 107 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:01,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2022-11-02 21:05:01,232 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 31 [2022-11-02 21:05:01,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:01,233 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2022-11-02 21:05:01,233 INFO L496 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) [2022-11-02 21:05:01,234 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2022-11-02 21:05:01,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 21:05:01,238 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:01,239 INFO L195 NwaCegarLoop]: 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] [2022-11-02 21:05:01,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:01,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:01,451 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:05:01,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:01,452 INFO L85 PathProgramCache]: Analyzing trace with hash -79061123, now seen corresponding path program 1 times [2022-11-02 21:05:01,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:01,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349058165] [2022-11-02 21:05:01,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:01,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:01,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 21:05:01,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:01,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349058165] [2022-11-02 21:05:01,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349058165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:01,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:01,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:05:01,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672319890] [2022-11-02 21:05:01,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:01,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:05:01,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:01,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:05:01,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:05:01,522 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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) [2022-11-02 21:05:01,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:01,607 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2022-11-02 21:05:01,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:05:01,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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 33 [2022-11-02 21:05:01,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:01,608 INFO L225 Difference]: With dead ends: 116 [2022-11-02 21:05:01,608 INFO L226 Difference]: Without dead ends: 116 [2022-11-02 21:05:01,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:05:01,609 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 85 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:01,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 118 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:05:01,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-02 21:05:01,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2022-11-02 21:05:01,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 95 states have (on average 1.305263157894737) internal successors, (124), 109 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) [2022-11-02 21:05:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2022-11-02 21:05:01,613 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 33 [2022-11-02 21:05:01,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:01,615 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2022-11-02 21:05:01,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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) [2022-11-02 21:05:01,615 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2022-11-02 21:05:01,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 21:05:01,615 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:01,616 INFO L195 NwaCegarLoop]: 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] [2022-11-02 21:05:01,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:05:01,616 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:05:01,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:01,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1844072636, now seen corresponding path program 1 times [2022-11-02 21:05:01,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:01,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656071662] [2022-11-02 21:05:01,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:01,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:01,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 21:05:01,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:01,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656071662] [2022-11-02 21:05:01,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656071662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:01,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:01,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:05:01,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798363888] [2022-11-02 21:05:01,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:01,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:05:01,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:01,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:05:01,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:05:01,694 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:01,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:01,795 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2022-11-02 21:05:01,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:05:01,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-02 21:05:01,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:01,796 INFO L225 Difference]: With dead ends: 117 [2022-11-02 21:05:01,796 INFO L226 Difference]: Without dead ends: 117 [2022-11-02 21:05:01,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:05:01,797 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 84 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:01,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 103 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:05:01,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-02 21:05:01,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2022-11-02 21:05:01,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 96 states have (on average 1.3020833333333333) internal successors, (125), 110 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:01,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2022-11-02 21:05:01,800 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 34 [2022-11-02 21:05:01,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:01,801 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2022-11-02 21:05:01,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:01,801 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-11-02 21:05:01,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 21:05:01,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:01,802 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-11-02 21:05:01,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:05:01,802 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:05:01,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:01,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1201170391, now seen corresponding path program 1 times [2022-11-02 21:05:01,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:01,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387587417] [2022-11-02 21:05:01,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:01,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:02,304 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:02,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:02,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387587417] [2022-11-02 21:05:02,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387587417] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:02,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781106245] [2022-11-02 21:05:02,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:02,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:02,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:02,306 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:02,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 21:05:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:02,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-02 21:05:02,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:02,477 INFO L390 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 [2022-11-02 21:05:02,526 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:05:02,527 INFO L390 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 [2022-11-02 21:05:02,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:02,586 INFO L390 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 [2022-11-02 21:05:02,595 INFO L390 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 [2022-11-02 21:05:02,637 INFO L390 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 [2022-11-02 21:05:02,723 INFO L390 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 [2022-11-02 21:05:02,753 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:05:02,754 INFO L390 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 [2022-11-02 21:05:02,793 INFO L390 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 [2022-11-02 21:05:02,800 INFO L390 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 [2022-11-02 21:05:02,842 INFO L390 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 [2022-11-02 21:05:02,918 INFO L390 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 [2022-11-02 21:05:02,983 INFO L390 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 [2022-11-02 21:05:02,985 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:02,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:03,001 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-02 21:05:03,011 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-02 21:05:03,017 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-02 21:05:03,023 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_460) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-02 21:05:03,080 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_460 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_20| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_460) |v_ULTIMATE.start_main_~t~0#1.base_20| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_20|) 0)))) is different from false [2022-11-02 21:05:03,108 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_460 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_20| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_460) |v_ULTIMATE.start_main_~t~0#1.base_20| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_20|) 0)))) is different from false [2022-11-02 21:05:03,167 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 21:05:03,167 INFO L390 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 [2022-11-02 21:05:03,177 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_454 Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_460 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_20| Int)) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_454)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_460) |v_ULTIMATE.start_main_~t~0#1.base_20| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |v_ULTIMATE.start_main_~t~0#1.base_20| |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2022-11-02 21:05:03,275 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:03,276 INFO L390 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 26 treesize of output 32 [2022-11-02 21:05:03,292 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-02 21:05:03,292 INFO L390 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 60 treesize of output 59 [2022-11-02 21:05:03,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2022-11-02 21:05:03,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2022-11-02 21:05:03,317 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 21:05:03,317 INFO L390 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 [2022-11-02 21:05:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-11-02 21:05:03,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781106245] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:03,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:03,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 41 [2022-11-02 21:05:03,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078621780] [2022-11-02 21:05:03,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:03,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-02 21:05:03,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:03,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-02 21:05:03,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=957, Unknown=11, NotChecked=490, Total=1640 [2022-11-02 21:05:03,406 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 41 states, 41 states have (on average 2.2195121951219514) internal successors, (91), 41 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) [2022-11-02 21:05:04,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:04,828 INFO L93 Difference]: Finished difference Result 161 states and 168 transitions. [2022-11-02 21:05:04,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 21:05:04,828 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.2195121951219514) internal successors, (91), 41 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 34 [2022-11-02 21:05:04,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:04,829 INFO L225 Difference]: With dead ends: 161 [2022-11-02 21:05:04,829 INFO L226 Difference]: Without dead ends: 161 [2022-11-02 21:05:04,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=523, Invalid=2356, Unknown=11, NotChecked=770, Total=3660 [2022-11-02 21:05:04,831 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 289 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 960 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:04,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 767 Invalid, 2013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 972 Invalid, 0 Unknown, 960 Unchecked, 0.6s Time] [2022-11-02 21:05:04,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-11-02 21:05:04,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 111. [2022-11-02 21:05:04,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 96 states have (on average 1.2916666666666667) internal successors, (124), 110 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:04,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2022-11-02 21:05:04,834 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 34 [2022-11-02 21:05:04,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:04,834 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2022-11-02 21:05:04,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.2195121951219514) internal successors, (91), 41 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) [2022-11-02 21:05:04,834 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2022-11-02 21:05:04,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 21:05:04,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:04,835 INFO L195 NwaCegarLoop]: 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] [2022-11-02 21:05:04,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:05,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 21:05:05,036 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:05:05,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:05,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1331677023, now seen corresponding path program 1 times [2022-11-02 21:05:05,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:05,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499531887] [2022-11-02 21:05:05,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:05,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:05:05,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:05,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499531887] [2022-11-02 21:05:05,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499531887] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:05,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569208187] [2022-11-02 21:05:05,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:05,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:05,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:05,138 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:05,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 21:05:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:05,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 21:05:05,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:05:05,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:05,341 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 21:05:05,342 INFO L390 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 12 treesize of output 11 [2022-11-02 21:05:05,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:05:05,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569208187] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:05,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:05,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-11-02 21:05:05,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635758570] [2022-11-02 21:05:05,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:05,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:05:05,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:05,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:05:05,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:05:05,357 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 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) [2022-11-02 21:05:05,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:05,513 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2022-11-02 21:05:05,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:05:05,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 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 35 [2022-11-02 21:05:05,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:05,515 INFO L225 Difference]: With dead ends: 115 [2022-11-02 21:05:05,515 INFO L226 Difference]: Without dead ends: 115 [2022-11-02 21:05:05,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:05:05,516 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 122 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:05,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 95 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:05:05,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-02 21:05:05,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2022-11-02 21:05:05,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.28125) internal successors, (123), 109 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:05,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2022-11-02 21:05:05,520 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 35 [2022-11-02 21:05:05,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:05,520 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2022-11-02 21:05:05,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 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) [2022-11-02 21:05:05,520 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2022-11-02 21:05:05,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 21:05:05,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:05,521 INFO L195 NwaCegarLoop]: 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] [2022-11-02 21:05:05,557 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:05,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:05,735 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:05:05,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:05,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1667685107, now seen corresponding path program 1 times [2022-11-02 21:05:05,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:05,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751230334] [2022-11-02 21:05:05,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:05,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:06,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:06,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751230334] [2022-11-02 21:05:06,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751230334] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:06,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029115124] [2022-11-02 21:05:06,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:06,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:06,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:06,383 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:06,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 21:05:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:06,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-02 21:05:06,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:06,616 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 21:05:06,617 INFO L390 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 [2022-11-02 21:05:06,677 INFO L390 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 [2022-11-02 21:05:06,840 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:05:06,841 INFO L390 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 [2022-11-02 21:05:07,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:05:07,149 INFO L390 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 31 treesize of output 13 [2022-11-02 21:05:07,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-02 21:05:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:05:07,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:07,651 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_69| Int) (v_ArrVal_555 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_69| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_69|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_555) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_69| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_69| Int) (v_ArrVal_555 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_69| |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_555) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_69| 4))) 1) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_69|))))) is different from false [2022-11-02 21:05:07,714 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_69| Int) (v_ArrVal_555 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_69| |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_555) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_69| 4))) 1) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_69|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_69| Int) (v_ArrVal_555 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_555) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_69| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_69| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_69|))))) is different from false [2022-11-02 21:05:07,737 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_69| Int) (v_ArrVal_555 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_69| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_555) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_69| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_69|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_69| Int) (v_ArrVal_555 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_69| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_69|)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_555) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_69| 4))) 1))))) is different from false [2022-11-02 21:05:07,752 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:07,752 INFO L390 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 [2022-11-02 21:05:07,761 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:07,762 INFO L390 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 39 [2022-11-02 21:05:07,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2022-11-02 21:05:07,826 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:07,827 INFO L390 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 23 treesize of output 24 [2022-11-02 21:05:07,841 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:07,841 INFO L390 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 39 treesize of output 38 [2022-11-02 21:05:07,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 18 [2022-11-02 21:05:08,190 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:08,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2022-11-02 21:05:08,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-11-02 21:05:08,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029115124] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:08,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:08,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 39 [2022-11-02 21:05:08,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438598605] [2022-11-02 21:05:08,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:08,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-02 21:05:08,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:08,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-02 21:05:08,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1164, Unknown=3, NotChecked=216, Total=1560 [2022-11-02 21:05:08,657 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand has 40 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 40 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) [2022-11-02 21:05:10,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:10,039 INFO L93 Difference]: Finished difference Result 166 states and 183 transitions. [2022-11-02 21:05:10,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-02 21:05:10,039 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 40 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 36 [2022-11-02 21:05:10,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:10,041 INFO L225 Difference]: With dead ends: 166 [2022-11-02 21:05:10,041 INFO L226 Difference]: Without dead ends: 166 [2022-11-02 21:05:10,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=434, Invalid=2331, Unknown=3, NotChecked=312, Total=3080 [2022-11-02 21:05:10,042 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 382 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 495 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:10,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 537 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 838 Invalid, 0 Unknown, 495 Unchecked, 0.6s Time] [2022-11-02 21:05:10,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-02 21:05:10,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 116. [2022-11-02 21:05:10,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 102 states have (on average 1.2745098039215685) internal successors, (130), 115 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:10,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2022-11-02 21:05:10,046 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 36 [2022-11-02 21:05:10,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:10,047 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2022-11-02 21:05:10,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 40 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) [2022-11-02 21:05:10,047 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2022-11-02 21:05:10,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 21:05:10,048 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:10,048 INFO L195 NwaCegarLoop]: 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] [2022-11-02 21:05:10,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:10,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:10,255 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:05:10,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:10,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1667685106, now seen corresponding path program 1 times [2022-11-02 21:05:10,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:10,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500510457] [2022-11-02 21:05:10,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:10,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:10,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:10,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500510457] [2022-11-02 21:05:10,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500510457] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:10,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189665960] [2022-11-02 21:05:10,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:10,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:10,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:10,699 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:10,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 21:05:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:10,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-02 21:05:10,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:10,939 INFO L390 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 [2022-11-02 21:05:10,951 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:05:10,951 INFO L390 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 [2022-11-02 21:05:11,016 INFO L390 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 [2022-11-02 21:05:11,029 INFO L390 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 [2022-11-02 21:05:11,235 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:05:11,236 INFO L390 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 [2022-11-02 21:05:11,242 INFO L390 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 [2022-11-02 21:05:11,552 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:05:11,553 INFO L390 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 31 treesize of output 13 [2022-11-02 21:05:11,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:05:11,561 INFO L390 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 19 treesize of output 7 [2022-11-02 21:05:11,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:05:11,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:11,764 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_608 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_608) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_608) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2022-11-02 21:05:11,792 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_608 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_608) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_608) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_609) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2022-11-02 21:05:11,804 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_608) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_609) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (forall ((v_ArrVal_608 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_608) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) is different from false [2022-11-02 21:05:11,817 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:11,817 INFO L390 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 45 treesize of output 46 [2022-11-02 21:05:11,824 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:11,824 INFO L390 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 35 treesize of output 36 [2022-11-02 21:05:11,834 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:11,835 INFO L390 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 62 treesize of output 61 [2022-11-02 21:05:11,849 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:11,850 INFO L390 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 96 treesize of output 89 [2022-11-02 21:05:11,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2022-11-02 21:05:11,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-11-02 21:05:11,930 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:11,930 INFO L390 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 [2022-11-02 21:05:11,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:05:11,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:11,937 INFO L390 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 8 [2022-11-02 21:05:12,106 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:12,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-11-02 21:05:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-11-02 21:05:12,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189665960] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:12,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:12,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 29 [2022-11-02 21:05:12,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785606846] [2022-11-02 21:05:12,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:12,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-02 21:05:12,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:12,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-02 21:05:12,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=591, Unknown=3, NotChecked=156, Total=870 [2022-11-02 21:05:12,243 INFO L87 Difference]: Start difference. First operand 116 states and 130 transitions. Second operand has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:13,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:13,056 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2022-11-02 21:05:13,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 21:05:13,057 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-02 21:05:13,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:13,057 INFO L225 Difference]: With dead ends: 131 [2022-11-02 21:05:13,058 INFO L226 Difference]: Without dead ends: 131 [2022-11-02 21:05:13,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=274, Invalid=995, Unknown=3, NotChecked=210, Total=1482 [2022-11-02 21:05:13,059 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 144 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 261 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:13,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 565 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 489 Invalid, 0 Unknown, 261 Unchecked, 0.4s Time] [2022-11-02 21:05:13,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-02 21:05:13,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 117. [2022-11-02 21:05:13,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 105 states have (on average 1.2476190476190476) internal successors, (131), 116 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:13,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2022-11-02 21:05:13,062 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 36 [2022-11-02 21:05:13,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:13,063 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2022-11-02 21:05:13,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:13,063 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2022-11-02 21:05:13,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 21:05:13,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:13,064 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-11-02 21:05:13,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:13,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-02 21:05:13,278 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:05:13,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:13,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1021481151, now seen corresponding path program 1 times [2022-11-02 21:05:13,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:13,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178487425] [2022-11-02 21:05:13,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:13,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:13,935 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:13,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:13,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178487425] [2022-11-02 21:05:13,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178487425] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:13,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235313746] [2022-11-02 21:05:13,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:13,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:13,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:13,939 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:13,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 21:05:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:14,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-02 21:05:14,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:14,208 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 21:05:14,208 INFO L390 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 [2022-11-02 21:05:14,283 INFO L390 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 [2022-11-02 21:05:14,529 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:05:14,530 INFO L390 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 37 treesize of output 35 [2022-11-02 21:05:14,581 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-11-02 21:05:14,582 INFO L390 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 [2022-11-02 21:05:14,673 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-02 21:05:14,673 INFO L390 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 30 [2022-11-02 21:05:14,953 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 21:05:14,954 INFO L390 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 78 treesize of output 67 [2022-11-02 21:05:15,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:05:15,220 INFO L356 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-11-02 21:05:15,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 27 [2022-11-02 21:05:15,226 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:15,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:15,301 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2022-11-02 21:05:15,311 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2022-11-02 21:05:15,393 INFO L356 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2022-11-02 21:05:15,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2022-11-02 21:05:15,399 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-11-02 21:05:15,501 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:15,501 INFO L390 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 20 treesize of output 24 [2022-11-02 21:05:15,689 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:15,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-02 21:05:15,705 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:15,706 INFO L390 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 164 treesize of output 157 [2022-11-02 21:05:15,716 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:15,717 INFO L390 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 152 treesize of output 124 [2022-11-02 21:05:15,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 94 [2022-11-02 21:05:16,128 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:16,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 216 [2022-11-02 21:05:17,352 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-02 21:05:17,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235313746] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:17,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:17,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 43 [2022-11-02 21:05:17,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983355006] [2022-11-02 21:05:17,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:17,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-02 21:05:17,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:17,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-02 21:05:17,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1433, Unknown=15, NotChecked=240, Total=1892 [2022-11-02 21:05:17,355 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 44 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 44 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:18,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:18,712 INFO L93 Difference]: Finished difference Result 209 states and 229 transitions. [2022-11-02 21:05:18,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-02 21:05:18,713 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 44 states have internal predecessors, (100), 0 states have call successors, (0), 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 [2022-11-02 21:05:18,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:18,714 INFO L225 Difference]: With dead ends: 209 [2022-11-02 21:05:18,714 INFO L226 Difference]: Without dead ends: 209 [2022-11-02 21:05:18,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=528, Invalid=3009, Unknown=15, NotChecked=354, Total=3906 [2022-11-02 21:05:18,716 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 256 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 819 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:18,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 851 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 589 Invalid, 0 Unknown, 819 Unchecked, 0.4s Time] [2022-11-02 21:05:18,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-11-02 21:05:18,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 137. [2022-11-02 21:05:18,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 125 states have (on average 1.24) internal successors, (155), 136 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 155 transitions. [2022-11-02 21:05:18,720 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 155 transitions. Word has length 36 [2022-11-02 21:05:18,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:18,720 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 155 transitions. [2022-11-02 21:05:18,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 44 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:18,721 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2022-11-02 21:05:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 21:05:18,721 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:18,721 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-11-02 21:05:18,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:18,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:18,935 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:05:18,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:18,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1021481152, now seen corresponding path program 1 times [2022-11-02 21:05:18,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:18,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019888309] [2022-11-02 21:05:18,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:18,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:19,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:19,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019888309] [2022-11-02 21:05:19,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019888309] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:19,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012719578] [2022-11-02 21:05:19,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:19,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:19,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:19,780 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:19,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 21:05:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:19,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-02 21:05:19,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:20,020 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:05:20,020 INFO L390 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 [2022-11-02 21:05:20,052 INFO L390 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 [2022-11-02 21:05:20,057 INFO L390 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 [2022-11-02 21:05:20,224 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:05:20,224 INFO L390 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 [2022-11-02 21:05:20,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:20,243 INFO L390 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 [2022-11-02 21:05:20,312 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:05:20,312 INFO L390 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 [2022-11-02 21:05:20,393 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 21:05:20,393 INFO L390 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 [2022-11-02 21:05:20,416 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-02 21:05:20,417 INFO L390 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 [2022-11-02 21:05:20,713 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-02 21:05:20,714 INFO L390 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 66 treesize of output 65 [2022-11-02 21:05:20,725 INFO L390 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 [2022-11-02 21:05:20,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2022-11-02 21:05:20,877 INFO L390 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 [2022-11-02 21:05:20,881 INFO L390 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 [2022-11-02 21:05:20,888 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:20,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:21,085 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_771 (Array Int Int)) (v_ArrVal_770 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_771) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_770) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (forall ((v_ArrVal_771 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_771) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2022-11-02 21:05:21,109 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_771 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_771) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_771 (Array Int Int)) (v_ArrVal_770 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_771) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_770) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2022-11-02 21:05:21,120 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_771 (Array Int Int)) (v_ArrVal_770 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_771) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_770) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (forall ((v_ArrVal_771 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_771) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) is different from false [2022-11-02 21:05:21,135 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:21,135 INFO L390 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 63 treesize of output 67 [2022-11-02 21:05:21,173 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_770 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_770) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_prenex_17 (Array Int Int)) (v_prenex_16 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_16) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_17) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (+ 5 |c_ULTIMATE.start_main_~p~0#1.offset|))) (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_771 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_771) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2022-11-02 21:05:21,346 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:21,346 INFO L390 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 20 treesize of output 24 [2022-11-02 21:05:21,882 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:21,882 INFO L390 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 109 treesize of output 100 [2022-11-02 21:05:21,892 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:21,892 INFO L390 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 89 treesize of output 90 [2022-11-02 21:05:21,905 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:21,906 INFO L390 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 248 treesize of output 235 [2022-11-02 21:05:21,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 215 [2022-11-02 21:05:21,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 207 [2022-11-02 21:05:21,942 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:21,943 INFO L390 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 274 treesize of output 273 [2022-11-02 21:05:21,959 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:21,960 INFO L390 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 257 treesize of output 242 [2022-11-02 21:05:21,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 233 treesize of output 225 [2022-11-02 21:05:22,012 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:22,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 232 treesize of output 272 [2022-11-02 21:05:22,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 211 [2022-11-02 21:05:22,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 195 [2022-11-02 21:05:22,769 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:22,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-11-02 21:05:22,913 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-02 21:05:22,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012719578] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:22,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:22,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 45 [2022-11-02 21:05:22,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711500238] [2022-11-02 21:05:22,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:22,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-02 21:05:22,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:22,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-02 21:05:22,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1527, Unknown=22, NotChecked=332, Total=2070 [2022-11-02 21:05:22,916 INFO L87 Difference]: Start difference. First operand 137 states and 155 transitions. Second operand has 46 states, 45 states have (on average 2.2444444444444445) internal successors, (101), 46 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:25,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:25,941 INFO L93 Difference]: Finished difference Result 288 states and 312 transitions. [2022-11-02 21:05:25,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-02 21:05:25,941 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.2444444444444445) internal successors, (101), 46 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-02 21:05:25,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:25,943 INFO L225 Difference]: With dead ends: 288 [2022-11-02 21:05:25,943 INFO L226 Difference]: Without dead ends: 288 [2022-11-02 21:05:25,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 79 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 1615 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=786, Invalid=5060, Unknown=22, NotChecked=612, Total=6480 [2022-11-02 21:05:25,945 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 567 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 2373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 981 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:25,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1034 Invalid, 2373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1276 Invalid, 0 Unknown, 981 Unchecked, 0.9s Time] [2022-11-02 21:05:25,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-11-02 21:05:25,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 163. [2022-11-02 21:05:25,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 151 states have (on average 1.2384105960264902) internal successors, (187), 162 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:25,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 187 transitions. [2022-11-02 21:05:25,951 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 187 transitions. Word has length 36 [2022-11-02 21:05:25,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:25,951 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 187 transitions. [2022-11-02 21:05:25,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.2444444444444445) internal successors, (101), 46 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:25,951 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 187 transitions. [2022-11-02 21:05:25,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 21:05:25,952 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:25,952 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:26,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:26,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-02 21:05:26,167 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:05:26,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:26,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1638789957, now seen corresponding path program 2 times [2022-11-02 21:05:26,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:26,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416593743] [2022-11-02 21:05:26,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:26,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:05:26,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:26,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416593743] [2022-11-02 21:05:26,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416593743] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:26,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:26,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:05:26,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154914737] [2022-11-02 21:05:26,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:26,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:05:26,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:26,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:05:26,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:05:26,200 INFO L87 Difference]: Start difference. First operand 163 states and 187 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:26,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:26,210 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2022-11-02 21:05:26,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:05:26,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-02 21:05:26,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:26,211 INFO L225 Difference]: With dead ends: 177 [2022-11-02 21:05:26,211 INFO L226 Difference]: Without dead ends: 177 [2022-11-02 21:05:26,212 INFO L412 NwaCegarLoop]: 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 [2022-11-02 21:05:26,212 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 36 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:26,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 112 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:05:26,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-11-02 21:05:26,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 142. [2022-11-02 21:05:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 130 states have (on average 1.2153846153846153) internal successors, (158), 141 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 158 transitions. [2022-11-02 21:05:26,217 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 158 transitions. Word has length 36 [2022-11-02 21:05:26,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:26,217 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 158 transitions. [2022-11-02 21:05:26,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:26,218 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 158 transitions. [2022-11-02 21:05:26,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 21:05:26,218 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:26,218 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-11-02 21:05:26,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 21:05:26,219 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:05:26,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:26,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1518619459, now seen corresponding path program 1 times [2022-11-02 21:05:26,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:26,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208283047] [2022-11-02 21:05:26,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:26,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:26,735 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:26,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:26,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208283047] [2022-11-02 21:05:26,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208283047] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:26,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517380970] [2022-11-02 21:05:26,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:26,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:26,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:26,739 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:26,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 21:05:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:26,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-02 21:05:26,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:26,944 INFO L390 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 [2022-11-02 21:05:26,997 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:05:26,997 INFO L390 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 [2022-11-02 21:05:27,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:27,046 INFO L390 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 [2022-11-02 21:05:27,057 INFO L390 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 [2022-11-02 21:05:27,098 INFO L390 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 [2022-11-02 21:05:27,195 INFO L390 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 [2022-11-02 21:05:27,223 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:05:27,224 INFO L390 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 [2022-11-02 21:05:27,272 INFO L390 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 [2022-11-02 21:05:27,280 INFO L390 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 [2022-11-02 21:05:27,325 INFO L390 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 [2022-11-02 21:05:27,405 INFO L390 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 [2022-11-02 21:05:27,467 INFO L390 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 [2022-11-02 21:05:27,485 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:27,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:27,578 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_892 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_892) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2022-11-02 21:05:27,593 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_892 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_892) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2022-11-02 21:05:27,607 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_892 (Array Int Int))) (< (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_892) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2022-11-02 21:05:27,613 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_891 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_891) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_892) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2022-11-02 21:05:27,684 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_39| Int) (v_ArrVal_892 (Array Int Int)) (v_ArrVal_891 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_891) |v_ULTIMATE.start_main_~t~0#1.base_39| v_ArrVal_892) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_39|) 0)))) is different from false [2022-11-02 21:05:27,711 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_39| Int) (v_ArrVal_892 (Array Int Int)) (v_ArrVal_891 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_39|) 0)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_891) |v_ULTIMATE.start_main_~t~0#1.base_39| v_ArrVal_892) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3))) is different from false [2022-11-02 21:05:27,779 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 21:05:27,779 INFO L390 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 [2022-11-02 21:05:27,985 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:27,986 INFO L390 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 26 treesize of output 32 [2022-11-02 21:05:28,001 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-02 21:05:28,002 INFO L390 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 60 treesize of output 59 [2022-11-02 21:05:28,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-11-02 21:05:28,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-11-02 21:05:28,025 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 21:05:28,026 INFO L390 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 [2022-11-02 21:05:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-11-02 21:05:28,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517380970] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:28,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:28,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 47 [2022-11-02 21:05:28,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044112167] [2022-11-02 21:05:28,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:28,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-02 21:05:28,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:28,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-02 21:05:28,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1418, Unknown=45, NotChecked=498, Total=2162 [2022-11-02 21:05:28,107 INFO L87 Difference]: Start difference. First operand 142 states and 158 transitions. Second operand has 47 states, 47 states have (on average 2.148936170212766) internal successors, (101), 47 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:30,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:30,087 INFO L93 Difference]: Finished difference Result 277 states and 290 transitions. [2022-11-02 21:05:30,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-02 21:05:30,087 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.148936170212766) internal successors, (101), 47 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-02 21:05:30,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:30,089 INFO L225 Difference]: With dead ends: 277 [2022-11-02 21:05:30,089 INFO L226 Difference]: Without dead ends: 277 [2022-11-02 21:05:30,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1297 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=845, Invalid=4505, Unknown=76, NotChecked=894, Total=6320 [2022-11-02 21:05:30,091 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 476 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 2590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1550 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:30,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 959 Invalid, 2590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 895 Invalid, 0 Unknown, 1550 Unchecked, 0.6s Time] [2022-11-02 21:05:30,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-11-02 21:05:30,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 159. [2022-11-02 21:05:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 147 states have (on average 1.251700680272109) internal successors, (184), 158 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:30,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 184 transitions. [2022-11-02 21:05:30,097 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 184 transitions. Word has length 37 [2022-11-02 21:05:30,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:30,097 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 184 transitions. [2022-11-02 21:05:30,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.148936170212766) internal successors, (101), 47 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:30,098 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 184 transitions. [2022-11-02 21:05:30,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 21:05:30,098 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:30,098 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:30,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:30,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-02 21:05:30,303 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:05:30,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:30,304 INFO L85 PathProgramCache]: Analyzing trace with hash -2120226842, now seen corresponding path program 1 times [2022-11-02 21:05:30,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:30,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506086709] [2022-11-02 21:05:30,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:30,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:30,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:30,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506086709] [2022-11-02 21:05:30,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506086709] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:30,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187018082] [2022-11-02 21:05:30,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:30,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:30,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:30,827 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:30,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-02 21:05:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:30,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-02 21:05:30,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:31,064 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:05:31,064 INFO L390 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 [2022-11-02 21:05:31,096 INFO L390 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 [2022-11-02 21:05:31,184 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:05:31,184 INFO L390 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 [2022-11-02 21:05:31,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:05:31,349 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:31,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 16 [2022-11-02 21:05:31,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:05:31,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:31,553 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_941 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_104| Int)) (or (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_104|)) |c_#StackHeapBarrier|) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_104| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_104|)))) is different from false [2022-11-02 21:05:31,578 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_941 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_104| Int)) (or (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_104|)) |c_#StackHeapBarrier|) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_104| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_104|)))) is different from false [2022-11-02 21:05:31,590 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_941 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_104| Int)) (or (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_941) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_104|)) |c_#StackHeapBarrier|) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_104| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_104|)))) is different from false [2022-11-02 21:05:31,599 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:31,599 INFO L390 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 [2022-11-02 21:05:31,607 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:31,607 INFO L390 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 35 [2022-11-02 21:05:31,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2022-11-02 21:05:31,872 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:31,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2022-11-02 21:05:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-11-02 21:05:32,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187018082] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:32,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:32,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 31 [2022-11-02 21:05:32,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178633698] [2022-11-02 21:05:32,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:32,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-02 21:05:32,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:32,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-02 21:05:32,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=685, Unknown=3, NotChecked=168, Total=992 [2022-11-02 21:05:32,064 INFO L87 Difference]: Start difference. First operand 159 states and 184 transitions. Second operand has 32 states, 31 states have (on average 3.0) internal successors, (93), 32 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:32,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:32,833 INFO L93 Difference]: Finished difference Result 215 states and 236 transitions. [2022-11-02 21:05:32,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 21:05:32,833 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.0) internal successors, (93), 32 states have internal predecessors, (93), 0 states have call successors, (0), 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 [2022-11-02 21:05:32,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:32,834 INFO L225 Difference]: With dead ends: 215 [2022-11-02 21:05:32,834 INFO L226 Difference]: Without dead ends: 215 [2022-11-02 21:05:32,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=299, Invalid=1270, Unknown=3, NotChecked=234, Total=1806 [2022-11-02 21:05:32,836 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 233 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 388 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:32,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 583 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 641 Invalid, 0 Unknown, 388 Unchecked, 0.4s Time] [2022-11-02 21:05:32,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-11-02 21:05:32,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 158. [2022-11-02 21:05:32,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 146 states have (on average 1.2534246575342465) internal successors, (183), 157 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 183 transitions. [2022-11-02 21:05:32,841 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 183 transitions. Word has length 39 [2022-11-02 21:05:32,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:32,841 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 183 transitions. [2022-11-02 21:05:32,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.0) internal successors, (93), 32 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:32,841 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 183 transitions. [2022-11-02 21:05:32,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 21:05:32,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:32,842 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:32,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:33,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:33,059 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:05:33,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:33,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1302476786, now seen corresponding path program 1 times [2022-11-02 21:05:33,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:33,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559496727] [2022-11-02 21:05:33,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:33,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:33,500 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:33,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:33,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559496727] [2022-11-02 21:05:33,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559496727] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:33,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623555140] [2022-11-02 21:05:33,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:33,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:33,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:33,502 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:33,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-02 21:05:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:33,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-02 21:05:33,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:33,735 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:05:33,736 INFO L390 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 [2022-11-02 21:05:33,769 INFO L390 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 [2022-11-02 21:05:33,774 INFO L390 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 [2022-11-02 21:05:33,786 INFO L390 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 [2022-11-02 21:05:33,810 INFO L390 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 [2022-11-02 21:05:33,920 INFO L390 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 [2022-11-02 21:05:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:05:33,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:34,162 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_112| Int) (v_ArrVal_992 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_992) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_112|)) 0) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_112| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_112|)))) is different from false [2022-11-02 21:05:34,186 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_112| Int) (v_ArrVal_992 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_992) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_112|)) 0) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_112| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_112|)))) is different from false [2022-11-02 21:05:34,198 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_112| Int) (v_ArrVal_992 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_112| |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_992) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_112|)) 0) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_112|)))) is different from false [2022-11-02 21:05:34,206 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:34,207 INFO L390 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 [2022-11-02 21:05:34,215 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:34,215 INFO L390 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 35 [2022-11-02 21:05:34,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2022-11-02 21:05:34,449 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:34,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2022-11-02 21:05:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-02 21:05:34,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623555140] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:05:34,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:05:34,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2022-11-02 21:05:34,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858165806] [2022-11-02 21:05:34,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:05:34,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-02 21:05:34,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:34,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-02 21:05:34,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=632, Unknown=3, NotChecked=162, Total=930 [2022-11-02 21:05:34,665 INFO L87 Difference]: Start difference. First operand 158 states and 183 transitions. Second operand has 31 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 31 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) [2022-11-02 21:05:35,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:35,609 INFO L93 Difference]: Finished difference Result 211 states and 236 transitions. [2022-11-02 21:05:35,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 21:05:35,609 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 31 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 40 [2022-11-02 21:05:35,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:35,611 INFO L225 Difference]: With dead ends: 211 [2022-11-02 21:05:35,612 INFO L226 Difference]: Without dead ends: 211 [2022-11-02 21:05:35,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 60 SyntacticMatches, 9 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=374, Invalid=1356, Unknown=4, NotChecked=246, Total=1980 [2022-11-02 21:05:35,613 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 173 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 421 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:35,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 708 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 706 Invalid, 0 Unknown, 421 Unchecked, 0.4s Time] [2022-11-02 21:05:35,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-11-02 21:05:35,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 160. [2022-11-02 21:05:35,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 148 states have (on average 1.25) internal successors, (185), 159 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:35,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 185 transitions. [2022-11-02 21:05:35,620 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 185 transitions. Word has length 40 [2022-11-02 21:05:35,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:35,620 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 185 transitions. [2022-11-02 21:05:35,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 31 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) [2022-11-02 21:05:35,620 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 185 transitions. [2022-11-02 21:05:35,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 21:05:35,621 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:35,621 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:35,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:35,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-02 21:05:35,835 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-02 21:05:35,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:35,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1723491604, now seen corresponding path program 1 times [2022-11-02 21:05:35,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:35,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366271281] [2022-11-02 21:05:35,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:35,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:36,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:36,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:36,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366271281] [2022-11-02 21:05:36,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366271281] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:36,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529222464] [2022-11-02 21:05:36,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:36,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:36,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:36,685 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:36,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13626697-6eea-43dc-8208-ec5c7478af45/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-02 21:05:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:36,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-02 21:05:36,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:37,071 INFO L390 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 [2022-11-02 21:05:37,283 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:05:37,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2022-11-02 21:05:37,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:05:37,786 INFO L390 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 39 treesize of output 21 [2022-11-02 21:05:38,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:05:38,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:05:38,645 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_119| Int)) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_119|)) 0)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_119|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_119| |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-11-02 21:05:38,672 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_119| Int)) (or (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_119|)) 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_119|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_119| |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-11-02 21:05:38,685 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1045 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_119| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_119|)) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_1045) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_119|)) 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_119| |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-11-02 21:05:38,695 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:38,695 INFO L390 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 [2022-11-02 21:05:38,704 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:38,705 INFO L390 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 56 treesize of output 55 [2022-11-02 21:05:38,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 [2022-11-02 21:07:49,252 WARN L234 SmtUtils]: Spent 2.17m on a formula simplification. DAG size of input: 54 DAG size of output: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:08:27,699 WARN L234 SmtUtils]: Spent 38.19s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)