./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0218.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0218.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 --- 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-b5237d8 [2022-11-22 02:46:01,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 02:46:01,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 02:46:01,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 02:46:01,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 02:46:01,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 02:46:01,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 02:46:01,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 02:46:01,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 02:46:01,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 02:46:01,677 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 02:46:01,679 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 02:46:01,679 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 02:46:01,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 02:46:01,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 02:46:01,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 02:46:01,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 02:46:01,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 02:46:01,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 02:46:01,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 02:46:01,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 02:46:01,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 02:46:01,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 02:46:01,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 02:46:01,713 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 02:46:01,713 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 02:46:01,714 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 02:46:01,716 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 02:46:01,716 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 02:46:01,717 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 02:46:01,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 02:46:01,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 02:46:01,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 02:46:01,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 02:46:01,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 02:46:01,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 02:46:01,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 02:46:01,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 02:46:01,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 02:46:01,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 02:46:01,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 02:46:01,729 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-22 02:46:01,771 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 02:46:01,771 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 02:46:01,772 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 02:46:01,772 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 02:46:01,773 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 02:46:01,773 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 02:46:01,773 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 02:46:01,774 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 02:46:01,774 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 02:46:01,774 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 02:46:01,775 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 02:46:01,775 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 02:46:01,776 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 02:46:01,776 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 02:46:01,776 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 02:46:01,776 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 02:46:01,777 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 02:46:01,777 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 02:46:01,778 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-22 02:46:01,778 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-22 02:46:01,778 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 02:46:01,779 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 02:46:01,779 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 02:46:01,779 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 02:46:01,780 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 02:46:01,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 02:46:01,780 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-22 02:46:01,780 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-22 02:46:01,780 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-22 02:46:01,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 02:46:01,781 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 02:46:01,781 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 02:46:01,781 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 02:46:01,782 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 02:46:01,782 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 02:46:01,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:46:01,782 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 02:46:01,783 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 02:46:01,783 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 02:46:01,783 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 02:46:01,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 02:46:01,783 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 02:46:01,784 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_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/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_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba 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 -> Taipan 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 -> d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 [2022-11-22 02:46:02,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 02:46:02,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 02:46:02,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 02:46:02,090 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 02:46:02,091 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 02:46:02,092 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/memsafety/test-0218.i [2022-11-22 02:46:05,305 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 02:46:05,567 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 02:46:05,568 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/sv-benchmarks/c/memsafety/test-0218.i [2022-11-22 02:46:05,582 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/data/748a96c30/a44bde6a45064833a5954f1330f504a0/FLAGc2bd24bc0 [2022-11-22 02:46:05,597 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/data/748a96c30/a44bde6a45064833a5954f1330f504a0 [2022-11-22 02:46:05,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 02:46:05,601 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 02:46:05,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 02:46:05,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 02:46:05,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 02:46:05,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:46:05" (1/1) ... [2022-11-22 02:46:05,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f439444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:05, skipping insertion in model container [2022-11-22 02:46:05,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:46:05" (1/1) ... [2022-11-22 02:46:05,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 02:46:05,685 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 02:46:06,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:46:06,229 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 02:46:06,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:46:06,340 INFO L208 MainTranslator]: Completed translation [2022-11-22 02:46:06,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:06 WrapperNode [2022-11-22 02:46:06,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 02:46:06,342 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 02:46:06,342 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 02:46:06,342 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 02:46:06,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:06" (1/1) ... [2022-11-22 02:46:06,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:06" (1/1) ... [2022-11-22 02:46:06,413 INFO L138 Inliner]: procedures = 181, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 208 [2022-11-22 02:46:06,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 02:46:06,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 02:46:06,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 02:46:06,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 02:46:06,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:06" (1/1) ... [2022-11-22 02:46:06,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:06" (1/1) ... [2022-11-22 02:46:06,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:06" (1/1) ... [2022-11-22 02:46:06,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:06" (1/1) ... [2022-11-22 02:46:06,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:06" (1/1) ... [2022-11-22 02:46:06,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:06" (1/1) ... [2022-11-22 02:46:06,453 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:06" (1/1) ... [2022-11-22 02:46:06,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:06" (1/1) ... [2022-11-22 02:46:06,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 02:46:06,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 02:46:06,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 02:46:06,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 02:46:06,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:06" (1/1) ... [2022-11-22 02:46:06,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:46:06,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:46:06,495 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 02:46:06,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 02:46:06,555 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2022-11-22 02:46:06,556 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2022-11-22 02:46:06,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-22 02:46:06,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 02:46:06,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-22 02:46:06,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-22 02:46:06,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 02:46:06,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-22 02:46:06,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 02:46:06,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 02:46:06,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 02:46:06,726 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 02:46:06,728 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 02:46:07,392 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 02:46:07,523 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 02:46:07,523 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-22 02:46:07,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:46:07 BoogieIcfgContainer [2022-11-22 02:46:07,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 02:46:07,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 02:46:07,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 02:46:07,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 02:46:07,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:46:05" (1/3) ... [2022-11-22 02:46:07,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23bef41c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:46:07, skipping insertion in model container [2022-11-22 02:46:07,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:06" (2/3) ... [2022-11-22 02:46:07,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23bef41c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:46:07, skipping insertion in model container [2022-11-22 02:46:07,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:46:07" (3/3) ... [2022-11-22 02:46:07,540 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0218.i [2022-11-22 02:46:07,559 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 02:46:07,559 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2022-11-22 02:46:07,600 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 02:46:07,607 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;@56d1b5cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 02:46:07,607 INFO L358 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2022-11-22 02:46:07,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 135 states, 66 states have (on average 2.257575757575758) internal successors, (149), 131 states have internal predecessors, (149), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:46:07,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-22 02:46:07,617 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:07,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-22 02:46:07,619 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:07,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:07,624 INFO L85 PathProgramCache]: Analyzing trace with hash 10082236, now seen corresponding path program 1 times [2022-11-22 02:46:07,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:07,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401669121] [2022-11-22 02:46:07,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:07,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:07,792 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-22 02:46:07,792 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:07,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401669121] [2022-11-22 02:46:07,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401669121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:07,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:07,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:46:07,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584066595] [2022-11-22 02:46:07,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:07,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-22 02:46:07,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:07,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-22 02:46:07,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 02:46:07,838 INFO L87 Difference]: Start difference. First operand has 135 states, 66 states have (on average 2.257575757575758) internal successors, (149), 131 states have internal predecessors, (149), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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-22 02:46:07,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:07,966 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2022-11-22 02:46:07,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 02:46:07,971 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-22 02:46:07,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:07,979 INFO L225 Difference]: With dead ends: 135 [2022-11-22 02:46:07,979 INFO L226 Difference]: Without dead ends: 134 [2022-11-22 02:46:07,980 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-22 02:46:07,984 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:07,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:46:07,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-22 02:46:08,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-11-22 02:46:08,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 66 states have (on average 2.1818181818181817) internal successors, (144), 130 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:46:08,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2022-11-22 02:46:08,022 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 4 [2022-11-22 02:46:08,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:08,023 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2022-11-22 02:46:08,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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-22 02:46:08,023 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2022-11-22 02:46:08,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 02:46:08,024 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:08,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 02:46:08,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 02:46:08,025 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:08,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:08,026 INFO L85 PathProgramCache]: Analyzing trace with hash 305174584, now seen corresponding path program 1 times [2022-11-22 02:46:08,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:08,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500253865] [2022-11-22 02:46:08,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:08,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:08,148 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-22 02:46:08,149 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:08,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500253865] [2022-11-22 02:46:08,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500253865] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:08,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:08,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 02:46:08,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512204759] [2022-11-22 02:46:08,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:08,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:46:08,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:08,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:46:08,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:46:08,170 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:46:08,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:08,525 INFO L93 Difference]: Finished difference Result 261 states and 288 transitions. [2022-11-22 02:46:08,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:46:08,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-22 02:46:08,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:08,528 INFO L225 Difference]: With dead ends: 261 [2022-11-22 02:46:08,532 INFO L226 Difference]: Without dead ends: 261 [2022-11-22 02:46:08,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-22 02:46:08,534 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 132 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:08,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 158 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:46:08,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-22 02:46:08,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 176. [2022-11-22 02:46:08,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 105 states have (on average 2.1619047619047618) internal successors, (227), 169 states have internal predecessors, (227), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-22 02:46:08,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 235 transitions. [2022-11-22 02:46:08,562 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 235 transitions. Word has length 5 [2022-11-22 02:46:08,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:08,563 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 235 transitions. [2022-11-22 02:46:08,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:46:08,563 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 235 transitions. [2022-11-22 02:46:08,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 02:46:08,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:08,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 02:46:08,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 02:46:08,565 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:08,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:08,565 INFO L85 PathProgramCache]: Analyzing trace with hash 305174585, now seen corresponding path program 1 times [2022-11-22 02:46:08,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:08,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635501078] [2022-11-22 02:46:08,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:08,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:08,829 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-22 02:46:08,829 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:08,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635501078] [2022-11-22 02:46:08,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635501078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:08,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:08,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:46:08,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699046287] [2022-11-22 02:46:08,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:08,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:46:08,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:08,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:46:08,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:46:08,833 INFO L87 Difference]: Start difference. First operand 176 states and 235 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:46:09,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:09,042 INFO L93 Difference]: Finished difference Result 175 states and 233 transitions. [2022-11-22 02:46:09,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:46:09,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-22 02:46:09,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:09,048 INFO L225 Difference]: With dead ends: 175 [2022-11-22 02:46:09,049 INFO L226 Difference]: Without dead ends: 175 [2022-11-22 02:46:09,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:46:09,050 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 157 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:09,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 158 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:46:09,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-11-22 02:46:09,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-11-22 02:46:09,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 105 states have (on average 2.142857142857143) internal successors, (225), 168 states have internal predecessors, (225), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-22 02:46:09,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 233 transitions. [2022-11-22 02:46:09,078 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 233 transitions. Word has length 5 [2022-11-22 02:46:09,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:09,078 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 233 transitions. [2022-11-22 02:46:09,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:46:09,079 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 233 transitions. [2022-11-22 02:46:09,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 02:46:09,080 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:09,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:09,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 02:46:09,081 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:09,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:09,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1215040476, now seen corresponding path program 1 times [2022-11-22 02:46:09,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:09,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91277709] [2022-11-22 02:46:09,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:09,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:09,502 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-22 02:46:09,502 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:09,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91277709] [2022-11-22 02:46:09,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91277709] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:09,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:09,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:46:09,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932792152] [2022-11-22 02:46:09,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:09,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:46:09,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:09,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:46:09,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:46:09,506 INFO L87 Difference]: Start difference. First operand 175 states and 233 transitions. Second operand has 5 states, 5 states have (on average 1.4) 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-22 02:46:09,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:09,850 INFO L93 Difference]: Finished difference Result 292 states and 383 transitions. [2022-11-22 02:46:09,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:46:09,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) 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-22 02:46:09,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:09,852 INFO L225 Difference]: With dead ends: 292 [2022-11-22 02:46:09,852 INFO L226 Difference]: Without dead ends: 292 [2022-11-22 02:46:09,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:46:09,853 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 95 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:09,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 362 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:46:09,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-22 02:46:09,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 227. [2022-11-22 02:46:09,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 151 states have (on average 2.0264900662251657) internal successors, (306), 216 states have internal predecessors, (306), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:46:09,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 322 transitions. [2022-11-22 02:46:09,869 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 322 transitions. Word has length 7 [2022-11-22 02:46:09,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:09,870 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 322 transitions. [2022-11-22 02:46:09,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) 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-22 02:46:09,870 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 322 transitions. [2022-11-22 02:46:09,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 02:46:09,871 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:09,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:09,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 02:46:09,871 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:09,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:09,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1215041854, now seen corresponding path program 1 times [2022-11-22 02:46:09,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:09,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270232505] [2022-11-22 02:46:09,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:09,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:09,895 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-22 02:46:09,895 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:09,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270232505] [2022-11-22 02:46:09,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270232505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:09,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:09,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 02:46:09,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725480661] [2022-11-22 02:46:09,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:09,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:46:09,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:09,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:46:09,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:46:09,898 INFO L87 Difference]: Start difference. First operand 227 states and 322 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-22 02:46:10,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:10,031 INFO L93 Difference]: Finished difference Result 274 states and 365 transitions. [2022-11-22 02:46:10,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:46:10,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-22 02:46:10,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:10,035 INFO L225 Difference]: With dead ends: 274 [2022-11-22 02:46:10,035 INFO L226 Difference]: Without dead ends: 270 [2022-11-22 02:46:10,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-22 02:46:10,036 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 58 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:10,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 183 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:46:10,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-22 02:46:10,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 225. [2022-11-22 02:46:10,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 149 states have (on average 2.033557046979866) internal successors, (303), 214 states have internal predecessors, (303), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:46:10,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 319 transitions. [2022-11-22 02:46:10,048 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 319 transitions. Word has length 7 [2022-11-22 02:46:10,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:10,049 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 319 transitions. [2022-11-22 02:46:10,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-22 02:46:10,049 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 319 transitions. [2022-11-22 02:46:10,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 02:46:10,050 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:10,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:10,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 02:46:10,050 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:10,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:10,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1123151619, now seen corresponding path program 1 times [2022-11-22 02:46:10,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:10,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960021852] [2022-11-22 02:46:10,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:10,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:10,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-22 02:46:10,223 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:10,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960021852] [2022-11-22 02:46:10,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960021852] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:10,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:10,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:46:10,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415174672] [2022-11-22 02:46:10,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:10,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:46:10,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:10,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:46:10,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:46:10,228 INFO L87 Difference]: Start difference. First operand 225 states and 319 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:10,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:10,579 INFO L93 Difference]: Finished difference Result 423 states and 491 transitions. [2022-11-22 02:46:10,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:46:10,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-11-22 02:46:10,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:10,583 INFO L225 Difference]: With dead ends: 423 [2022-11-22 02:46:10,583 INFO L226 Difference]: Without dead ends: 423 [2022-11-22 02:46:10,583 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-22 02:46:10,584 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 373 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:10,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 279 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:46:10,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-11-22 02:46:10,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 222. [2022-11-22 02:46:10,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 150 states have (on average 1.98) internal successors, (297), 211 states have internal predecessors, (297), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:46:10,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 313 transitions. [2022-11-22 02:46:10,601 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 313 transitions. Word has length 10 [2022-11-22 02:46:10,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:10,602 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 313 transitions. [2022-11-22 02:46:10,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:10,604 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 313 transitions. [2022-11-22 02:46:10,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 02:46:10,605 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:10,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:10,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 02:46:10,605 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:10,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:10,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1123151618, now seen corresponding path program 1 times [2022-11-22 02:46:10,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:10,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106748967] [2022-11-22 02:46:10,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:10,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:10,986 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-22 02:46:10,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:10,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106748967] [2022-11-22 02:46:10,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106748967] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:10,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:10,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:46:10,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232673465] [2022-11-22 02:46:10,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:10,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:46:10,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:10,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:46:10,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:46:10,989 INFO L87 Difference]: Start difference. First operand 222 states and 313 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:11,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:11,762 INFO L93 Difference]: Finished difference Result 505 states and 604 transitions. [2022-11-22 02:46:11,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 02:46:11,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-11-22 02:46:11,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:11,765 INFO L225 Difference]: With dead ends: 505 [2022-11-22 02:46:11,765 INFO L226 Difference]: Without dead ends: 505 [2022-11-22 02:46:11,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:46:11,766 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 486 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:11,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 363 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 02:46:11,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-11-22 02:46:11,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 236. [2022-11-22 02:46:11,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 164 states have (on average 1.975609756097561) internal successors, (324), 225 states have internal predecessors, (324), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:46:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 340 transitions. [2022-11-22 02:46:11,783 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 340 transitions. Word has length 10 [2022-11-22 02:46:11,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:11,783 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 340 transitions. [2022-11-22 02:46:11,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:11,784 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 340 transitions. [2022-11-22 02:46:11,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 02:46:11,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:11,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:11,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 02:46:11,785 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:11,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:11,785 INFO L85 PathProgramCache]: Analyzing trace with hash 489077426, now seen corresponding path program 1 times [2022-11-22 02:46:11,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:11,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246464327] [2022-11-22 02:46:11,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:11,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:11,890 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-22 02:46:11,890 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:11,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246464327] [2022-11-22 02:46:11,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246464327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:11,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:11,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:46:11,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968842614] [2022-11-22 02:46:11,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:11,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:46:11,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:11,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:46:11,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:46:11,893 INFO L87 Difference]: Start difference. First operand 236 states and 340 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:12,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:12,179 INFO L93 Difference]: Finished difference Result 417 states and 533 transitions. [2022-11-22 02:46:12,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:46:12,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-22 02:46:12,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:12,184 INFO L225 Difference]: With dead ends: 417 [2022-11-22 02:46:12,184 INFO L226 Difference]: Without dead ends: 417 [2022-11-22 02:46:12,184 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-22 02:46:12,185 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 242 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:12,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 271 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:46:12,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-11-22 02:46:12,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 242. [2022-11-22 02:46:12,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 170 states have (on average 1.9411764705882353) internal successors, (330), 231 states have internal predecessors, (330), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:46:12,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 346 transitions. [2022-11-22 02:46:12,200 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 346 transitions. Word has length 12 [2022-11-22 02:46:12,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:12,200 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 346 transitions. [2022-11-22 02:46:12,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 346 transitions. [2022-11-22 02:46:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 02:46:12,202 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:12,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:12,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 02:46:12,203 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:12,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:12,204 INFO L85 PathProgramCache]: Analyzing trace with hash 489077427, now seen corresponding path program 1 times [2022-11-22 02:46:12,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:12,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951397411] [2022-11-22 02:46:12,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:12,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:12,311 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-22 02:46:12,312 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:12,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951397411] [2022-11-22 02:46:12,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951397411] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:12,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:12,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:46:12,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151142138] [2022-11-22 02:46:12,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:12,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:46:12,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:12,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:46:12,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:46:12,315 INFO L87 Difference]: Start difference. First operand 242 states and 346 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:12,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:12,509 INFO L93 Difference]: Finished difference Result 333 states and 457 transitions. [2022-11-22 02:46:12,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:46:12,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-22 02:46:12,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:12,511 INFO L225 Difference]: With dead ends: 333 [2022-11-22 02:46:12,511 INFO L226 Difference]: Without dead ends: 333 [2022-11-22 02:46:12,511 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-22 02:46:12,512 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 264 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:12,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 158 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:46:12,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-11-22 02:46:12,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 239. [2022-11-22 02:46:12,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 170 states have (on average 1.8705882352941177) internal successors, (318), 228 states have internal predecessors, (318), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:46:12,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 334 transitions. [2022-11-22 02:46:12,522 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 334 transitions. Word has length 12 [2022-11-22 02:46:12,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:12,522 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 334 transitions. [2022-11-22 02:46:12,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:12,522 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 334 transitions. [2022-11-22 02:46:12,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 02:46:12,523 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:12,523 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:12,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 02:46:12,524 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:12,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:12,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2006989468, now seen corresponding path program 1 times [2022-11-22 02:46:12,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:12,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966296439] [2022-11-22 02:46:12,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:12,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:13,008 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-22 02:46:13,008 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:13,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966296439] [2022-11-22 02:46:13,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966296439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:13,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:13,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-22 02:46:13,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269936234] [2022-11-22 02:46:13,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:13,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:46:13,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:13,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:46:13,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:46:13,011 INFO L87 Difference]: Start difference. First operand 239 states and 334 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:13,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:13,374 INFO L93 Difference]: Finished difference Result 328 states and 428 transitions. [2022-11-22 02:46:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 02:46:13,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-22 02:46:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:13,376 INFO L225 Difference]: With dead ends: 328 [2022-11-22 02:46:13,376 INFO L226 Difference]: Without dead ends: 328 [2022-11-22 02:46:13,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-22 02:46:13,377 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 141 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:13,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 569 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:46:13,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-11-22 02:46:13,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 245. [2022-11-22 02:46:13,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 176 states have (on average 1.8522727272727273) internal successors, (326), 232 states have internal predecessors, (326), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:46:13,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 342 transitions. [2022-11-22 02:46:13,388 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 342 transitions. Word has length 13 [2022-11-22 02:46:13,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:13,388 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 342 transitions. [2022-11-22 02:46:13,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:13,389 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 342 transitions. [2022-11-22 02:46:13,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 02:46:13,389 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:13,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:13,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 02:46:13,392 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:13,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:13,392 INFO L85 PathProgramCache]: Analyzing trace with hash -260481343, now seen corresponding path program 1 times [2022-11-22 02:46:13,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:13,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318124405] [2022-11-22 02:46:13,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:13,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:13,819 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-22 02:46:13,820 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:13,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318124405] [2022-11-22 02:46:13,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318124405] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:13,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:13,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 02:46:13,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391621738] [2022-11-22 02:46:13,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:13,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:46:13,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:13,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:46:13,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:46:13,825 INFO L87 Difference]: Start difference. First operand 245 states and 342 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:14,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:14,191 INFO L93 Difference]: Finished difference Result 324 states and 428 transitions. [2022-11-22 02:46:14,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:46:14,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-22 02:46:14,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:14,193 INFO L225 Difference]: With dead ends: 324 [2022-11-22 02:46:14,193 INFO L226 Difference]: Without dead ends: 324 [2022-11-22 02:46:14,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-22 02:46:14,194 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 463 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:14,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 440 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:46:14,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-11-22 02:46:14,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 244. [2022-11-22 02:46:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 176 states have (on average 1.8352272727272727) internal successors, (323), 231 states have internal predecessors, (323), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:46:14,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 339 transitions. [2022-11-22 02:46:14,202 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 339 transitions. Word has length 15 [2022-11-22 02:46:14,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:14,202 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 339 transitions. [2022-11-22 02:46:14,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:14,203 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 339 transitions. [2022-11-22 02:46:14,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 02:46:14,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:14,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:14,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 02:46:14,204 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:14,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:14,204 INFO L85 PathProgramCache]: Analyzing trace with hash -260481344, now seen corresponding path program 1 times [2022-11-22 02:46:14,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:14,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894282592] [2022-11-22 02:46:14,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:14,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:14,242 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-22 02:46:14,242 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:14,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894282592] [2022-11-22 02:46:14,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894282592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:14,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:14,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:46:14,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448723353] [2022-11-22 02:46:14,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:14,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:46:14,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:14,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:46:14,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:46:14,244 INFO L87 Difference]: Start difference. First operand 244 states and 339 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:14,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:14,369 INFO L93 Difference]: Finished difference Result 314 states and 413 transitions. [2022-11-22 02:46:14,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:46:14,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-22 02:46:14,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:14,371 INFO L225 Difference]: With dead ends: 314 [2022-11-22 02:46:14,371 INFO L226 Difference]: Without dead ends: 314 [2022-11-22 02:46:14,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:46:14,372 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 115 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:14,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 181 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:46:14,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-11-22 02:46:14,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 242. [2022-11-22 02:46:14,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 176 states have (on average 1.8011363636363635) internal successors, (317), 229 states have internal predecessors, (317), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:46:14,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 333 transitions. [2022-11-22 02:46:14,380 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 333 transitions. Word has length 15 [2022-11-22 02:46:14,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:14,380 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 333 transitions. [2022-11-22 02:46:14,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:14,380 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 333 transitions. [2022-11-22 02:46:14,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 02:46:14,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:14,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:14,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 02:46:14,381 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:14,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:14,382 INFO L85 PathProgramCache]: Analyzing trace with hash -260479555, now seen corresponding path program 1 times [2022-11-22 02:46:14,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:14,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703055854] [2022-11-22 02:46:14,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:14,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:14,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:46:14,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:14,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703055854] [2022-11-22 02:46:14,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703055854] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:14,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:14,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:46:14,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184722731] [2022-11-22 02:46:14,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:14,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:46:14,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:14,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:46:14,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:46:14,484 INFO L87 Difference]: Start difference. First operand 242 states and 333 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:14,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:14,538 INFO L93 Difference]: Finished difference Result 248 states and 339 transitions. [2022-11-22 02:46:14,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:46:14,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-22 02:46:14,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:14,540 INFO L225 Difference]: With dead ends: 248 [2022-11-22 02:46:14,540 INFO L226 Difference]: Without dead ends: 248 [2022-11-22 02:46:14,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:46:14,541 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:14,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 341 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:46:14,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-11-22 02:46:14,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2022-11-22 02:46:14,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 182 states have (on average 1.7747252747252746) internal successors, (323), 235 states have internal predecessors, (323), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:46:14,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 339 transitions. [2022-11-22 02:46:14,549 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 339 transitions. Word has length 15 [2022-11-22 02:46:14,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:14,549 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 339 transitions. [2022-11-22 02:46:14,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:14,550 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 339 transitions. [2022-11-22 02:46:14,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 02:46:14,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:14,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:14,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-22 02:46:14,551 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:14,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:14,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1758952565, now seen corresponding path program 1 times [2022-11-22 02:46:14,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:14,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262510006] [2022-11-22 02:46:14,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:14,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:14,907 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-22 02:46:14,907 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:14,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262510006] [2022-11-22 02:46:14,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262510006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:14,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:14,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 02:46:14,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210959578] [2022-11-22 02:46:14,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:14,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:46:14,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:14,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:46:14,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:46:14,909 INFO L87 Difference]: Start difference. First operand 248 states and 339 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:15,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:15,294 INFO L93 Difference]: Finished difference Result 428 states and 556 transitions. [2022-11-22 02:46:15,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 02:46:15,295 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-22 02:46:15,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:15,297 INFO L225 Difference]: With dead ends: 428 [2022-11-22 02:46:15,297 INFO L226 Difference]: Without dead ends: 428 [2022-11-22 02:46:15,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:46:15,298 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 328 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:15,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 585 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:46:15,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-11-22 02:46:15,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 242. [2022-11-22 02:46:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 176 states have (on average 1.7727272727272727) internal successors, (312), 229 states have internal predecessors, (312), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:46:15,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 328 transitions. [2022-11-22 02:46:15,308 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 328 transitions. Word has length 16 [2022-11-22 02:46:15,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:15,308 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 328 transitions. [2022-11-22 02:46:15,309 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:15,309 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 328 transitions. [2022-11-22 02:46:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 02:46:15,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:15,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:15,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-22 02:46:15,310 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:15,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:15,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1306686252, now seen corresponding path program 1 times [2022-11-22 02:46:15,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:15,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679254887] [2022-11-22 02:46:15,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:15,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:15,369 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-22 02:46:15,370 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:15,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679254887] [2022-11-22 02:46:15,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679254887] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:15,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:15,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:46:15,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287153532] [2022-11-22 02:46:15,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:15,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:46:15,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:15,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:46:15,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:46:15,372 INFO L87 Difference]: Start difference. First operand 242 states and 328 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:15,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:15,660 INFO L93 Difference]: Finished difference Result 410 states and 508 transitions. [2022-11-22 02:46:15,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:46:15,661 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-22 02:46:15,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:15,662 INFO L225 Difference]: With dead ends: 410 [2022-11-22 02:46:15,662 INFO L226 Difference]: Without dead ends: 410 [2022-11-22 02:46:15,663 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-22 02:46:15,663 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 215 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:15,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 266 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:46:15,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-11-22 02:46:15,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 254. [2022-11-22 02:46:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 188 states have (on average 1.797872340425532) internal successors, (338), 241 states have internal predecessors, (338), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:46:15,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 354 transitions. [2022-11-22 02:46:15,672 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 354 transitions. Word has length 17 [2022-11-22 02:46:15,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:15,672 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 354 transitions. [2022-11-22 02:46:15,673 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:15,673 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 354 transitions. [2022-11-22 02:46:15,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 02:46:15,673 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:15,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:15,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-22 02:46:15,674 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:15,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:15,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1306686251, now seen corresponding path program 1 times [2022-11-22 02:46:15,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:15,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642986457] [2022-11-22 02:46:15,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:15,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:15,820 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-22 02:46:15,820 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:15,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642986457] [2022-11-22 02:46:15,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642986457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:15,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:15,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:46:15,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823362073] [2022-11-22 02:46:15,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:15,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:46:15,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:15,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:46:15,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:46:15,822 INFO L87 Difference]: Start difference. First operand 254 states and 354 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:16,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:16,052 INFO L93 Difference]: Finished difference Result 349 states and 466 transitions. [2022-11-22 02:46:16,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:46:16,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-22 02:46:16,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:16,055 INFO L225 Difference]: With dead ends: 349 [2022-11-22 02:46:16,055 INFO L226 Difference]: Without dead ends: 349 [2022-11-22 02:46:16,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:46:16,056 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 252 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:16,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 191 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:46:16,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-11-22 02:46:16,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 251. [2022-11-22 02:46:16,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 188 states have (on average 1.7340425531914894) internal successors, (326), 238 states have internal predecessors, (326), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:46:16,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 342 transitions. [2022-11-22 02:46:16,070 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 342 transitions. Word has length 17 [2022-11-22 02:46:16,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:16,070 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 342 transitions. [2022-11-22 02:46:16,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:16,071 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 342 transitions. [2022-11-22 02:46:16,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 02:46:16,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:16,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:16,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-22 02:46:16,073 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:16,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:16,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1214466207, now seen corresponding path program 1 times [2022-11-22 02:46:16,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:16,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888474266] [2022-11-22 02:46:16,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:16,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:16,189 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-22 02:46:16,189 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:16,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888474266] [2022-11-22 02:46:16,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888474266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:16,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:16,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:46:16,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961591535] [2022-11-22 02:46:16,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:16,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:46:16,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:16,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:46:16,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:46:16,191 INFO L87 Difference]: Start difference. First operand 251 states and 342 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:16,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:16,356 INFO L93 Difference]: Finished difference Result 401 states and 534 transitions. [2022-11-22 02:46:16,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:46:16,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-22 02:46:16,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:16,358 INFO L225 Difference]: With dead ends: 401 [2022-11-22 02:46:16,358 INFO L226 Difference]: Without dead ends: 401 [2022-11-22 02:46:16,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:46:16,361 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 119 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:16,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 410 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:46:16,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-11-22 02:46:16,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 266. [2022-11-22 02:46:16,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 203 states have (on average 1.7044334975369457) internal successors, (346), 253 states have internal predecessors, (346), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:46:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 362 transitions. [2022-11-22 02:46:16,368 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 362 transitions. Word has length 17 [2022-11-22 02:46:16,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:16,369 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 362 transitions. [2022-11-22 02:46:16,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 362 transitions. [2022-11-22 02:46:16,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 02:46:16,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:16,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:16,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-22 02:46:16,376 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:16,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:16,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1214466013, now seen corresponding path program 1 times [2022-11-22 02:46:16,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:16,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917426299] [2022-11-22 02:46:16,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:16,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:16,845 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-22 02:46:16,846 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:16,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917426299] [2022-11-22 02:46:16,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917426299] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:16,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:16,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 02:46:16,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194325531] [2022-11-22 02:46:16,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:16,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:46:16,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:16,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:46:16,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:46:16,848 INFO L87 Difference]: Start difference. First operand 266 states and 362 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:17,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:17,161 INFO L93 Difference]: Finished difference Result 346 states and 452 transitions. [2022-11-22 02:46:17,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:46:17,162 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-22 02:46:17,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:17,163 INFO L225 Difference]: With dead ends: 346 [2022-11-22 02:46:17,163 INFO L226 Difference]: Without dead ends: 346 [2022-11-22 02:46:17,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-22 02:46:17,164 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 440 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:17,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 435 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:46:17,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-11-22 02:46:17,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 265. [2022-11-22 02:46:17,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 252 states have internal predecessors, (340), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:46:17,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 356 transitions. [2022-11-22 02:46:17,171 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 356 transitions. Word has length 17 [2022-11-22 02:46:17,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:17,172 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 356 transitions. [2022-11-22 02:46:17,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:17,172 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 356 transitions. [2022-11-22 02:46:17,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 02:46:17,173 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:17,173 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:17,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-22 02:46:17,173 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:17,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:17,173 INFO L85 PathProgramCache]: Analyzing trace with hash 2093603348, now seen corresponding path program 1 times [2022-11-22 02:46:17,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:17,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617576091] [2022-11-22 02:46:17,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:17,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:17,390 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-22 02:46:17,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:17,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617576091] [2022-11-22 02:46:17,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617576091] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:17,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:17,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-22 02:46:17,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286481781] [2022-11-22 02:46:17,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:17,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 02:46:17,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:17,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 02:46:17,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:46:17,393 INFO L87 Difference]: Start difference. First operand 265 states and 356 transitions. Second operand has 8 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:17,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:17,866 INFO L93 Difference]: Finished difference Result 461 states and 596 transitions. [2022-11-22 02:46:17,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 02:46:17,867 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-22 02:46:17,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:17,868 INFO L225 Difference]: With dead ends: 461 [2022-11-22 02:46:17,869 INFO L226 Difference]: Without dead ends: 461 [2022-11-22 02:46:17,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-11-22 02:46:17,869 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 501 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:17,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 646 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:46:17,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-11-22 02:46:17,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 263. [2022-11-22 02:46:17,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 203 states have (on average 1.6551724137931034) internal successors, (336), 250 states have internal predecessors, (336), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:46:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 352 transitions. [2022-11-22 02:46:17,880 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 352 transitions. Word has length 20 [2022-11-22 02:46:17,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:17,883 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 352 transitions. [2022-11-22 02:46:17,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:17,884 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 352 transitions. [2022-11-22 02:46:17,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 02:46:17,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:17,885 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:17,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-22 02:46:17,886 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:17,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:17,886 INFO L85 PathProgramCache]: Analyzing trace with hash 653440571, now seen corresponding path program 1 times [2022-11-22 02:46:17,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:17,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449261941] [2022-11-22 02:46:17,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:17,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:18,029 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-22 02:46:18,029 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:18,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449261941] [2022-11-22 02:46:18,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449261941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:18,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:18,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:46:18,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140430879] [2022-11-22 02:46:18,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:18,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:46:18,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:18,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:46:18,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:46:18,032 INFO L87 Difference]: Start difference. First operand 263 states and 352 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:18,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:18,181 INFO L93 Difference]: Finished difference Result 338 states and 439 transitions. [2022-11-22 02:46:18,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:46:18,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-22 02:46:18,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:18,184 INFO L225 Difference]: With dead ends: 338 [2022-11-22 02:46:18,184 INFO L226 Difference]: Without dead ends: 338 [2022-11-22 02:46:18,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:46:18,184 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 206 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:18,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 271 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:46:18,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-11-22 02:46:18,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 262. [2022-11-22 02:46:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 203 states have (on average 1.645320197044335) internal successors, (334), 249 states have internal predecessors, (334), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:46:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 350 transitions. [2022-11-22 02:46:18,189 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 350 transitions. Word has length 20 [2022-11-22 02:46:18,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:18,189 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 350 transitions. [2022-11-22 02:46:18,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:18,189 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 350 transitions. [2022-11-22 02:46:18,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 02:46:18,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:18,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:18,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-22 02:46:18,190 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:18,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:18,190 INFO L85 PathProgramCache]: Analyzing trace with hash 653440570, now seen corresponding path program 1 times [2022-11-22 02:46:18,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:18,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446936776] [2022-11-22 02:46:18,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:18,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:18,261 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-22 02:46:18,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:18,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446936776] [2022-11-22 02:46:18,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446936776] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:18,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:18,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:46:18,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595159873] [2022-11-22 02:46:18,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:18,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:46:18,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:18,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:46:18,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:46:18,267 INFO L87 Difference]: Start difference. First operand 262 states and 350 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:18,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:18,437 INFO L93 Difference]: Finished difference Result 332 states and 431 transitions. [2022-11-22 02:46:18,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:46:18,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-22 02:46:18,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:18,439 INFO L225 Difference]: With dead ends: 332 [2022-11-22 02:46:18,439 INFO L226 Difference]: Without dead ends: 332 [2022-11-22 02:46:18,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:46:18,440 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 189 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:18,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 223 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:46:18,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-11-22 02:46:18,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 261. [2022-11-22 02:46:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 203 states have (on average 1.6354679802955665) internal successors, (332), 248 states have internal predecessors, (332), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:46:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 348 transitions. [2022-11-22 02:46:18,446 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 348 transitions. Word has length 20 [2022-11-22 02:46:18,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:18,447 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 348 transitions. [2022-11-22 02:46:18,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:18,449 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 348 transitions. [2022-11-22 02:46:18,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 02:46:18,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:18,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:18,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-22 02:46:18,451 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:18,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:18,452 INFO L85 PathProgramCache]: Analyzing trace with hash 477196717, now seen corresponding path program 1 times [2022-11-22 02:46:18,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:18,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587715855] [2022-11-22 02:46:18,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:18,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:18,924 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-22 02:46:18,924 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:18,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587715855] [2022-11-22 02:46:18,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587715855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:18,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:18,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 02:46:18,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682129189] [2022-11-22 02:46:18,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:18,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 02:46:18,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:18,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 02:46:18,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:46:18,927 INFO L87 Difference]: Start difference. First operand 261 states and 348 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:19,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:19,527 INFO L93 Difference]: Finished difference Result 446 states and 552 transitions. [2022-11-22 02:46:19,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 02:46:19,530 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-11-22 02:46:19,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:19,532 INFO L225 Difference]: With dead ends: 446 [2022-11-22 02:46:19,532 INFO L226 Difference]: Without dead ends: 446 [2022-11-22 02:46:19,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-11-22 02:46:19,533 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 301 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:19,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1061 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 02:46:19,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2022-11-22 02:46:19,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 224. [2022-11-22 02:46:19,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 169 states have (on average 1.6390532544378698) internal successors, (277), 214 states have internal predecessors, (277), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-22 02:46:19,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 289 transitions. [2022-11-22 02:46:19,542 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 289 transitions. Word has length 21 [2022-11-22 02:46:19,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:19,542 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 289 transitions. [2022-11-22 02:46:19,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:19,543 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 289 transitions. [2022-11-22 02:46:19,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 02:46:19,543 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:19,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:19,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-22 02:46:19,544 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:19,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:19,545 INFO L85 PathProgramCache]: Analyzing trace with hash 891165787, now seen corresponding path program 1 times [2022-11-22 02:46:19,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:19,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11626870] [2022-11-22 02:46:19,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:19,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:19,625 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-22 02:46:19,626 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:19,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11626870] [2022-11-22 02:46:19,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11626870] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:19,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:19,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:46:19,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073690094] [2022-11-22 02:46:19,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:19,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:46:19,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:19,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:46:19,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:46:19,628 INFO L87 Difference]: Start difference. First operand 224 states and 289 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:19,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:19,940 INFO L93 Difference]: Finished difference Result 507 states and 619 transitions. [2022-11-22 02:46:19,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:46:19,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-11-22 02:46:19,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:19,942 INFO L225 Difference]: With dead ends: 507 [2022-11-22 02:46:19,942 INFO L226 Difference]: Without dead ends: 507 [2022-11-22 02:46:19,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:46:19,943 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 392 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:19,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 326 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:46:19,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-11-22 02:46:19,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 221. [2022-11-22 02:46:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 169 states have (on average 1.6035502958579881) internal successors, (271), 211 states have internal predecessors, (271), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-22 02:46:19,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 283 transitions. [2022-11-22 02:46:19,952 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 283 transitions. Word has length 22 [2022-11-22 02:46:19,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:19,954 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 283 transitions. [2022-11-22 02:46:19,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:19,954 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 283 transitions. [2022-11-22 02:46:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 02:46:19,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:19,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:19,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-22 02:46:19,956 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:19,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:19,956 INFO L85 PathProgramCache]: Analyzing trace with hash 891165788, now seen corresponding path program 1 times [2022-11-22 02:46:19,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:19,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165863800] [2022-11-22 02:46:19,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:19,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:20,103 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-22 02:46:20,103 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:20,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165863800] [2022-11-22 02:46:20,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165863800] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:20,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:20,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:46:20,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072872327] [2022-11-22 02:46:20,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:20,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:46:20,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:20,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:46:20,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:46:20,108 INFO L87 Difference]: Start difference. First operand 221 states and 283 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:20,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:20,330 INFO L93 Difference]: Finished difference Result 371 states and 465 transitions. [2022-11-22 02:46:20,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:46:20,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-11-22 02:46:20,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:20,332 INFO L225 Difference]: With dead ends: 371 [2022-11-22 02:46:20,332 INFO L226 Difference]: Without dead ends: 371 [2022-11-22 02:46:20,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:46:20,333 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 568 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:20,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 227 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:46:20,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-11-22 02:46:20,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 220. [2022-11-22 02:46:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 169 states have (on average 1.5917159763313609) internal successors, (269), 210 states have internal predecessors, (269), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-22 02:46:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 281 transitions. [2022-11-22 02:46:20,340 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 281 transitions. Word has length 22 [2022-11-22 02:46:20,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:20,340 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 281 transitions. [2022-11-22 02:46:20,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:20,341 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 281 transitions. [2022-11-22 02:46:20,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 02:46:20,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:20,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:20,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-22 02:46:20,342 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:20,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:20,343 INFO L85 PathProgramCache]: Analyzing trace with hash 891165949, now seen corresponding path program 1 times [2022-11-22 02:46:20,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:20,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249873008] [2022-11-22 02:46:20,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:20,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:20,532 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-22 02:46:20,533 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:20,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249873008] [2022-11-22 02:46:20,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249873008] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:20,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:46:20,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:46:20,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987983284] [2022-11-22 02:46:20,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:20,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:46:20,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:20,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:46:20,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:46:20,535 INFO L87 Difference]: Start difference. First operand 220 states and 281 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:20,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:20,840 INFO L93 Difference]: Finished difference Result 333 states and 384 transitions. [2022-11-22 02:46:20,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:46:20,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-11-22 02:46:20,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:20,842 INFO L225 Difference]: With dead ends: 333 [2022-11-22 02:46:20,842 INFO L226 Difference]: Without dead ends: 333 [2022-11-22 02:46:20,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:46:20,843 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 440 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:20,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 202 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:46:20,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-11-22 02:46:20,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 220. [2022-11-22 02:46:20,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 169 states have (on average 1.5798816568047338) internal successors, (267), 210 states have internal predecessors, (267), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-22 02:46:20,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 279 transitions. [2022-11-22 02:46:20,849 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 279 transitions. Word has length 22 [2022-11-22 02:46:20,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:20,849 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 279 transitions. [2022-11-22 02:46:20,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:46:20,849 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 279 transitions. [2022-11-22 02:46:20,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 02:46:20,849 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:20,850 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:20,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-22 02:46:20,850 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:20,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:20,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1889583054, now seen corresponding path program 1 times [2022-11-22 02:46:20,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:20,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580013856] [2022-11-22 02:46:20,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:20,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:46:24,442 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:24,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580013856] [2022-11-22 02:46:24,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580013856] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:46:24,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263652314] [2022-11-22 02:46:24,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:24,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:46:24,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:46:24,447 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:46:24,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 02:46:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:24,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-22 02:46:24,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:46:24,967 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:46:24,968 INFO L350 Elim1Store]: Elim1 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-22 02:46:25,224 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2022-11-22 02:46:25,231 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2022-11-22 02:46:25,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:25,480 INFO L321 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2022-11-22 02:46:25,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 87 [2022-11-22 02:46:25,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:25,511 INFO L321 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2022-11-22 02:46:25,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 71 [2022-11-22 02:46:25,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-22 02:46:25,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-22 02:46:25,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:25,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2022-11-22 02:46:25,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:25,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2022-11-22 02:46:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:46:25,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:46:25,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263652314] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:46:25,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:46:25,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 28 [2022-11-22 02:46:25,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139830820] [2022-11-22 02:46:25,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:46:25,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 02:46:25,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:25,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 02:46:25,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=693, Unknown=0, NotChecked=0, Total=756 [2022-11-22 02:46:25,962 INFO L87 Difference]: Start difference. First operand 220 states and 279 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:46:27,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:27,787 INFO L93 Difference]: Finished difference Result 531 states and 605 transitions. [2022-11-22 02:46:27,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-22 02:46:27,788 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-11-22 02:46:27,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:27,790 INFO L225 Difference]: With dead ends: 531 [2022-11-22 02:46:27,790 INFO L226 Difference]: Without dead ends: 531 [2022-11-22 02:46:27,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=148, Invalid=1184, Unknown=0, NotChecked=0, Total=1332 [2022-11-22 02:46:27,791 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 559 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:27,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1114 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-22 02:46:27,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-11-22 02:46:27,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 223. [2022-11-22 02:46:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 172 states have (on average 1.569767441860465) internal successors, (270), 213 states have internal predecessors, (270), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-22 02:46:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 282 transitions. [2022-11-22 02:46:27,800 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 282 transitions. Word has length 34 [2022-11-22 02:46:27,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:27,800 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 282 transitions. [2022-11-22 02:46:27,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:46:27,801 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 282 transitions. [2022-11-22 02:46:27,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-22 02:46:27,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:27,801 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:27,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-22 02:46:28,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:46:28,008 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:28,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:28,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1336046809, now seen corresponding path program 1 times [2022-11-22 02:46:28,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:28,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089235391] [2022-11-22 02:46:28,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:28,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:30,567 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:46:30,567 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:30,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089235391] [2022-11-22 02:46:30,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089235391] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:46:30,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187468918] [2022-11-22 02:46:30,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:30,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:46:30,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:46:30,569 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:46:30,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 02:46:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:30,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-22 02:46:30,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:46:30,892 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 02:46:30,892 INFO L350 Elim1Store]: Elim1 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-22 02:46:31,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:46:31,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:46:31,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:46:31,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:46:31,309 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-22 02:46:31,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 02:46:31,331 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-22 02:46:31,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 02:46:31,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:31,583 INFO L350 Elim1Store]: Elim1 eliminated variable 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 52 treesize of output 51 [2022-11-22 02:46:31,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:31,612 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-11-22 02:46:31,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 56 [2022-11-22 02:46:31,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:31,708 INFO L350 Elim1Store]: Elim1 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 49 treesize of output 35 [2022-11-22 02:46:32,139 INFO L321 Elim1Store]: treesize reduction 75, result has 37.5 percent of original size [2022-11-22 02:46:32,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 59 [2022-11-22 02:46:32,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:32,454 INFO L321 Elim1Store]: treesize reduction 20, result has 13.0 percent of original size [2022-11-22 02:46:32,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 23 [2022-11-22 02:46:32,524 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:46:32,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:46:32,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187468918] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:46:32,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2107083864] [2022-11-22 02:46:32,859 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2022-11-22 02:46:32,860 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:46:32,867 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:46:32,873 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:46:32,873 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:46:33,108 INFO L321 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-11-22 02:46:33,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 216 [2022-11-22 02:46:33,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:33,443 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:33,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:33,485 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-11-22 02:46:33,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 253 treesize of output 244 [2022-11-22 02:46:33,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:33,511 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:33,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:33,554 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-11-22 02:46:33,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 253 treesize of output 244 [2022-11-22 02:46:33,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:33,596 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-11-22 02:46:33,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 222 [2022-11-22 02:46:33,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:33,731 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:33,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:33,803 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-11-22 02:46:33,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 248 [2022-11-22 02:46:33,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:33,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:33,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:33,920 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-11-22 02:46:33,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 248 [2022-11-22 02:46:33,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:33,983 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-11-22 02:46:33,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 222 [2022-11-22 02:46:34,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:34,119 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:34,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:34,186 INFO L321 Elim1Store]: treesize reduction 154, result has 15.4 percent of original size [2022-11-22 02:46:34,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 255 [2022-11-22 02:46:34,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:34,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 222 [2022-11-22 02:46:34,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:34,242 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:34,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:34,314 INFO L321 Elim1Store]: treesize reduction 144, result has 20.9 percent of original size [2022-11-22 02:46:34,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 265 [2022-11-22 02:46:34,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:34,740 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:34,743 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:34,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:34,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:34,853 INFO L321 Elim1Store]: treesize reduction 281, result has 11.9 percent of original size [2022-11-22 02:46:34,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 504 treesize of output 482 [2022-11-22 02:46:34,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:34,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 464 treesize of output 423 [2022-11-22 02:46:34,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:34,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:34,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:34,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:34,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:34,951 INFO L321 Elim1Store]: treesize reduction 85, result has 1.2 percent of original size [2022-11-22 02:46:34,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 496 treesize of output 462 [2022-11-22 02:46:35,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:35,807 INFO L321 Elim1Store]: treesize reduction 92, result has 10.7 percent of original size [2022-11-22 02:46:35,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 484 treesize of output 402 [2022-11-22 02:46:36,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:36,510 INFO L321 Elim1Store]: treesize reduction 92, result has 10.7 percent of original size [2022-11-22 02:46:36,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 484 treesize of output 402 [2022-11-22 02:46:37,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:46:37,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:46:37,535 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:46:37,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:46:37,563 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:46:37,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:46:37,575 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:46:37,618 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:46:37,663 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:46:37,663 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:46:37,712 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:46:37,713 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:46:37,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:46:37,837 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-11-22 02:46:37,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-11-22 02:46:37,903 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-11-22 02:46:37,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-11-22 02:46:38,006 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:38,009 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:38,070 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-11-22 02:46:38,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-11-22 02:46:38,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:38,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:38,208 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-11-22 02:46:38,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-11-22 02:46:38,254 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:46:39,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:46:39,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:46:39,169 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:46:39,197 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:46:39,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:46:39,226 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:46:39,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:46:39,312 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:46:39,312 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:46:39,326 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:46:39,373 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:46:39,374 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:46:39,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:46:39,486 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-11-22 02:46:39,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-11-22 02:46:39,561 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-11-22 02:46:39,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-11-22 02:46:39,675 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:46:39,697 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:39,701 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:39,795 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-11-22 02:46:39,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-11-22 02:46:39,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:39,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:39,924 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-11-22 02:46:39,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-11-22 02:46:40,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:46:40,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:46:40,557 INFO L197 IcfgInterpreter]: Interpreting procedure rand_end_point with input of size 17 for LOIs [2022-11-22 02:46:40,566 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:46:48,242 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '15955#(and (<= |ULTIMATE.start_create_item_#in~cursor#1.offset| 8589934588) (<= |~#list~0.base| 3) (<= 3 |ULTIMATE.start_create_item_#in~cursor#1.base|) (<= 3 |ULTIMATE.start_create_item_~cursor#1.base|) (<= (+ |ULTIMATE.start_create_item_~cursor#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= |ULTIMATE.start_main_#t~ret30#1| 2147483647) (<= 0 (+ |ULTIMATE.start_append_one_~cursor~0#1.offset| 8589934592)) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_append_one_#in~to#1| 2147483647) (<= |ULTIMATE.start_create_item_#in~at#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_#t~ret30#1| 2147483648)) (<= |ULTIMATE.start_append_one_~to#1| 2147483647) (<= |ULTIMATE.start_append_one_~list#1.base| 3) (<= |ULTIMATE.start_append_one_#in~list#1.offset| 0) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1) (<= 3 |ULTIMATE.start_append_one_~cursor~0#1.base|) (<= |ULTIMATE.start_create_item_~cursor#1.base| 3) (<= 0 (+ 2147483648 |ULTIMATE.start_append_one_~to#1|)) (<= 0 |ULTIMATE.start_create_item_~cursor#1.offset|) (not (= (select |#valid| |ULTIMATE.start_create_item_#t~mem7#1.base|) 1)) (<= |ULTIMATE.start_append_one_~cursor~0#1.base| 3) (<= |#NULL.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~at#1| 2147483647) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) |ULTIMATE.start_create_item_#t~mem7#1.offset|) (<= 0 (+ |ULTIMATE.start_append_one_#in~to#1| 2147483648)) (<= 0 |ULTIMATE.start_append_one_#in~list#1.offset|) (<= 3 |ULTIMATE.start_append_one_~list#1.base|) (<= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_create_item_~at#1| 2147483648)) |ULTIMATE.start_create_item_#t~short10#1| (<= |ULTIMATE.start_append_one_~cursor~0#1.offset| 8589934588) (<= |ULTIMATE.start_create_item_#in~cursor#1.base| 3) (<= 0 (+ |ULTIMATE.start_create_item_#in~at#1| 2147483648)) (<= 0 (+ 8589934592 |ULTIMATE.start_create_item_#in~cursor#1.offset|)) (<= 0 |~#list~0.offset|) (<= 3 |~#list~0.base|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| 8589934588) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) |ULTIMATE.start_create_item_#t~mem7#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_append_one_#in~list#1.base| 3) (<= |~#list~0.offset| 0) (<= 3 |ULTIMATE.start_append_one_#in~list#1.base|))' at error location [2022-11-22 02:46:48,243 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:46:48,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:46:48,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 26 [2022-11-22 02:46:48,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277210574] [2022-11-22 02:46:48,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 02:46:48,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-22 02:46:48,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:46:48,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-22 02:46:48,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=2637, Unknown=0, NotChecked=0, Total=2862 [2022-11-22 02:46:48,246 INFO L87 Difference]: Start difference. First operand 223 states and 282 transitions. Second operand has 27 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 25 states have internal predecessors, (62), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-22 02:46:52,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:46:52,177 INFO L93 Difference]: Finished difference Result 481 states and 574 transitions. [2022-11-22 02:46:52,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-22 02:46:52,177 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 25 states have internal predecessors, (62), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 35 [2022-11-22 02:46:52,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:46:52,180 INFO L225 Difference]: With dead ends: 481 [2022-11-22 02:46:52,180 INFO L226 Difference]: Without dead ends: 481 [2022-11-22 02:46:52,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1694 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=527, Invalid=5325, Unknown=0, NotChecked=0, Total=5852 [2022-11-22 02:46:52,182 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 1090 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:46:52,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 1215 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-22 02:46:52,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-11-22 02:46:52,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 260. [2022-11-22 02:46:52,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 206 states have (on average 1.5145631067961165) internal successors, (312), 247 states have internal predecessors, (312), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:46:52,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 328 transitions. [2022-11-22 02:46:52,192 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 328 transitions. Word has length 35 [2022-11-22 02:46:52,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:46:52,192 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 328 transitions. [2022-11-22 02:46:52,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 25 states have internal predecessors, (62), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-22 02:46:52,193 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 328 transitions. [2022-11-22 02:46:52,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-22 02:46:52,193 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:46:52,194 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:46:52,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-22 02:46:52,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-22 02:46:52,400 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:46:52,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:46:52,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1336046808, now seen corresponding path program 1 times [2022-11-22 02:46:52,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:46:52,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763111638] [2022-11-22 02:46:52,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:52,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:46:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:56,047 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:46:56,047 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:46:56,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763111638] [2022-11-22 02:46:56,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763111638] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:46:56,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979791766] [2022-11-22 02:46:56,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:46:56,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:46:56,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:46:56,049 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:46:56,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 02:46:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:46:56,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 130 conjunts are in the unsatisfiable core [2022-11-22 02:46:56,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:46:56,430 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 02:46:56,431 INFO L350 Elim1Store]: Elim1 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-22 02:46:56,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:46:56,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:46:56,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:46:56,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:46:57,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:46:57,172 INFO L321 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-11-22 02:46:57,172 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 26 [2022-11-22 02:46:57,198 INFO L321 Elim1Store]: treesize reduction 22, result has 47.6 percent of original size [2022-11-22 02:46:57,199 INFO L350 Elim1Store]: Elim1 eliminated variable 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 27 treesize of output 37 [2022-11-22 02:46:57,464 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:57,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:57,481 INFO L321 Elim1Store]: treesize reduction 47, result has 34.7 percent of original size [2022-11-22 02:46:57,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 81 [2022-11-22 02:46:57,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:57,518 INFO L321 Elim1Store]: treesize reduction 42, result has 37.3 percent of original size [2022-11-22 02:46:57,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 113 [2022-11-22 02:46:58,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:58,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2022-11-22 02:46:58,429 INFO L321 Elim1Store]: treesize reduction 8, result has 73.3 percent of original size [2022-11-22 02:46:58,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2022-11-22 02:46:58,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:46:58,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:58,703 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-11-22 02:46:58,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 23 [2022-11-22 02:46:58,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:46:58,717 INFO L321 Elim1Store]: treesize reduction 20, result has 13.0 percent of original size [2022-11-22 02:46:58,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 13 [2022-11-22 02:46:58,812 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:46:58,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:47:05,452 WARN L233 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:47:05,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979791766] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:47:05,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [700931042] [2022-11-22 02:47:05,803 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2022-11-22 02:47:05,803 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:47:05,804 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:47:05,804 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:47:05,804 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:47:06,012 INFO L321 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-11-22 02:47:06,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 216 [2022-11-22 02:47:06,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:06,235 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:06,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:06,285 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-11-22 02:47:06,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 253 treesize of output 244 [2022-11-22 02:47:06,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:06,340 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-11-22 02:47:06,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 222 [2022-11-22 02:47:06,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:06,362 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:06,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:06,404 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-11-22 02:47:06,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 253 treesize of output 244 [2022-11-22 02:47:06,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:06,519 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:06,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:06,591 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-11-22 02:47:06,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 248 [2022-11-22 02:47:06,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:06,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:06,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:06,691 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-11-22 02:47:06,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 264 treesize of output 251 [2022-11-22 02:47:06,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:06,734 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-11-22 02:47:06,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 222 [2022-11-22 02:47:06,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:06,855 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:06,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:06,923 INFO L321 Elim1Store]: treesize reduction 154, result has 15.4 percent of original size [2022-11-22 02:47:06,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 255 [2022-11-22 02:47:06,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:06,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:06,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:07,045 INFO L321 Elim1Store]: treesize reduction 144, result has 20.9 percent of original size [2022-11-22 02:47:07,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 265 [2022-11-22 02:47:07,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:07,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 202 [2022-11-22 02:47:07,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:07,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:07,392 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:07,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:07,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:07,509 INFO L321 Elim1Store]: treesize reduction 278, result has 12.9 percent of original size [2022-11-22 02:47:07,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 498 treesize of output 483 [2022-11-22 02:47:07,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:07,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:07,552 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:07,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:07,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:07,638 INFO L321 Elim1Store]: treesize reduction 296, result has 7.2 percent of original size [2022-11-22 02:47:07,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 482 treesize of output 437 [2022-11-22 02:47:07,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:07,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 434 treesize of output 393 [2022-11-22 02:47:08,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:47:08,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:47:08,717 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:47:08,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:47:08,750 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:47:08,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:47:08,768 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:47:08,813 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:47:08,855 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:47:08,855 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:47:08,916 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:47:08,916 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:47:08,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:47:09,026 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-11-22 02:47:09,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-11-22 02:47:09,130 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-11-22 02:47:09,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-11-22 02:47:09,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:09,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:09,363 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-11-22 02:47:09,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-11-22 02:47:09,385 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:47:09,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:09,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:09,545 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-11-22 02:47:09,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-11-22 02:47:10,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:47:10,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:47:10,467 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:47:10,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:47:10,479 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:47:10,505 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:47:10,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:47:10,591 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:47:10,591 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:47:10,609 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:47:10,654 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:47:10,654 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:47:10,773 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-11-22 02:47:10,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-11-22 02:47:10,838 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-11-22 02:47:10,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-11-22 02:47:10,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:47:10,986 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:10,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:11,059 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-11-22 02:47:11,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-11-22 02:47:11,087 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:47:11,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:11,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:11,228 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-11-22 02:47:11,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-11-22 02:47:11,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:47:11,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:47:11,826 INFO L197 IcfgInterpreter]: Interpreting procedure rand_end_point with input of size 17 for LOIs [2022-11-22 02:47:11,834 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:47:20,422 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '16918#(and (<= |ULTIMATE.start_create_item_#in~cursor#1.offset| 8589934588) (<= |~#list~0.base| 3) (<= 3 |ULTIMATE.start_create_item_#in~cursor#1.base|) (<= 3 |ULTIMATE.start_create_item_~cursor#1.base|) (<= (+ |ULTIMATE.start_create_item_~cursor#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= |ULTIMATE.start_main_#t~ret30#1| 2147483647) (<= 0 (+ |ULTIMATE.start_append_one_~cursor~0#1.offset| 8589934592)) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_append_one_#in~to#1| 2147483647) (<= |ULTIMATE.start_create_item_#in~at#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_#t~ret30#1| 2147483648)) (<= |ULTIMATE.start_append_one_~to#1| 2147483647) (<= |ULTIMATE.start_append_one_~list#1.base| 3) (<= |ULTIMATE.start_append_one_#in~list#1.offset| 0) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1) (<= 3 |ULTIMATE.start_append_one_~cursor~0#1.base|) (or (not (= |ULTIMATE.start_create_item_#t~mem8#1.offset| 0)) (not (= |ULTIMATE.start_create_item_#t~mem8#1.base| 0))) (<= |ULTIMATE.start_create_item_~cursor#1.base| 3) (<= 0 (+ 2147483648 |ULTIMATE.start_append_one_~to#1|)) (<= 0 |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_append_one_~cursor~0#1.base| 3) (<= |#NULL.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= |ULTIMATE.start_create_item_#t~mem8#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|)) (<= |ULTIMATE.start_create_item_~at#1| 2147483647) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) |ULTIMATE.start_create_item_#t~mem7#1.offset|) (<= 0 (+ |ULTIMATE.start_append_one_#in~to#1| 2147483648)) (<= 0 |ULTIMATE.start_append_one_#in~list#1.offset|) (<= 3 |ULTIMATE.start_append_one_~list#1.base|) (<= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_create_item_~at#1| 2147483648)) |ULTIMATE.start_create_item_#t~short10#1| (<= |ULTIMATE.start_append_one_~cursor~0#1.offset| 8589934588) (<= |ULTIMATE.start_create_item_#in~cursor#1.base| 3) (or (not (<= 0 (+ (* 4 |ULTIMATE.start_create_item_~link_field~0#1|) |ULTIMATE.start_create_item_#t~mem7#1.offset|))) (not (<= (+ (* 4 |ULTIMATE.start_create_item_~link_field~0#1|) |ULTIMATE.start_create_item_#t~mem7#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_#t~mem7#1.base|)))) (<= 0 (+ |ULTIMATE.start_create_item_#in~at#1| 2147483648)) (<= 0 (+ 8589934592 |ULTIMATE.start_create_item_#in~cursor#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) |ULTIMATE.start_create_item_#t~mem8#1.offset|) (<= 0 |~#list~0.offset|) (<= 3 |~#list~0.base|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| 8589934588) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) |ULTIMATE.start_create_item_#t~mem7#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_append_one_#in~list#1.base| 3) (<= |~#list~0.offset| 0) (<= 3 |ULTIMATE.start_append_one_#in~list#1.base|))' at error location [2022-11-22 02:47:20,422 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:47:20,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:47:20,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 26 [2022-11-22 02:47:20,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517431645] [2022-11-22 02:47:20,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 02:47:20,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-22 02:47:20,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:47:20,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-22 02:47:20,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=2860, Unknown=0, NotChecked=0, Total=3080 [2022-11-22 02:47:20,425 INFO L87 Difference]: Start difference. First operand 260 states and 328 transitions. Second operand has 27 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 25 states have internal predecessors, (62), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-22 02:47:25,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:47:25,996 INFO L93 Difference]: Finished difference Result 383 states and 464 transitions. [2022-11-22 02:47:25,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-22 02:47:25,999 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 25 states have internal predecessors, (62), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 35 [2022-11-22 02:47:25,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:47:26,001 INFO L225 Difference]: With dead ends: 383 [2022-11-22 02:47:26,001 INFO L226 Difference]: Without dead ends: 383 [2022-11-22 02:47:26,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=416, Invalid=4840, Unknown=0, NotChecked=0, Total=5256 [2022-11-22 02:47:26,003 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 747 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 1861 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:47:26,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 1342 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1861 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-22 02:47:26,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-11-22 02:47:26,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 283. [2022-11-22 02:47:26,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 226 states have (on average 1.4955752212389382) internal successors, (338), 267 states have internal predecessors, (338), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-22 02:47:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 358 transitions. [2022-11-22 02:47:26,010 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 358 transitions. Word has length 35 [2022-11-22 02:47:26,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:47:26,011 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 358 transitions. [2022-11-22 02:47:26,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 25 states have internal predecessors, (62), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-22 02:47:26,011 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 358 transitions. [2022-11-22 02:47:26,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-22 02:47:26,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:47:26,012 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-22 02:47:26,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 02:47:26,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-22 02:47:26,219 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:47:26,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:47:26,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1462486730, now seen corresponding path program 1 times [2022-11-22 02:47:26,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:47:26,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891814734] [2022-11-22 02:47:26,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:47:26,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:47:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:47:27,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:47:27,822 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:47:27,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891814734] [2022-11-22 02:47:27,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891814734] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:47:27,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001527260] [2022-11-22 02:47:27,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:47:27,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:47:27,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:47:27,828 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:47:27,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 02:47:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:47:27,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-22 02:47:27,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:47:28,140 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 02:47:28,141 INFO L350 Elim1Store]: Elim1 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-22 02:47:28,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:47:28,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:47:28,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:47:28,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:47:28,489 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-22 02:47:28,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 02:47:28,505 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-22 02:47:28,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 02:47:28,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:28,664 INFO L350 Elim1Store]: Elim1 eliminated variable 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 52 treesize of output 51 [2022-11-22 02:47:28,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:28,686 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-11-22 02:47:28,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 56 [2022-11-22 02:47:29,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:29,073 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:47:29,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 50 [2022-11-22 02:47:29,093 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:47:29,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2022-11-22 02:47:29,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:47:29,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:47:30,184 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse17 (* ~unnamed1~0~LIST_BEG 4))) (let ((.cse4 (+ |c_~#list~0.offset| .cse17)) (.cse2 (+ |c_ULTIMATE.start_append_one_~list#1.offset| .cse17)) (.cse12 (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_END 4)))) (and (forall ((|ULTIMATE.start_create_item_~cursor#1.offset| Int) (v_ArrVal_380 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_380))) (store .cse3 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse3 |c_ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|))))) (store .cse1 |c_ULTIMATE.start_append_one_~list#1.base| (store (select .cse1 |c_ULTIMATE.start_append_one_~list#1.base|) .cse2 |c_ULTIMATE.start_create_item_~item~0#1.base|))) |c_~#list~0.base|) .cse4))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 0)))) (forall ((|ULTIMATE.start_create_item_~cursor#1.offset| Int) (v_ArrVal_380 (Array Int Int)) (v_ArrVal_381 (Array Int Int))) (or (forall ((v_ArrVal_387 Int) (v_ArrVal_385 Int)) (= (select (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_381))) (store .cse6 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse6 |c_ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset| v_ArrVal_385))))) (store .cse5 |c_ULTIMATE.start_append_one_~list#1.base| (store (select .cse5 |c_ULTIMATE.start_append_one_~list#1.base|) .cse2 v_ArrVal_387))) |c_~#list~0.base|) .cse4) 0)) (= (select |c_#valid| (select (select (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_380))) (store .cse8 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse8 |c_ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|))))) (store .cse7 |c_ULTIMATE.start_append_one_~list#1.base| (store (select .cse7 |c_ULTIMATE.start_append_one_~list#1.base|) .cse2 |c_ULTIMATE.start_create_item_~item~0#1.base|))) |c_~#list~0.base|) .cse4)) 1))) (forall ((|ULTIMATE.start_create_item_~cursor#1.offset| Int) (v_ArrVal_380 (Array Int Int))) (let ((.cse9 (select (select (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_380))) (store .cse11 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse11 |c_ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|))))) (store .cse10 |c_ULTIMATE.start_append_one_~list#1.base| (store (select .cse10 |c_ULTIMATE.start_append_one_~list#1.base|) .cse2 |c_ULTIMATE.start_create_item_~item~0#1.base|))) |c_~#list~0.base|) .cse12))) (or (= .cse9 0) (= (select |c_#valid| .cse9) 1)))) (forall ((|ULTIMATE.start_create_item_~cursor#1.offset| Int) (v_ArrVal_380 (Array Int Int)) (v_ArrVal_381 (Array Int Int))) (or (forall ((v_ArrVal_387 Int) (v_ArrVal_385 Int)) (= (select (select (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_381))) (store .cse14 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse14 |c_ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset| v_ArrVal_385))))) (store .cse13 |c_ULTIMATE.start_append_one_~list#1.base| (store (select .cse13 |c_ULTIMATE.start_append_one_~list#1.base|) .cse2 v_ArrVal_387))) |c_~#list~0.base|) .cse12) 0)) (= (select |c_#valid| (select (select (let ((.cse15 (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_380))) (store .cse16 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse16 |c_ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|))))) (store .cse15 |c_ULTIMATE.start_append_one_~list#1.base| (store (select .cse15 |c_ULTIMATE.start_append_one_~list#1.base|) .cse2 |c_ULTIMATE.start_create_item_~item~0#1.base|))) |c_~#list~0.base|) .cse12)) 1)))))) is different from false [2022-11-22 02:47:30,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001527260] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:47:30,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1646256300] [2022-11-22 02:47:30,751 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2022-11-22 02:47:30,751 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:47:30,751 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:47:30,751 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:47:30,752 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:47:30,947 INFO L321 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-11-22 02:47:30,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 216 [2022-11-22 02:47:31,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:31,164 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:31,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:31,201 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-11-22 02:47:31,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 253 treesize of output 244 [2022-11-22 02:47:31,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:31,233 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:31,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:31,273 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-11-22 02:47:31,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 253 treesize of output 244 [2022-11-22 02:47:31,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:31,310 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-11-22 02:47:31,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 222 [2022-11-22 02:47:31,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:31,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:31,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:31,484 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-11-22 02:47:31,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 248 [2022-11-22 02:47:31,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:31,527 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-11-22 02:47:31,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 222 [2022-11-22 02:47:31,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:31,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:31,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:31,609 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-11-22 02:47:31,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 248 [2022-11-22 02:47:31,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:31,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 222 [2022-11-22 02:47:31,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:31,730 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:31,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:31,795 INFO L321 Elim1Store]: treesize reduction 144, result has 20.9 percent of original size [2022-11-22 02:47:31,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 265 [2022-11-22 02:47:31,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:31,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:31,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:31,833 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:31,872 INFO L321 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-11-22 02:47:31,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 237 treesize of output 235 [2022-11-22 02:47:32,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:32,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:32,154 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:32,159 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:32,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:32,260 INFO L321 Elim1Store]: treesize reduction 278, result has 12.9 percent of original size [2022-11-22 02:47:32,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 498 treesize of output 483 [2022-11-22 02:47:32,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:32,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:32,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:32,299 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:32,301 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:32,314 INFO L321 Elim1Store]: treesize reduction 85, result has 1.2 percent of original size [2022-11-22 02:47:32,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 482 treesize of output 448 [2022-11-22 02:47:32,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:32,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 434 treesize of output 393 [2022-11-22 02:47:33,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:47:33,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:47:33,297 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:47:33,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:47:33,325 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:47:33,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:47:33,340 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:47:33,404 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:47:33,405 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:47:33,431 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:47:33,474 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:47:33,475 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:47:33,552 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-11-22 02:47:33,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-11-22 02:47:33,626 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-11-22 02:47:33,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-11-22 02:47:33,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:47:33,719 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:47:33,741 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:33,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:33,806 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-11-22 02:47:33,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-11-22 02:47:33,835 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:33,838 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:33,943 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-11-22 02:47:33,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-11-22 02:47:34,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:47:34,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:47:34,841 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:47:34,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:47:34,855 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:47:34,885 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:47:34,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:47:34,973 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:47:34,973 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:47:34,990 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:47:35,041 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:47:35,041 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:47:35,149 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-11-22 02:47:35,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-11-22 02:47:35,224 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-11-22 02:47:35,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-11-22 02:47:35,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:47:35,366 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:35,370 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:35,440 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-11-22 02:47:35,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-11-22 02:47:35,475 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:35,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:47:35,599 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-11-22 02:47:35,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-11-22 02:47:35,638 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:47:36,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:47:36,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:47:36,324 INFO L197 IcfgInterpreter]: Interpreting procedure rand_end_point with input of size 17 for LOIs [2022-11-22 02:47:36,331 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:47:44,072 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '17856#(and (<= |~#list~0.base| 3) (<= 0 |#NULL.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|)) |ULTIMATE.start_main_~cursor~1#1.offset|) (= (select |#valid| |~#list~0.base|) 1) (or (not (= |ULTIMATE.start_main_~cursor~1#1.offset| 0)) (not (= |ULTIMATE.start_main_~cursor~1#1.base| 0))) (<= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= |#NULL.offset| 0) (= |ULTIMATE.start_main_~cursor~1#1.base| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|))) (or (and (= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_main_~direction~0#1|) (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_~end_point~0#1|)) (and (= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_main_~direction~0#1|) (= ~unnamed1~0~LIST_END |ULTIMATE.start_main_~end_point~0#1|))) (<= |#NULL.base| 0) (<= 0 |~#list~0.offset|) (<= 3 |~#list~0.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (not (= (select |#valid| |ULTIMATE.start_main_~cursor~1#1.base|) 1)) (<= |~#list~0.offset| 0))' at error location [2022-11-22 02:47:44,072 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:47:44,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:47:44,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 19 [2022-11-22 02:47:44,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710662084] [2022-11-22 02:47:44,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 02:47:44,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-22 02:47:44,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:47:44,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-22 02:47:44,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2356, Unknown=1, NotChecked=98, Total=2652 [2022-11-22 02:47:44,074 INFO L87 Difference]: Start difference. First operand 283 states and 358 transitions. Second operand has 20 states, 19 states have (on average 3.473684210526316) internal successors, (66), 20 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:47:48,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:47:48,029 INFO L93 Difference]: Finished difference Result 444 states and 534 transitions. [2022-11-22 02:47:48,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-22 02:47:48,030 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.473684210526316) internal successors, (66), 20 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-11-22 02:47:48,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:47:48,032 INFO L225 Difference]: With dead ends: 444 [2022-11-22 02:47:48,032 INFO L226 Difference]: Without dead ends: 444 [2022-11-22 02:47:48,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=381, Invalid=3912, Unknown=1, NotChecked=128, Total=4422 [2022-11-22 02:47:48,034 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 690 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1569 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:47:48,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 1069 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1569 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-22 02:47:48,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-11-22 02:47:48,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 286. [2022-11-22 02:47:48,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 230 states have (on average 1.491304347826087) internal successors, (343), 270 states have internal predecessors, (343), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-22 02:47:48,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 363 transitions. [2022-11-22 02:47:48,042 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 363 transitions. Word has length 35 [2022-11-22 02:47:48,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:47:48,042 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 363 transitions. [2022-11-22 02:47:48,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.473684210526316) internal successors, (66), 20 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:47:48,042 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 363 transitions. [2022-11-22 02:47:48,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-22 02:47:48,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:47:48,043 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-22 02:47:48,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 02:47:48,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-22 02:47:48,249 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:47:48,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:47:48,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1462486731, now seen corresponding path program 1 times [2022-11-22 02:47:48,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:47:48,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806661389] [2022-11-22 02:47:48,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:47:48,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:47:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:47:50,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:47:50,237 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:47:50,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806661389] [2022-11-22 02:47:50,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806661389] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:47:50,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80761458] [2022-11-22 02:47:50,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:47:50,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:47:50,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:47:50,239 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:47:50,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 02:47:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:47:50,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-22 02:47:50,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:47:50,516 INFO L350 Elim1Store]: Elim1 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-22 02:47:50,530 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:47:50,530 INFO L350 Elim1Store]: Elim1 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-22 02:47:50,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:47:50,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:47:50,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:47:50,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:47:50,923 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-22 02:47:50,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 02:47:50,943 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-22 02:47:50,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 02:47:51,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:51,207 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-11-22 02:47:51,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 54 [2022-11-22 02:47:51,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:51,228 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-11-22 02:47:51,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 81 [2022-11-22 02:47:51,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:51,654 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:47:51,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 42 [2022-11-22 02:47:51,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:47:51,671 INFO L321 Elim1Store]: treesize reduction 20, result has 13.0 percent of original size [2022-11-22 02:47:51,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 13 [2022-11-22 02:47:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:47:51,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:48:01,431 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:48:01,432 INFO L350 Elim1Store]: Elim1 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 369 treesize of output 374 [2022-11-22 02:48:03,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80761458] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:48:03,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1914527041] [2022-11-22 02:48:03,567 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2022-11-22 02:48:03,568 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:48:03,568 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:48:03,568 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:48:03,568 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:48:03,768 INFO L321 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-11-22 02:48:03,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 216 [2022-11-22 02:48:04,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:04,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:04,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:04,049 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-11-22 02:48:04,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 253 treesize of output 244 [2022-11-22 02:48:04,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:04,091 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-11-22 02:48:04,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 222 [2022-11-22 02:48:04,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:04,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:04,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:04,147 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-11-22 02:48:04,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 253 treesize of output 244 [2022-11-22 02:48:04,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:04,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:04,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:04,328 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-11-22 02:48:04,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 264 treesize of output 251 [2022-11-22 02:48:04,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:04,372 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-11-22 02:48:04,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 222 [2022-11-22 02:48:04,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:04,398 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:04,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:04,467 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-11-22 02:48:04,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 248 [2022-11-22 02:48:04,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:04,568 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:04,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:04,641 INFO L321 Elim1Store]: treesize reduction 154, result has 15.4 percent of original size [2022-11-22 02:48:04,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 255 [2022-11-22 02:48:04,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:04,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 222 [2022-11-22 02:48:04,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:04,691 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:04,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:04,769 INFO L321 Elim1Store]: treesize reduction 144, result has 20.9 percent of original size [2022-11-22 02:48:04,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 265 [2022-11-22 02:48:05,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:05,079 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:05,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:05,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:05,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:05,183 INFO L321 Elim1Store]: treesize reduction 281, result has 11.9 percent of original size [2022-11-22 02:48:05,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 504 treesize of output 482 [2022-11-22 02:48:05,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:05,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 464 treesize of output 423 [2022-11-22 02:48:05,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:05,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:05,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:05,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:05,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:05,320 INFO L321 Elim1Store]: treesize reduction 296, result has 7.2 percent of original size [2022-11-22 02:48:05,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 496 treesize of output 451 [2022-11-22 02:48:06,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:48:06,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:48:06,644 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:48:06,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:48:06,677 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:48:06,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:48:06,692 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:48:06,763 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:48:06,764 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:48:06,809 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:48:06,810 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:48:06,831 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:48:06,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:48:06,956 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-11-22 02:48:06,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-11-22 02:48:07,017 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-11-22 02:48:07,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-11-22 02:48:07,083 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:48:07,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:07,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:07,216 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-11-22 02:48:07,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-11-22 02:48:07,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:07,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:07,333 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-11-22 02:48:07,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-11-22 02:48:08,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:48:08,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:48:08,220 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:48:08,248 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:48:08,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:48:08,278 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:48:08,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:48:08,324 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:48:08,373 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:48:08,373 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:48:08,422 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:48:08,423 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:48:08,517 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-11-22 02:48:08,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-11-22 02:48:08,579 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-11-22 02:48:08,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-11-22 02:48:08,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:48:08,671 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:48:08,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:08,705 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:08,768 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-11-22 02:48:08,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-11-22 02:48:08,814 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:08,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:08,941 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-11-22 02:48:08,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-11-22 02:48:09,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:48:09,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:48:09,698 INFO L197 IcfgInterpreter]: Interpreting procedure rand_end_point with input of size 17 for LOIs [2022-11-22 02:48:09,706 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:48:20,571 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '18855#(and (<= |~#list~0.base| 3) (<= 0 |#NULL.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|)) |ULTIMATE.start_main_~cursor~1#1.offset|) (= (select |#valid| |~#list~0.base|) 1) (or (not (= |ULTIMATE.start_main_~cursor~1#1.offset| 0)) (not (= |ULTIMATE.start_main_~cursor~1#1.base| 0))) (or (not (<= (+ (* 4 |ULTIMATE.start_main_~direction~0#1|) 4 |ULTIMATE.start_main_~cursor~1#1.offset|) (select |#length| |ULTIMATE.start_main_~cursor~1#1.base|))) (not (<= 0 (+ (* 4 |ULTIMATE.start_main_~direction~0#1|) |ULTIMATE.start_main_~cursor~1#1.offset|)))) (<= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= |#NULL.offset| 0) (= |ULTIMATE.start_main_~cursor~1#1.base| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|))) (or (and (= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_main_~direction~0#1|) (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_~end_point~0#1|)) (and (= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_main_~direction~0#1|) (= ~unnamed1~0~LIST_END |ULTIMATE.start_main_~end_point~0#1|))) (<= |#NULL.base| 0) (<= 0 |~#list~0.offset|) (<= 3 |~#list~0.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (<= |~#list~0.offset| 0))' at error location [2022-11-22 02:48:20,572 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:48:20,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:48:20,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 18 [2022-11-22 02:48:20,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654371028] [2022-11-22 02:48:20,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 02:48:20,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-22 02:48:20,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:48:20,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-22 02:48:20,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2457, Unknown=2, NotChecked=0, Total=2652 [2022-11-22 02:48:20,575 INFO L87 Difference]: Start difference. First operand 286 states and 363 transitions. Second operand has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:48:26,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:48:26,119 INFO L93 Difference]: Finished difference Result 490 states and 609 transitions. [2022-11-22 02:48:26,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-22 02:48:26,119 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-11-22 02:48:26,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:48:26,122 INFO L225 Difference]: With dead ends: 490 [2022-11-22 02:48:26,122 INFO L226 Difference]: Without dead ends: 490 [2022-11-22 02:48:26,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=390, Invalid=3768, Unknown=2, NotChecked=0, Total=4160 [2022-11-22 02:48:26,124 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 830 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:48:26,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 1334 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-22 02:48:26,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-11-22 02:48:26,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 328. [2022-11-22 02:48:26,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 269 states have (on average 1.5055762081784387) internal successors, (405), 310 states have internal predecessors, (405), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-22 02:48:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 429 transitions. [2022-11-22 02:48:26,133 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 429 transitions. Word has length 35 [2022-11-22 02:48:26,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:48:26,133 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 429 transitions. [2022-11-22 02:48:26,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:48:26,134 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 429 transitions. [2022-11-22 02:48:26,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-22 02:48:26,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:48:26,135 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-22 02:48:26,145 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-22 02:48:26,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:48:26,346 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:48:26,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:48:26,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1462488108, now seen corresponding path program 1 times [2022-11-22 02:48:26,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:48:26,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339829879] [2022-11-22 02:48:26,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:48:26,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:48:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:48:27,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:48:27,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:48:27,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339829879] [2022-11-22 02:48:27,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339829879] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:48:27,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:48:27,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-22 02:48:27,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424701483] [2022-11-22 02:48:27,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:48:27,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 02:48:27,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:48:27,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 02:48:27,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-22 02:48:27,028 INFO L87 Difference]: Start difference. First operand 328 states and 429 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:48:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:48:27,780 INFO L93 Difference]: Finished difference Result 480 states and 618 transitions. [2022-11-22 02:48:27,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-22 02:48:27,781 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-11-22 02:48:27,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:48:27,784 INFO L225 Difference]: With dead ends: 480 [2022-11-22 02:48:27,784 INFO L226 Difference]: Without dead ends: 480 [2022-11-22 02:48:27,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2022-11-22 02:48:27,784 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 598 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:48:27,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 565 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 02:48:27,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-11-22 02:48:27,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 395. [2022-11-22 02:48:27,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 330 states have (on average 1.5) internal successors, (495), 373 states have internal predecessors, (495), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-22 02:48:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 527 transitions. [2022-11-22 02:48:27,795 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 527 transitions. Word has length 35 [2022-11-22 02:48:27,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:48:27,795 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 527 transitions. [2022-11-22 02:48:27,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:48:27,796 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 527 transitions. [2022-11-22 02:48:27,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-22 02:48:27,796 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:48:27,796 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:48:27,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-22 02:48:27,797 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:48:27,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:48:27,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1164768987, now seen corresponding path program 1 times [2022-11-22 02:48:27,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:48:27,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668995526] [2022-11-22 02:48:27,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:48:27,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:48:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:48:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 02:48:32,153 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:48:32,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668995526] [2022-11-22 02:48:32,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668995526] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:48:32,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943727424] [2022-11-22 02:48:32,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:48:32,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:48:32,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:48:32,156 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:48:32,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 02:48:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:48:32,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-22 02:48:32,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:48:32,387 INFO L350 Elim1Store]: Elim1 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-22 02:48:32,393 INFO L350 Elim1Store]: Elim1 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-22 02:48:32,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 02:48:32,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 02:48:32,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:32,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-11-22 02:48:32,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:32,869 INFO L350 Elim1Store]: Elim1 eliminated variable 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 50 treesize of output 33 [2022-11-22 02:48:33,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:33,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2022-11-22 02:48:33,334 INFO L321 Elim1Store]: treesize reduction 4, result has 81.0 percent of original size [2022-11-22 02:48:33,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2022-11-22 02:48:33,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:33,597 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-11-22 02:48:33,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 15 [2022-11-22 02:48:33,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:33,612 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-11-22 02:48:33,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 13 [2022-11-22 02:48:33,674 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:48:33,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:48:42,262 WARN L233 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:48:42,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943727424] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:48:42,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1102099713] [2022-11-22 02:48:42,564 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-22 02:48:42,564 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:48:42,565 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:48:42,565 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:48:42,565 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:48:42,701 INFO L321 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-11-22 02:48:42,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 216 [2022-11-22 02:48:42,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:42,888 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:42,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:42,931 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-11-22 02:48:42,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 253 treesize of output 244 [2022-11-22 02:48:42,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:42,975 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-11-22 02:48:42,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 222 [2022-11-22 02:48:42,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:42,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:43,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:43,032 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-11-22 02:48:43,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 253 treesize of output 244 [2022-11-22 02:48:43,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:43,134 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:43,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:43,209 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-11-22 02:48:43,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 248 [2022-11-22 02:48:43,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:43,254 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-11-22 02:48:43,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 222 [2022-11-22 02:48:43,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:43,276 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:43,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:43,349 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-11-22 02:48:43,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 248 [2022-11-22 02:48:43,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:43,447 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:43,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:43,515 INFO L321 Elim1Store]: treesize reduction 154, result has 15.4 percent of original size [2022-11-22 02:48:43,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 255 [2022-11-22 02:48:43,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:43,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 222 [2022-11-22 02:48:43,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:43,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:43,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:43,643 INFO L321 Elim1Store]: treesize reduction 144, result has 20.9 percent of original size [2022-11-22 02:48:43,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 265 [2022-11-22 02:48:43,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:43,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:43,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:43,987 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:43,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:44,004 INFO L321 Elim1Store]: treesize reduction 85, result has 1.2 percent of original size [2022-11-22 02:48:44,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 703 treesize of output 649 [2022-11-22 02:48:44,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:44,039 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:44,041 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:44,046 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:44,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:44,137 INFO L321 Elim1Store]: treesize reduction 278, result has 12.9 percent of original size [2022-11-22 02:48:44,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 679 treesize of output 652 [2022-11-22 02:48:44,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:44,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 631 treesize of output 574 [2022-11-22 02:48:44,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:44,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:44,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:44,609 INFO L321 Elim1Store]: treesize reduction 160, result has 12.6 percent of original size [2022-11-22 02:48:44,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 657 treesize of output 622 [2022-11-22 02:48:44,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:44,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:44,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:44,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:44,671 INFO L321 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2022-11-22 02:48:44,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 616 treesize of output 578 [2022-11-22 02:48:44,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:44,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 519 treesize of output 462 [2022-11-22 02:48:45,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:45,080 INFO L321 Elim1Store]: treesize reduction 68, result has 13.9 percent of original size [2022-11-22 02:48:45,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 368 treesize of output 314 [2022-11-22 02:48:45,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:48:45,491 INFO L321 Elim1Store]: treesize reduction 80, result has 12.1 percent of original size [2022-11-22 02:48:45,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 384 treesize of output 316 [2022-11-22 02:48:45,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:48:45,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:48:46,026 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:48:46,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:48:46,060 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:48:46,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:48:46,077 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:48:46,115 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:48:46,158 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:48:46,159 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:48:46,205 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:48:46,205 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:48:46,280 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-11-22 02:48:46,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-11-22 02:48:46,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:48:46,369 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-11-22 02:48:46,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-11-22 02:48:46,445 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:46,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:46,508 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-11-22 02:48:46,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-11-22 02:48:46,527 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:48:46,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:46,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:46,665 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-11-22 02:48:46,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-11-22 02:48:46,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:46,820 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-22 02:48:46,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:46,877 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-22 02:48:46,890 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:48:47,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:48:47,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:48:47,495 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:48:47,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:48:47,510 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:48:47,556 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:48:47,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:48:47,598 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:48:47,641 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:48:47,642 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:48:47,689 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:48:47,689 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:48:47,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:48:47,806 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-11-22 02:48:47,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-11-22 02:48:47,868 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-11-22 02:48:47,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-11-22 02:48:47,951 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:48:47,973 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:47,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:48,050 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-11-22 02:48:48,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-11-22 02:48:48,079 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:48,083 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:48,187 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-11-22 02:48:48,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-11-22 02:48:48,343 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:48:48,394 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:48,395 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-22 02:48:48,408 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:48:48,409 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-22 02:48:48,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:48:48,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:48:48,674 INFO L197 IcfgInterpreter]: Interpreting procedure rand_end_point with input of size 17 for LOIs [2022-11-22 02:48:48,681 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:48:58,243 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '20782#(and (<= |ULTIMATE.start_create_item_#in~cursor#1.offset| 8589934588) (<= |~#list~0.base| 3) (<= 3 |ULTIMATE.start_create_item_#in~cursor#1.base|) (<= 3 |ULTIMATE.start_create_item_~cursor#1.base|) (<= (+ |ULTIMATE.start_create_item_~cursor#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= |ULTIMATE.start_main_#t~ret30#1| 2147483647) (<= 0 (+ |ULTIMATE.start_append_one_~cursor~0#1.offset| 8589934592)) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_append_one_#in~to#1| 2147483647) (<= |ULTIMATE.start_create_item_#in~at#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_#t~ret30#1| 2147483648)) (<= |ULTIMATE.start_append_one_~to#1| 2147483647) (<= |ULTIMATE.start_append_one_~list#1.base| 3) (<= |ULTIMATE.start_append_one_#in~list#1.offset| 0) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1) (<= 3 |ULTIMATE.start_append_one_~cursor~0#1.base|) (or (not (= |ULTIMATE.start_create_item_#t~mem8#1.offset| 0)) (not (= |ULTIMATE.start_create_item_#t~mem8#1.base| 0))) (<= |ULTIMATE.start_create_item_~cursor#1.base| 3) (<= 0 (+ 2147483648 |ULTIMATE.start_append_one_~to#1|)) (<= 0 |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_append_one_~cursor~0#1.base| 3) (<= |#NULL.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= |ULTIMATE.start_create_item_#t~mem8#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|)) (<= |ULTIMATE.start_create_item_~at#1| 2147483647) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) |ULTIMATE.start_create_item_#t~mem7#1.offset|) (<= 0 (+ |ULTIMATE.start_append_one_#in~to#1| 2147483648)) (<= 0 |ULTIMATE.start_append_one_#in~list#1.offset|) (<= 3 |ULTIMATE.start_append_one_~list#1.base|) (<= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_create_item_~at#1| 2147483648)) |ULTIMATE.start_create_item_#t~short10#1| (<= |ULTIMATE.start_append_one_~cursor~0#1.offset| 8589934588) (<= |ULTIMATE.start_create_item_#in~cursor#1.base| 3) (or (not (<= 0 (+ (* 4 |ULTIMATE.start_create_item_~link_field~0#1|) |ULTIMATE.start_create_item_#t~mem7#1.offset|))) (not (<= (+ (* 4 |ULTIMATE.start_create_item_~link_field~0#1|) |ULTIMATE.start_create_item_#t~mem7#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_#t~mem7#1.base|)))) (<= 0 (+ |ULTIMATE.start_create_item_#in~at#1| 2147483648)) (<= 0 (+ 8589934592 |ULTIMATE.start_create_item_#in~cursor#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) |ULTIMATE.start_create_item_#t~mem8#1.offset|) (<= 0 |~#list~0.offset|) (<= 3 |~#list~0.base|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| 8589934588) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) |ULTIMATE.start_create_item_#t~mem7#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_append_one_#in~list#1.base| 3) (<= |~#list~0.offset| 0) (<= 3 |ULTIMATE.start_append_one_#in~list#1.base|))' at error location [2022-11-22 02:48:58,243 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:48:58,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:48:58,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 27 [2022-11-22 02:48:58,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759950608] [2022-11-22 02:48:58,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 02:48:58,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-22 02:48:58,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:48:58,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-22 02:48:58,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=3049, Unknown=0, NotChecked=0, Total=3306 [2022-11-22 02:48:58,245 INFO L87 Difference]: Start difference. First operand 395 states and 527 transitions. Second operand has 28 states, 25 states have (on average 2.52) internal successors, (63), 24 states have internal predecessors, (63), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-22 02:49:05,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:49:05,684 INFO L93 Difference]: Finished difference Result 771 states and 963 transitions. [2022-11-22 02:49:05,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-22 02:49:05,687 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.52) internal successors, (63), 24 states have internal predecessors, (63), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-11-22 02:49:05,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:49:05,690 INFO L225 Difference]: With dead ends: 771 [2022-11-22 02:49:05,691 INFO L226 Difference]: Without dead ends: 771 [2022-11-22 02:49:05,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1917 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=560, Invalid=6246, Unknown=0, NotChecked=0, Total=6806 [2022-11-22 02:49:05,693 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 1197 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 3507 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 3583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 3507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:49:05,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 1889 Invalid, 3583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 3507 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-22 02:49:05,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2022-11-22 02:49:05,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 436. [2022-11-22 02:49:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 365 states have (on average 1.4986301369863013) internal successors, (547), 409 states have internal predecessors, (547), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-22 02:49:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 587 transitions. [2022-11-22 02:49:05,724 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 587 transitions. Word has length 36 [2022-11-22 02:49:05,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:49:05,725 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 587 transitions. [2022-11-22 02:49:05,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.52) internal successors, (63), 24 states have internal predecessors, (63), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-22 02:49:05,725 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 587 transitions. [2022-11-22 02:49:05,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-22 02:49:05,726 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:49:05,726 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-22 02:49:05,735 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-22 02:49:05,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-22 02:49:05,931 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:49:05,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:49:05,932 INFO L85 PathProgramCache]: Analyzing trace with hash -331664771, now seen corresponding path program 1 times [2022-11-22 02:49:05,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:49:05,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902042505] [2022-11-22 02:49:05,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:49:05,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:49:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:49:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:49:06,608 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:49:06,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902042505] [2022-11-22 02:49:06,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902042505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:49:06,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:49:06,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-22 02:49:06,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018519671] [2022-11-22 02:49:06,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:49:06,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 02:49:06,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:49:06,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 02:49:06,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-22 02:49:06,610 INFO L87 Difference]: Start difference. First operand 436 states and 587 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:49:07,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:49:07,590 INFO L93 Difference]: Finished difference Result 666 states and 858 transitions. [2022-11-22 02:49:07,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-22 02:49:07,591 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-11-22 02:49:07,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:49:07,593 INFO L225 Difference]: With dead ends: 666 [2022-11-22 02:49:07,593 INFO L226 Difference]: Without dead ends: 666 [2022-11-22 02:49:07,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2022-11-22 02:49:07,593 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 480 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:49:07,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 588 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 02:49:07,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-11-22 02:49:07,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 442. [2022-11-22 02:49:07,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 371 states have (on average 1.4959568733153639) internal successors, (555), 415 states have internal predecessors, (555), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-22 02:49:07,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 595 transitions. [2022-11-22 02:49:07,607 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 595 transitions. Word has length 36 [2022-11-22 02:49:07,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:49:07,607 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 595 transitions. [2022-11-22 02:49:07,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:49:07,608 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 595 transitions. [2022-11-22 02:49:07,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-22 02:49:07,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:49:07,609 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-22 02:49:07,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-22 02:49:07,609 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:49:07,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:49:07,610 INFO L85 PathProgramCache]: Analyzing trace with hash -331664770, now seen corresponding path program 1 times [2022-11-22 02:49:07,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:49:07,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612872233] [2022-11-22 02:49:07,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:49:07,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:49:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:49:08,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:49:08,673 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:49:08,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612872233] [2022-11-22 02:49:08,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612872233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:49:08,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:49:08,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 02:49:08,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916820319] [2022-11-22 02:49:08,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:49:08,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 02:49:08,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:49:08,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 02:49:08,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:49:08,677 INFO L87 Difference]: Start difference. First operand 442 states and 595 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:49:09,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:49:09,781 INFO L93 Difference]: Finished difference Result 610 states and 780 transitions. [2022-11-22 02:49:09,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 02:49:09,782 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-11-22 02:49:09,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:49:09,788 INFO L225 Difference]: With dead ends: 610 [2022-11-22 02:49:09,788 INFO L226 Difference]: Without dead ends: 610 [2022-11-22 02:49:09,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-11-22 02:49:09,789 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 569 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:49:09,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 580 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 02:49:09,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-11-22 02:49:09,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 420. [2022-11-22 02:49:09,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 352 states have (on average 1.5056818181818181) internal successors, (530), 395 states have internal predecessors, (530), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-22 02:49:09,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 566 transitions. [2022-11-22 02:49:09,801 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 566 transitions. Word has length 36 [2022-11-22 02:49:09,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:49:09,801 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 566 transitions. [2022-11-22 02:49:09,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:49:09,802 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 566 transitions. [2022-11-22 02:49:09,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-22 02:49:09,802 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:49:09,803 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, 1] [2022-11-22 02:49:09,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-22 02:49:09,803 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:49:09,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:49:09,804 INFO L85 PathProgramCache]: Analyzing trace with hash 995481387, now seen corresponding path program 1 times [2022-11-22 02:49:09,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:49:09,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382150012] [2022-11-22 02:49:09,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:49:09,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:49:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:49:10,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:49:10,800 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:49:10,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382150012] [2022-11-22 02:49:10,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382150012] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:49:10,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584279482] [2022-11-22 02:49:10,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:49:10,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:49:10,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:49:10,802 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:49:10,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 02:49:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:49:10,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-22 02:49:10,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:49:11,127 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:49:11,128 INFO L350 Elim1Store]: Elim1 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-22 02:49:11,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:49:11,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:49:11,471 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-22 02:49:11,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 02:49:11,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:11,665 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-11-22 02:49:11,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 47 [2022-11-22 02:49:12,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:12,037 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:49:12,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 40 [2022-11-22 02:49:12,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:49:12,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:49:12,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584279482] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:49:12,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [998831785] [2022-11-22 02:49:12,975 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-11-22 02:49:12,975 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:49:12,976 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:49:12,976 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:49:12,976 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:49:13,196 INFO L321 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-11-22 02:49:13,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 216 [2022-11-22 02:49:13,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:13,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:13,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:13,422 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-11-22 02:49:13,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 253 treesize of output 244 [2022-11-22 02:49:13,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:13,465 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-11-22 02:49:13,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 222 [2022-11-22 02:49:13,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:13,482 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:13,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:13,523 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-11-22 02:49:13,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 253 treesize of output 244 [2022-11-22 02:49:13,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:13,633 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:13,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:13,711 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-11-22 02:49:13,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 264 treesize of output 251 [2022-11-22 02:49:13,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:13,759 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-11-22 02:49:13,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 222 [2022-11-22 02:49:13,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:13,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:13,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:13,848 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-11-22 02:49:13,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 248 [2022-11-22 02:49:13,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:13,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:13,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:14,036 INFO L321 Elim1Store]: treesize reduction 154, result has 15.4 percent of original size [2022-11-22 02:49:14,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 255 [2022-11-22 02:49:14,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:14,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:14,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:14,136 INFO L321 Elim1Store]: treesize reduction 144, result has 20.9 percent of original size [2022-11-22 02:49:14,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 265 [2022-11-22 02:49:14,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:14,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 202 [2022-11-22 02:49:14,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:14,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:14,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:14,443 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:14,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:14,460 INFO L321 Elim1Store]: treesize reduction 85, result has 1.2 percent of original size [2022-11-22 02:49:14,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 504 treesize of output 470 [2022-11-22 02:49:14,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:14,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:14,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:14,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:14,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:14,594 INFO L321 Elim1Store]: treesize reduction 281, result has 11.9 percent of original size [2022-11-22 02:49:14,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 488 treesize of output 466 [2022-11-22 02:49:14,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:14,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 448 treesize of output 407 [2022-11-22 02:49:16,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:49:16,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:49:16,275 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:49:16,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:49:16,304 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:49:16,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:49:16,318 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:49:16,354 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:49:16,397 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:49:16,398 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:49:16,444 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:49:16,444 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:49:16,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:49:16,559 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-11-22 02:49:16,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-11-22 02:49:16,622 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-11-22 02:49:16,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-11-22 02:49:16,689 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:49:16,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:16,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:16,779 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-11-22 02:49:16,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-11-22 02:49:16,809 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:16,813 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:16,922 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-11-22 02:49:16,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-11-22 02:49:17,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:49:17,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:49:17,736 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:49:17,763 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:49:17,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:49:17,793 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:49:17,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:49:17,862 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:49:17,862 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:49:17,911 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:49:17,912 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:49:17,928 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:49:18,028 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-11-22 02:49:18,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-11-22 02:49:18,088 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-11-22 02:49:18,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-11-22 02:49:18,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:49:18,187 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:18,193 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:18,293 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-11-22 02:49:18,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-11-22 02:49:18,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:18,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:18,419 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-11-22 02:49:18,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-11-22 02:49:18,448 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:49:19,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:49:19,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:49:19,151 INFO L197 IcfgInterpreter]: Interpreting procedure rand_end_point with input of size 17 for LOIs [2022-11-22 02:49:19,159 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:49:27,757 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '24474#(and (<= |~#list~0.base| 3) (<= 0 |#NULL.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|)) |ULTIMATE.start_main_~cursor~1#1.offset|) (= (select |#valid| |~#list~0.base|) 1) (not (= |ULTIMATE.start_main_~cursor~1#1.base| 0)) (<= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= |#NULL.offset| 0) (= |ULTIMATE.start_main_~cursor~1#1.offset| 0) (= |ULTIMATE.start_main_~cursor~1#1.base| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|))) (= |ULTIMATE.start_main_~next~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~cursor~1#1.base|) (+ (* 4 |ULTIMATE.start_main_~direction~0#1|) |ULTIMATE.start_main_~cursor~1#1.offset|))) (or (and (= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_main_~direction~0#1|) (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_~end_point~0#1|)) (and (= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_main_~direction~0#1|) (= ~unnamed1~0~LIST_END |ULTIMATE.start_main_~end_point~0#1|))) (<= (+ (* 4 |ULTIMATE.start_main_~direction~0#1|) 4 |ULTIMATE.start_main_~cursor~1#1.offset|) (select |#length| |ULTIMATE.start_main_~cursor~1#1.base|)) (<= |#NULL.base| 0) (= |ULTIMATE.start_main_~next~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~cursor~1#1.base|) (+ (* 4 |ULTIMATE.start_main_~direction~0#1|) |ULTIMATE.start_main_~cursor~1#1.offset|))) (<= 0 |~#list~0.offset|) (<= 3 |~#list~0.base|) (<= 0 |#NULL.offset|) (= (select |#valid| |ULTIMATE.start_main_~cursor~1#1.base|) 1) (not (< |ULTIMATE.start_main_~cursor~1#1.base| |#StackHeapBarrier|)) (<= 0 |#StackHeapBarrier|) (<= |~#list~0.offset| 0))' at error location [2022-11-22 02:49:27,757 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:49:27,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:49:27,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 17 [2022-11-22 02:49:27,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780888049] [2022-11-22 02:49:27,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 02:49:27,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-22 02:49:27,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:49:27,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-22 02:49:27,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2349, Unknown=3, NotChecked=0, Total=2550 [2022-11-22 02:49:27,760 INFO L87 Difference]: Start difference. First operand 420 states and 566 transitions. Second operand has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:49:33,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:49:33,525 INFO L93 Difference]: Finished difference Result 974 states and 1220 transitions. [2022-11-22 02:49:33,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-22 02:49:33,526 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-11-22 02:49:33,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:49:33,529 INFO L225 Difference]: With dead ends: 974 [2022-11-22 02:49:33,529 INFO L226 Difference]: Without dead ends: 974 [2022-11-22 02:49:33,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2063 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=726, Invalid=6243, Unknown=3, NotChecked=0, Total=6972 [2022-11-22 02:49:33,532 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 1267 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:49:33,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 1406 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-22 02:49:33,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2022-11-22 02:49:33,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 502. [2022-11-22 02:49:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 428 states have (on average 1.5257009345794392) internal successors, (653), 473 states have internal predecessors, (653), 22 states have call successors, (22), 11 states have call predecessors, (22), 11 states have return successors, (22), 17 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-22 02:49:33,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 697 transitions. [2022-11-22 02:49:33,548 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 697 transitions. Word has length 37 [2022-11-22 02:49:33,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:49:33,548 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 697 transitions. [2022-11-22 02:49:33,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:49:33,548 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 697 transitions. [2022-11-22 02:49:33,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-22 02:49:33,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:49:33,549 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, 1, 1] [2022-11-22 02:49:33,555 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-22 02:49:33,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-22 02:49:33,755 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:49:33,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:49:33,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1033911250, now seen corresponding path program 1 times [2022-11-22 02:49:33,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:49:33,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226129505] [2022-11-22 02:49:33,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:49:33,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:49:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:49:34,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 02:49:34,605 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:49:34,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226129505] [2022-11-22 02:49:34,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226129505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:49:34,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:49:34,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-22 02:49:34,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516454676] [2022-11-22 02:49:34,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:49:34,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 02:49:34,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:49:34,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 02:49:34,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-22 02:49:34,607 INFO L87 Difference]: Start difference. First operand 502 states and 697 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:49:35,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:49:35,848 INFO L93 Difference]: Finished difference Result 997 states and 1340 transitions. [2022-11-22 02:49:35,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-22 02:49:35,849 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-11-22 02:49:35,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:49:35,852 INFO L225 Difference]: With dead ends: 997 [2022-11-22 02:49:35,852 INFO L226 Difference]: Without dead ends: 997 [2022-11-22 02:49:35,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2022-11-22 02:49:35,853 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 882 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:49:35,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 881 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 02:49:35,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2022-11-22 02:49:35,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 484. [2022-11-22 02:49:35,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 410 states have (on average 1.5097560975609756) internal successors, (619), 455 states have internal predecessors, (619), 22 states have call successors, (22), 11 states have call predecessors, (22), 11 states have return successors, (22), 17 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-22 02:49:35,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 663 transitions. [2022-11-22 02:49:35,867 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 663 transitions. Word has length 38 [2022-11-22 02:49:35,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:49:35,868 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 663 transitions. [2022-11-22 02:49:35,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:49:35,868 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 663 transitions. [2022-11-22 02:49:35,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-22 02:49:35,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:49:35,869 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:49:35,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-22 02:49:35,869 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:49:35,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:49:35,870 INFO L85 PathProgramCache]: Analyzing trace with hash -263686266, now seen corresponding path program 1 times [2022-11-22 02:49:35,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:49:35,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74552759] [2022-11-22 02:49:35,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:49:35,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:49:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:49:35,949 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-22 02:49:35,949 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:49:35,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74552759] [2022-11-22 02:49:35,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74552759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:49:35,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:49:35,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:49:35,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177847311] [2022-11-22 02:49:35,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:49:35,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:49:35,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:49:35,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:49:35,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:49:35,951 INFO L87 Difference]: Start difference. First operand 484 states and 663 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:49:36,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:49:36,192 INFO L93 Difference]: Finished difference Result 591 states and 802 transitions. [2022-11-22 02:49:36,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:49:36,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-11-22 02:49:36,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:49:36,196 INFO L225 Difference]: With dead ends: 591 [2022-11-22 02:49:36,196 INFO L226 Difference]: Without dead ends: 591 [2022-11-22 02:49:36,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-22 02:49:36,197 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 112 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:49:36,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 309 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:49:36,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-11-22 02:49:36,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 485. [2022-11-22 02:49:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 411 states have (on average 1.508515815085158) internal successors, (620), 456 states have internal predecessors, (620), 22 states have call successors, (22), 11 states have call predecessors, (22), 11 states have return successors, (22), 17 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-22 02:49:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 664 transitions. [2022-11-22 02:49:36,208 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 664 transitions. Word has length 39 [2022-11-22 02:49:36,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:49:36,208 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 664 transitions. [2022-11-22 02:49:36,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:49:36,208 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 664 transitions. [2022-11-22 02:49:36,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-22 02:49:36,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:49:36,209 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:49:36,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-22 02:49:36,209 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:49:36,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:49:36,210 INFO L85 PathProgramCache]: Analyzing trace with hash -263686265, now seen corresponding path program 1 times [2022-11-22 02:49:36,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:49:36,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446795822] [2022-11-22 02:49:36,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:49:36,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:49:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:49:36,347 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-22 02:49:36,347 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:49:36,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446795822] [2022-11-22 02:49:36,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446795822] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:49:36,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:49:36,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:49:36,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356417266] [2022-11-22 02:49:36,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:49:36,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:49:36,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:49:36,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:49:36,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:49:36,349 INFO L87 Difference]: Start difference. First operand 485 states and 664 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:49:36,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:49:36,594 INFO L93 Difference]: Finished difference Result 481 states and 651 transitions. [2022-11-22 02:49:36,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:49:36,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-11-22 02:49:36,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:49:36,596 INFO L225 Difference]: With dead ends: 481 [2022-11-22 02:49:36,596 INFO L226 Difference]: Without dead ends: 481 [2022-11-22 02:49:36,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:49:36,597 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 115 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:49:36,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 278 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:49:36,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-11-22 02:49:36,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 475. [2022-11-22 02:49:36,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 405 states have (on average 1.471604938271605) internal successors, (596), 446 states have internal predecessors, (596), 22 states have call successors, (22), 11 states have call predecessors, (22), 11 states have return successors, (22), 17 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-22 02:49:36,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 640 transitions. [2022-11-22 02:49:36,606 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 640 transitions. Word has length 39 [2022-11-22 02:49:36,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:49:36,607 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 640 transitions. [2022-11-22 02:49:36,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:49:36,607 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 640 transitions. [2022-11-22 02:49:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-22 02:49:36,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:49:36,608 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] [2022-11-22 02:49:36,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-22 02:49:36,608 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:49:36,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:49:36,608 INFO L85 PathProgramCache]: Analyzing trace with hash -362869264, now seen corresponding path program 1 times [2022-11-22 02:49:36,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:49:36,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277943717] [2022-11-22 02:49:36,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:49:36,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:49:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:49:40,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:49:40,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:49:40,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277943717] [2022-11-22 02:49:40,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277943717] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:49:40,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669851440] [2022-11-22 02:49:40,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:49:40,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:49:40,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:49:40,483 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:49:40,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 02:49:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:49:40,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 107 conjunts are in the unsatisfiable core [2022-11-22 02:49:40,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:49:40,880 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:49:40,881 INFO L350 Elim1Store]: Elim1 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-22 02:49:41,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:49:41,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:49:41,726 INFO L350 Elim1Store]: Elim1 eliminated variable 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 25 treesize of output 24 [2022-11-22 02:49:41,737 INFO L350 Elim1Store]: Elim1 eliminated variable 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 25 treesize of output 24 [2022-11-22 02:49:42,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:42,083 INFO L321 Elim1Store]: treesize reduction 46, result has 30.3 percent of original size [2022-11-22 02:49:42,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 135 [2022-11-22 02:49:42,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:42,110 INFO L321 Elim1Store]: treesize reduction 46, result has 30.3 percent of original size [2022-11-22 02:49:42,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 135 [2022-11-22 02:49:43,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:43,088 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:43,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:43,109 INFO L321 Elim1Store]: treesize reduction 47, result has 34.7 percent of original size [2022-11-22 02:49:43,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 117 [2022-11-22 02:49:43,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:43,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:43,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 149 [2022-11-22 02:49:44,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:44,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:44,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:44,137 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:49:44,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 53 [2022-11-22 02:49:44,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:44,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:44,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:44,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:49:44,151 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:49:44,186 INFO L321 Elim1Store]: treesize reduction 56, result has 37.1 percent of original size [2022-11-22 02:49:44,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 97 treesize of output 72 [2022-11-22 02:49:44,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:49:44,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:49:53,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:49:53,707 INFO L350 Elim1Store]: Elim1 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 1913 treesize of output 1644 [2022-11-22 02:49:53,768 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:49:53,769 INFO L350 Elim1Store]: Elim1 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 1674 treesize of output 1320 [2022-11-22 02:49:54,721 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (* ~unnamed2~0~ITEM_NEXT 4)) (.cse56 (* ~unnamed1~0~LIST_BEG 4)) (.cse23 (* ~unnamed2~0~ITEM_PREV 4))) (let ((.cse21 (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_END 4))) (.cse1 (+ |c_ULTIMATE.start_create_item_~item~0#1.offset| .cse23)) (.cse9 (+ |c_~#list~0.offset| .cse56)) (.cse4 (+ .cse10 |c_ULTIMATE.start_append_one_~list#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_create_item_~item~0#1.offset| (* |c_ULTIMATE.start_create_item_~term_field~0#1| 4))) (.cse3 (+ |c_ULTIMATE.start_append_one_~list#1.offset| .cse56))) (and (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_66 Int) (v_prenex_64 Int)) (let ((.cse0 (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| v_arrayElimArr_5))) (store .cse5 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse5 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| v_prenex_64))))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse1) 0)) (not (= (select v_arrayElimArr_5 .cse2) 0)) (= 0 (select (store (select .cse0 |c_ULTIMATE.start_append_one_~list#1.base|) .cse3 v_prenex_66) .cse4))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_65 Int)) (let ((.cse6 (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_arrayElimArr_6))) (store .cse11 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse11 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|)))) (.cse7 (+ v_prenex_65 .cse10))) (or (not (= (select (select .cse6 |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse1) 0)) (<= .cse7 3) (<= 5 .cse7) (= (select (let ((.cse8 (store .cse6 |c_ULTIMATE.start_append_one_~list#1.base| (store (select .cse6 |c_ULTIMATE.start_append_one_~list#1.base|) .cse3 |c_ULTIMATE.start_create_item_~item~0#1.base|)))) (select .cse8 (select (select .cse8 |c_~#list~0.base|) .cse9))) .cse7) 0) (not (= (select v_arrayElimArr_6 .cse2) 0)))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 .cse2) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse12 (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_arrayElimArr_6))) (store .cse17 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse17 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|))))) (or (not (= (select (select .cse12 |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse1) 0)) (forall ((v_prenex_63 Int) (v_prenex_62 Int) (v_prenex_61 Int)) (let ((.cse13 (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| v_arrayElimArr_5))) (store .cse16 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse16 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| v_prenex_61))))) (let ((.cse14 (store (select .cse13 |c_ULTIMATE.start_append_one_~list#1.base|) .cse3 v_prenex_63)) (.cse15 (+ v_prenex_62 .cse10))) (or (= (select (select (store .cse13 |c_ULTIMATE.start_append_one_~list#1.base| .cse14) (select (select (store .cse12 |c_ULTIMATE.start_append_one_~list#1.base| (store (select .cse12 |c_ULTIMATE.start_append_one_~list#1.base|) .cse3 |c_ULTIMATE.start_create_item_~item~0#1.base|)) |c_~#list~0.base|) .cse9)) .cse15) 0) (= (select .cse14 .cse4) 0) (not (= (select (select .cse13 |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse1) 0)) (<= 5 .cse15) (<= .cse15 3))))) (not (= (select v_arrayElimArr_6 .cse2) 0))))))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_58 Int) (v_prenex_60 Int)) (let ((.cse18 (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| v_arrayElimArr_5))) (store .cse19 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse19 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| v_prenex_58))))) (or (not (= (select v_arrayElimArr_5 .cse2) 0)) (not (= (select (select .cse18 |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse1) 0)) (= (select (store (select .cse18 |c_ULTIMATE.start_append_one_~list#1.base|) .cse3 v_prenex_60) .cse4) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_59 Int)) (let ((.cse22 (let ((.cse25 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_arrayElimArr_6))) (store .cse25 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse25 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|)))) (.cse24 (+ v_prenex_59 .cse10))) (or (= (select (let ((.cse20 (store .cse22 |c_ULTIMATE.start_append_one_~list#1.base| (store (select .cse22 |c_ULTIMATE.start_append_one_~list#1.base|) .cse3 |c_ULTIMATE.start_create_item_~item~0#1.base|)))) (select .cse20 (select (select .cse20 |c_~#list~0.base|) .cse21))) (+ .cse23 v_prenex_59)) 0) (<= .cse24 3) (not (= (select (select .cse22 |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse1) 0)) (not (= (select v_arrayElimArr_6 .cse2) 0)) (<= 5 .cse24))))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_57 Int)) (let ((.cse28 (let ((.cse30 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_arrayElimArr_6))) (store .cse30 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse30 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|))))) (let ((.cse26 (+ v_prenex_57 .cse10)) (.cse29 (store (select .cse28 |c_ULTIMATE.start_append_one_~list#1.base|) .cse3 |c_ULTIMATE.start_create_item_~item~0#1.base|))) (or (<= 5 .cse26) (= (select (let ((.cse27 (store .cse28 |c_ULTIMATE.start_append_one_~list#1.base| .cse29))) (select .cse27 (select (select .cse27 |c_~#list~0.base|) .cse21))) (+ .cse23 v_prenex_57)) 0) (<= .cse26 3) (not (= (select (select .cse28 |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse1) 0)) (= (select .cse29 .cse4) 0) (not (= (select v_arrayElimArr_6 .cse2) 0)))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_56 Int)) (or (not (= (select (select (let ((.cse31 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| v_arrayElimArr_5))) (store .cse31 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse31 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| v_prenex_56))) |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse1) 0)) (not (= (select v_arrayElimArr_5 .cse2) 0))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 .cse2) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse34 (let ((.cse37 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_arrayElimArr_6))) (store .cse37 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse37 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|))))) (let ((.cse35 (store (select .cse34 |c_ULTIMATE.start_append_one_~list#1.base|) .cse3 |c_ULTIMATE.start_create_item_~item~0#1.base|))) (or (forall ((v_ArrVal_828 Int) (|ULTIMATE.start_main_~cursor~1#1.offset| Int) (v_ArrVal_832 Int)) (let ((.cse32 (+ .cse10 |ULTIMATE.start_main_~cursor~1#1.offset|)) (.cse33 (let ((.cse36 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| v_arrayElimArr_5))) (store .cse36 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse36 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| v_ArrVal_828))))) (or (<= .cse32 3) (= (select (select (store .cse33 |c_ULTIMATE.start_append_one_~list#1.base| (store (select .cse33 |c_ULTIMATE.start_append_one_~list#1.base|) .cse3 v_ArrVal_832)) (select (select (store .cse34 |c_ULTIMATE.start_append_one_~list#1.base| .cse35) |c_~#list~0.base|) .cse21)) (+ .cse23 |ULTIMATE.start_main_~cursor~1#1.offset|)) 0) (<= 5 .cse32) (not (= (select (select .cse33 |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse1) 0))))) (not (= (select (select .cse34 |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse1) 0)) (= (select .cse35 .cse4) 0) (not (= (select v_arrayElimArr_6 .cse2) 0)))))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse40 (let ((.cse43 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_arrayElimArr_6))) (store .cse43 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse43 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|))))) (or (forall ((v_prenex_67 Int) (v_prenex_69 Int) (v_prenex_68 Int)) (let ((.cse38 (let ((.cse42 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| v_arrayElimArr_5))) (store .cse42 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse42 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| v_prenex_67))))) (let ((.cse39 (store (select .cse38 |c_ULTIMATE.start_append_one_~list#1.base|) .cse3 v_prenex_69)) (.cse41 (+ v_prenex_68 .cse10))) (or (= (select (select (store .cse38 |c_ULTIMATE.start_append_one_~list#1.base| .cse39) (select (select (store .cse40 |c_ULTIMATE.start_append_one_~list#1.base| (store (select .cse40 |c_ULTIMATE.start_append_one_~list#1.base|) .cse3 |c_ULTIMATE.start_create_item_~item~0#1.base|)) |c_~#list~0.base|) .cse21)) (+ .cse23 v_prenex_68)) 0) (not (= (select (select .cse38 |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse1) 0)) (= (select .cse39 .cse4) 0) (<= .cse41 3) (<= 5 .cse41))))) (not (= (select (select .cse40 |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse1) 0)) (not (= (select v_arrayElimArr_6 .cse2) 0))))) (not (= (select v_arrayElimArr_5 .cse2) 0)))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_55 Int)) (let ((.cse44 (let ((.cse48 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_arrayElimArr_6))) (store .cse48 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse48 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|))))) (let ((.cse46 (store (select .cse44 |c_ULTIMATE.start_append_one_~list#1.base|) .cse3 |c_ULTIMATE.start_create_item_~item~0#1.base|)) (.cse47 (+ v_prenex_55 .cse10))) (or (not (= (select (select .cse44 |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse1) 0)) (= (select (let ((.cse45 (store .cse44 |c_ULTIMATE.start_append_one_~list#1.base| .cse46))) (select .cse45 (select (select .cse45 |c_~#list~0.base|) .cse9))) .cse47) 0) (= (select .cse46 .cse4) 0) (<= 5 .cse47) (<= .cse47 3) (not (= (select v_arrayElimArr_6 .cse2) 0)))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_54 Int)) (or (not (= (select v_arrayElimArr_5 .cse2) 0)) (not (= (select (select (let ((.cse49 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| v_arrayElimArr_5))) (store .cse49 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse49 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| v_prenex_54))) |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse1) 0))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 .cse2) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse50 (let ((.cse55 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_arrayElimArr_6))) (store .cse55 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse55 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|))))) (let ((.cse53 (store (select .cse50 |c_ULTIMATE.start_append_one_~list#1.base|) .cse3 |c_ULTIMATE.start_create_item_~item~0#1.base|))) (or (not (= (select (select .cse50 |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse1) 0)) (forall ((v_prenex_52 Int) (v_prenex_51 Int) (v_prenex_53 Int)) (let ((.cse52 (let ((.cse54 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| v_arrayElimArr_5))) (store .cse54 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse54 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| v_prenex_51)))) (.cse51 (+ v_prenex_52 .cse10))) (or (<= .cse51 3) (not (= (select (select .cse52 |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse1) 0)) (<= 5 .cse51) (= (select (select (store .cse52 |c_ULTIMATE.start_append_one_~list#1.base| (store (select .cse52 |c_ULTIMATE.start_append_one_~list#1.base|) .cse3 v_prenex_53)) (select (select (store .cse50 |c_ULTIMATE.start_append_one_~list#1.base| .cse53) |c_~#list~0.base|) .cse9)) .cse51) 0)))) (= (select .cse53 .cse4) 0) (not (= (select v_arrayElimArr_6 .cse2) 0))))))))))) is different from false [2022-11-22 02:50:01,465 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (* ~unnamed2~0~ITEM_NEXT 4))) (let ((.cse0 (= ~unnamed1~0~LIST_BEG |c_ULTIMATE.start_main_#t~ret30#1|)) (.cse22 (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_END 4))) (.cse5 (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))) (.cse9 (+ |c_~#list~0.offset| .cse6)) (.cse3 (* ~unnamed2~0~ITEM_PREV 4)) (.cse7 (+ |c_~#list~0.offset| (* 4 |c_ULTIMATE.start_main_#t~ret30#1|)))) (and (or (not .cse0) (and (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_52 Int) (v_prenex_51 Int) (v_prenex_53 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse2 (store (select .cse1 |c_~#list~0.base|) .cse7 v_prenex_51)) (.cse4 (+ v_prenex_52 .cse6))) (or (not (= (select (select (store .cse1 |c_~#list~0.base| .cse2) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (<= .cse4 3) (not (= (select v_arrayElimArr_5 .cse3) 0)) (= (select (select (store .cse1 |c_~#list~0.base| (store .cse2 .cse5 v_prenex_53)) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse4) 0) (<= 5 .cse4))))) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse8 (store (select .cse10 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (not (= (select v_arrayElimArr_6 .cse3) 0)) (= (select (store .cse8 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse9) 0) (not (= (select (select (store .cse10 |c_~#list~0.base| .cse8) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_65 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse12 (store (select .cse11 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|)) (.cse13 (+ v_prenex_65 .cse6))) (or (not (= (select v_arrayElimArr_6 .cse3) 0)) (not (= (select (select (store .cse11 |c_~#list~0.base| .cse12) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (<= .cse13 3) (<= 5 .cse13) (= (select (select (store .cse11 |c_~#list~0.base| (store .cse12 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_32|)) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse13) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_66 Int) (v_prenex_64 Int)) (let ((.cse14 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse15 (store (select .cse14 |c_~#list~0.base|) .cse7 v_prenex_64))) (or (not (= (select v_arrayElimArr_5 .cse3) 0)) (not (= 0 (select (select (store .cse14 |c_~#list~0.base| .cse15) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3))) (= (select (store .cse15 .cse5 v_prenex_66) .cse9) 0))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse18 (store (select .cse17 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (let ((.cse16 (store .cse18 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (not (= (select v_arrayElimArr_6 .cse3) 0)) (= (select .cse16 .cse9) 0) (not (= (select (select (store .cse17 |c_~#list~0.base| .cse18) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (forall ((v_ArrVal_828 Int) (|ULTIMATE.start_main_~cursor~1#1.offset| Int) (v_ArrVal_832 Int)) (let ((.cse20 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse19 (+ .cse6 |ULTIMATE.start_main_~cursor~1#1.offset|)) (.cse21 (store (select .cse20 |c_~#list~0.base|) .cse7 v_ArrVal_828))) (or (<= .cse19 3) (<= 5 .cse19) (not (= (select (select (store .cse20 |c_~#list~0.base| .cse21) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (= (select (select (store .cse20 |c_~#list~0.base| (store .cse21 .cse5 v_ArrVal_832)) (select .cse16 .cse22)) (+ .cse3 |ULTIMATE.start_main_~cursor~1#1.offset|)) 0)))))))))) (not (= (select v_arrayElimArr_5 .cse3) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 .cse3) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse26 (store (select .cse28 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (forall ((v_prenex_67 Int) (v_prenex_69 Int) (v_prenex_68 Int)) (let ((.cse24 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse25 (store (select .cse24 |c_~#list~0.base|) .cse7 v_prenex_67))) (let ((.cse23 (store .cse25 .cse5 v_prenex_69)) (.cse27 (+ v_prenex_68 .cse6))) (or (= (select .cse23 .cse9) 0) (not (= (select (select (store .cse24 |c_~#list~0.base| .cse25) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (= (select (select (store .cse24 |c_~#list~0.base| .cse23) (select (store .cse26 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse22)) (+ .cse3 v_prenex_68)) 0) (<= .cse27 3) (<= 5 .cse27)))))) (not (= (select v_arrayElimArr_6 .cse3) 0)) (not (= (select (select (store .cse28 |c_~#list~0.base| .cse26) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)))))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_55 Int)) (let ((.cse30 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse32 (store (select .cse30 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (let ((.cse29 (store .cse32 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_32|)) (.cse31 (+ v_prenex_55 .cse6))) (or (not (= (select v_arrayElimArr_6 .cse3) 0)) (= (select .cse29 .cse9) 0) (= (select (select (store .cse30 |c_~#list~0.base| .cse29) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse31) 0) (not (= (select (select (store .cse30 |c_~#list~0.base| .cse32) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (<= 5 .cse31) (<= .cse31 3)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_54 Int)) (or (not (= (select (select (let ((.cse33 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (store .cse33 |c_~#list~0.base| (store (select .cse33 |c_~#list~0.base|) .cse7 v_prenex_54))) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (not (= (select v_arrayElimArr_5 .cse3) 0)))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_58 Int) (v_prenex_60 Int)) (let ((.cse34 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse35 (store (select .cse34 |c_~#list~0.base|) .cse7 v_prenex_58))) (or (not (= (select v_arrayElimArr_5 .cse3) 0)) (not (= 0 (select (select (store .cse34 |c_~#list~0.base| .cse35) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3))) (= (select (store .cse35 .cse5 v_prenex_60) .cse9) 0))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_59 Int)) (let ((.cse37 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse36 (+ v_prenex_59 .cse6)) (.cse38 (store (select .cse37 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (<= .cse36 3) (not (= (select v_arrayElimArr_6 .cse3) 0)) (not (= (select (select (store .cse37 |c_~#list~0.base| .cse38) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (<= 5 .cse36) (= (select (let ((.cse39 (store .cse38 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (select (store .cse37 |c_~#list~0.base| .cse39) (select .cse39 .cse22))) (+ .cse3 v_prenex_59)) 0))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse3) 0)) (not (= (select (select (let ((.cse40 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (store .cse40 |c_~#list~0.base| (store (select .cse40 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_63 Int) (v_prenex_62 Int) (v_prenex_61 Int)) (let ((.cse41 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse42 (store (select .cse41 |c_~#list~0.base|) .cse7 v_prenex_61))) (let ((.cse44 (+ v_prenex_62 .cse6)) (.cse43 (store .cse42 .cse5 v_prenex_63))) (or (not (= (select (select (store .cse41 |c_~#list~0.base| .cse42) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (not (= (select v_arrayElimArr_5 .cse3) 0)) (= (select (select (store .cse41 |c_~#list~0.base| .cse43) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse44) 0) (<= 5 .cse44) (<= .cse44 3) (= (select .cse43 .cse9) 0)))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_57 Int)) (let ((.cse47 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse48 (store (select .cse47 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (let ((.cse45 (+ v_prenex_57 .cse6)) (.cse46 (store .cse48 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (<= 5 .cse45) (not (= (select v_arrayElimArr_6 .cse3) 0)) (<= .cse45 3) (= (select .cse46 .cse9) 0) (not (= (select (select (store .cse47 |c_~#list~0.base| .cse48) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (= (select (select (store .cse47 |c_~#list~0.base| .cse46) (select .cse46 .cse22)) (+ .cse3 v_prenex_57)) 0)))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_56 Int)) (or (not (= (select v_arrayElimArr_5 .cse3) 0)) (not (= (select (select (let ((.cse49 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (store .cse49 |c_~#list~0.base| (store (select .cse49 |c_~#list~0.base|) .cse7 v_prenex_56))) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)))))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse51 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse52 (store (select .cse51 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (let ((.cse50 (store .cse52 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (not (= (select v_arrayElimArr_6 .cse6) 0)) (= (select .cse50 .cse9) 0) (not (= (select (select (store .cse51 |c_~#list~0.base| .cse52) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (forall ((v_ArrVal_828 Int) (|ULTIMATE.start_main_~cursor~1#1.offset| Int) (v_ArrVal_832 Int)) (let ((.cse54 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse53 (+ .cse6 |ULTIMATE.start_main_~cursor~1#1.offset|)) (.cse55 (store (select .cse54 |c_~#list~0.base|) .cse7 v_ArrVal_828))) (or (<= .cse53 3) (<= 5 .cse53) (not (= (select (select (store .cse54 |c_~#list~0.base| .cse55) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (= (select (select (store .cse54 |c_~#list~0.base| (store .cse55 .cse5 v_ArrVal_832)) (select .cse50 .cse22)) (+ .cse3 |ULTIMATE.start_main_~cursor~1#1.offset|)) 0)))))))))) (not (= (select v_arrayElimArr_5 .cse6) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)))) (or (and (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int) (|v_ULTIMATE.start_create_item_~term_field~0#1_88| Int)) (let ((.cse56 (* 4 |v_ULTIMATE.start_create_item_~term_field~0#1_88|))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_66 Int) (v_prenex_64 Int)) (let ((.cse57 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse58 (store (select .cse57 |c_~#list~0.base|) .cse7 v_prenex_64))) (or (not (= (select v_arrayElimArr_5 .cse56) 0)) (not (= 0 (select (select (store .cse57 |c_~#list~0.base| .cse58) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3))) (= (select (store .cse58 .cse5 v_prenex_66) .cse9) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_65 Int)) (let ((.cse59 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse60 (store (select .cse59 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|)) (.cse61 (+ v_prenex_65 .cse6))) (or (not (= (select (select (store .cse59 |c_~#list~0.base| .cse60) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (<= .cse61 3) (<= 5 .cse61) (= (select (select (store .cse59 |c_~#list~0.base| (store .cse60 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_32|)) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse61) 0) (not (= (select v_arrayElimArr_6 .cse56) 0))))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int) (|v_ULTIMATE.start_create_item_~term_field~0#1_88| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse62 (* 4 |v_ULTIMATE.start_create_item_~term_field~0#1_88|))) (or (not (= (select v_arrayElimArr_5 .cse62) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse64 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse65 (store (select .cse64 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (let ((.cse63 (store .cse65 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (= (select .cse63 .cse9) 0) (not (= (select (select (store .cse64 |c_~#list~0.base| .cse65) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (forall ((v_ArrVal_828 Int) (|ULTIMATE.start_main_~cursor~1#1.offset| Int) (v_ArrVal_832 Int)) (let ((.cse67 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse66 (+ .cse6 |ULTIMATE.start_main_~cursor~1#1.offset|)) (.cse68 (store (select .cse67 |c_~#list~0.base|) .cse7 v_ArrVal_828))) (or (<= .cse66 3) (<= 5 .cse66) (not (= (select (select (store .cse67 |c_~#list~0.base| .cse68) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (= (select (select (store .cse67 |c_~#list~0.base| (store .cse68 .cse5 v_ArrVal_832)) (select .cse63 .cse22)) (+ .cse3 |ULTIMATE.start_main_~cursor~1#1.offset|)) 0))))) (not (= (select v_arrayElimArr_6 .cse62) 0)))))))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int) (|v_ULTIMATE.start_create_item_~term_field~0#1_88| Int)) (let ((.cse70 (* 4 |v_ULTIMATE.start_create_item_~term_field~0#1_88|))) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select (select (let ((.cse69 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (store .cse69 |c_~#list~0.base| (store (select .cse69 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (not (= (select v_arrayElimArr_6 .cse70) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_63 Int) (v_prenex_62 Int) (v_prenex_61 Int)) (let ((.cse71 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse72 (store (select .cse71 |c_~#list~0.base|) .cse7 v_prenex_61))) (let ((.cse74 (+ v_prenex_62 .cse6)) (.cse73 (store .cse72 .cse5 v_prenex_63))) (or (not (= (select (select (store .cse71 |c_~#list~0.base| .cse72) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (not (= (select v_arrayElimArr_5 .cse70) 0)) (= (select (select (store .cse71 |c_~#list~0.base| .cse73) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse74) 0) (<= 5 .cse74) (<= .cse74 3) (= (select .cse73 .cse9) 0))))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int) (|v_ULTIMATE.start_create_item_~term_field~0#1_88| Int)) (let ((.cse76 (* 4 |v_ULTIMATE.start_create_item_~term_field~0#1_88|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_54 Int)) (or (not (= (select (select (let ((.cse75 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (store .cse75 |c_~#list~0.base| (store (select .cse75 |c_~#list~0.base|) .cse7 v_prenex_54))) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (not (= (select v_arrayElimArr_5 .cse76) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_55 Int)) (let ((.cse78 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse80 (store (select .cse78 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (let ((.cse77 (store .cse80 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_32|)) (.cse79 (+ v_prenex_55 .cse6))) (or (= (select .cse77 .cse9) 0) (= (select (select (store .cse78 |c_~#list~0.base| .cse77) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse79) 0) (not (= (select (select (store .cse78 |c_~#list~0.base| .cse80) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (<= 5 .cse79) (<= .cse79 3) (not (= (select v_arrayElimArr_6 .cse76) 0)))))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int) (|v_ULTIMATE.start_create_item_~term_field~0#1_88| Int)) (let ((.cse85 (* 4 |v_ULTIMATE.start_create_item_~term_field~0#1_88|))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_59 Int)) (let ((.cse82 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse81 (+ v_prenex_59 .cse6)) (.cse83 (store (select .cse82 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (<= .cse81 3) (not (= (select (select (store .cse82 |c_~#list~0.base| .cse83) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (<= 5 .cse81) (= (select (let ((.cse84 (store .cse83 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (select (store .cse82 |c_~#list~0.base| .cse84) (select .cse84 .cse22))) (+ .cse3 v_prenex_59)) 0) (not (= (select v_arrayElimArr_6 .cse85) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_58 Int) (v_prenex_60 Int)) (let ((.cse86 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse87 (store (select .cse86 |c_~#list~0.base|) .cse7 v_prenex_58))) (or (not (= (select v_arrayElimArr_5 .cse85) 0)) (not (= 0 (select (select (store .cse86 |c_~#list~0.base| .cse87) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3))) (= (select (store .cse87 .cse5 v_prenex_60) .cse9) 0)))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int) (|v_ULTIMATE.start_create_item_~term_field~0#1_88| Int)) (let ((.cse92 (* 4 |v_ULTIMATE.start_create_item_~term_field~0#1_88|))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_57 Int)) (let ((.cse90 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse91 (store (select .cse90 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (let ((.cse88 (+ v_prenex_57 .cse6)) (.cse89 (store .cse91 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (<= 5 .cse88) (<= .cse88 3) (= (select .cse89 .cse9) 0) (not (= (select (select (store .cse90 |c_~#list~0.base| .cse91) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (= (select (select (store .cse90 |c_~#list~0.base| .cse89) (select .cse89 .cse22)) (+ .cse3 v_prenex_57)) 0) (not (= (select v_arrayElimArr_6 .cse92) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_56 Int)) (or (not (= (select v_arrayElimArr_5 .cse92) 0)) (not (= (select (select (let ((.cse93 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (store .cse93 |c_~#list~0.base| (store (select .cse93 |c_~#list~0.base|) .cse7 v_prenex_56))) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int) (|v_ULTIMATE.start_create_item_~term_field~0#1_88| Int)) (let ((.cse96 (* 4 |v_ULTIMATE.start_create_item_~term_field~0#1_88|))) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse95 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse94 (store (select .cse95 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (= (select (store .cse94 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse9) 0) (not (= (select (select (store .cse95 |c_~#list~0.base| .cse94) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (not (= (select v_arrayElimArr_6 .cse96) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_52 Int) (v_prenex_51 Int) (v_prenex_53 Int)) (let ((.cse97 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse98 (store (select .cse97 |c_~#list~0.base|) .cse7 v_prenex_51)) (.cse99 (+ v_prenex_52 .cse6))) (or (not (= (select (select (store .cse97 |c_~#list~0.base| .cse98) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (<= .cse99 3) (not (= (select v_arrayElimArr_5 .cse96) 0)) (= (select (select (store .cse97 |c_~#list~0.base| (store .cse98 .cse5 v_prenex_53)) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse99) 0) (<= 5 .cse99)))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int) (|v_ULTIMATE.start_create_item_~term_field~0#1_88| Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse100 (* 4 |v_ULTIMATE.start_create_item_~term_field~0#1_88|))) (or (not (= (select v_arrayElimArr_5 .cse100) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse106 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse104 (store (select .cse106 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (forall ((v_prenex_67 Int) (v_prenex_69 Int) (v_prenex_68 Int)) (let ((.cse102 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse103 (store (select .cse102 |c_~#list~0.base|) .cse7 v_prenex_67))) (let ((.cse101 (store .cse103 .cse5 v_prenex_69)) (.cse105 (+ v_prenex_68 .cse6))) (or (= (select .cse101 .cse9) 0) (not (= (select (select (store .cse102 |c_~#list~0.base| .cse103) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (= (select (select (store .cse102 |c_~#list~0.base| .cse101) (select (store .cse104 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse22)) (+ .cse3 v_prenex_68)) 0) (<= .cse105 3) (<= 5 .cse105)))))) (not (= (select (select (store .cse106 |c_~#list~0.base| .cse104) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (not (= (select v_arrayElimArr_6 .cse100) 0))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0))))) (= ~unnamed1~0~LIST_END |c_ULTIMATE.start_main_#t~ret30#1|)) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 .cse6) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse112 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse110 (store (select .cse112 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (forall ((v_prenex_67 Int) (v_prenex_69 Int) (v_prenex_68 Int)) (let ((.cse108 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse109 (store (select .cse108 |c_~#list~0.base|) .cse7 v_prenex_67))) (let ((.cse107 (store .cse109 .cse5 v_prenex_69)) (.cse111 (+ v_prenex_68 .cse6))) (or (= (select .cse107 .cse9) 0) (not (= (select (select (store .cse108 |c_~#list~0.base| .cse109) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (= (select (select (store .cse108 |c_~#list~0.base| .cse107) (select (store .cse110 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse22)) (+ .cse3 v_prenex_68)) 0) (<= .cse111 3) (<= 5 .cse111)))))) (not (= (select v_arrayElimArr_6 .cse6) 0)) (not (= (select (select (store .cse112 |c_~#list~0.base| .cse110) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)))))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_65 Int)) (let ((.cse113 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse114 (store (select .cse113 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|)) (.cse115 (+ v_prenex_65 .cse6))) (or (not (= (select v_arrayElimArr_6 .cse6) 0)) (not (= (select (select (store .cse113 |c_~#list~0.base| .cse114) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (<= .cse115 3) (<= 5 .cse115) (= (select (select (store .cse113 |c_~#list~0.base| (store .cse114 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_32|)) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse115) 0))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_66 Int) (v_prenex_64 Int)) (let ((.cse116 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse117 (store (select .cse116 |c_~#list~0.base|) .cse7 v_prenex_64))) (or (not (= 0 (select (select (store .cse116 |c_~#list~0.base| .cse117) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3))) (not (= (select v_arrayElimArr_5 .cse6) 0)) (= (select (store .cse117 .cse5 v_prenex_66) .cse9) 0))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_58 Int) (v_prenex_60 Int)) (let ((.cse118 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse119 (store (select .cse118 |c_~#list~0.base|) .cse7 v_prenex_58))) (or (not (= 0 (select (select (store .cse118 |c_~#list~0.base| .cse119) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3))) (not (= (select v_arrayElimArr_5 .cse6) 0)) (= (select (store .cse119 .cse5 v_prenex_60) .cse9) 0))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_59 Int)) (let ((.cse121 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse120 (+ v_prenex_59 .cse6)) (.cse122 (store (select .cse121 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (not (= (select v_arrayElimArr_6 .cse6) 0)) (<= .cse120 3) (not (= (select (select (store .cse121 |c_~#list~0.base| .cse122) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (<= 5 .cse120) (= (select (let ((.cse123 (store .cse122 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (select (store .cse121 |c_~#list~0.base| .cse123) (select .cse123 .cse22))) (+ .cse3 v_prenex_59)) 0))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_54 Int)) (or (not (= (select (select (let ((.cse124 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (store .cse124 |c_~#list~0.base| (store (select .cse124 |c_~#list~0.base|) .cse7 v_prenex_54))) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (not (= (select v_arrayElimArr_5 .cse6) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_55 Int)) (let ((.cse126 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse128 (store (select .cse126 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (let ((.cse125 (store .cse128 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_32|)) (.cse127 (+ v_prenex_55 .cse6))) (or (not (= (select v_arrayElimArr_6 .cse6) 0)) (= (select .cse125 .cse9) 0) (= (select (select (store .cse126 |c_~#list~0.base| .cse125) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse127) 0) (not (= (select (select (store .cse126 |c_~#list~0.base| .cse128) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (<= 5 .cse127) (<= .cse127 3)))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_56 Int)) (or (not (= (select v_arrayElimArr_5 .cse6) 0)) (not (= (select (select (let ((.cse129 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (store .cse129 |c_~#list~0.base| (store (select .cse129 |c_~#list~0.base|) .cse7 v_prenex_56))) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_57 Int)) (let ((.cse132 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse133 (store (select .cse132 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (let ((.cse130 (+ v_prenex_57 .cse6)) (.cse131 (store .cse133 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (<= 5 .cse130) (not (= (select v_arrayElimArr_6 .cse6) 0)) (<= .cse130 3) (= (select .cse131 .cse9) 0) (not (= (select (select (store .cse132 |c_~#list~0.base| .cse133) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (= (select (select (store .cse132 |c_~#list~0.base| .cse131) (select .cse131 .cse22)) (+ .cse3 v_prenex_57)) 0)))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse6) 0)) (not (= (select (select (let ((.cse134 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (store .cse134 |c_~#list~0.base| (store (select .cse134 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_63 Int) (v_prenex_62 Int) (v_prenex_61 Int)) (let ((.cse135 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse136 (store (select .cse135 |c_~#list~0.base|) .cse7 v_prenex_61))) (let ((.cse138 (+ v_prenex_62 .cse6)) (.cse137 (store .cse136 .cse5 v_prenex_63))) (or (not (= (select (select (store .cse135 |c_~#list~0.base| .cse136) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (= (select (select (store .cse135 |c_~#list~0.base| .cse137) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse138) 0) (not (= (select v_arrayElimArr_5 .cse6) 0)) (<= 5 .cse138) (<= .cse138 3) (= (select .cse137 .cse9) 0)))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_52 Int) (v_prenex_51 Int) (v_prenex_53 Int)) (let ((.cse139 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse140 (store (select .cse139 |c_~#list~0.base|) .cse7 v_prenex_51)) (.cse141 (+ v_prenex_52 .cse6))) (or (not (= (select (select (store .cse139 |c_~#list~0.base| .cse140) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (<= .cse141 3) (= (select (select (store .cse139 |c_~#list~0.base| (store .cse140 .cse5 v_prenex_53)) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse141) 0) (<= 5 .cse141) (not (= (select v_arrayElimArr_5 .cse6) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse143 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse142 (store (select .cse143 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (not (= (select v_arrayElimArr_6 .cse6) 0)) (= (select (store .cse142 .cse5 |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse9) 0) (not (= (select (select (store .cse143 |c_~#list~0.base| .cse142) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0))))))))))))) is different from true [2022-11-22 02:50:05,382 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (* ~unnamed2~0~ITEM_NEXT 4))) (let ((.cse5 (+ |c_~#list~0.offset| .cse10)) (.cse8 (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_END 4))) (.cse3 (* ~unnamed2~0~ITEM_PREV 4)) (.cse7 (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4)))) (and (forall ((|v_ULTIMATE.start_main_#t~ret30#1_49| Int)) (or (= ~unnamed1~0~LIST_BEG |v_ULTIMATE.start_main_#t~ret30#1_49|) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int) (|v_ULTIMATE.start_create_item_~term_field~0#1_88| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse0 (* 4 |v_ULTIMATE.start_create_item_~term_field~0#1_88|))) (or (not (= (select v_arrayElimArr_5 .cse0) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6)) (.cse11 (+ |c_~#list~0.offset| (* 4 |v_ULTIMATE.start_main_#t~ret30#1_49|)))) (let ((.cse6 (store (select .cse12 |c_~#list~0.base|) .cse11 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (forall ((v_prenex_67 Int) (v_prenex_69 Int) (v_prenex_68 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse2 (store (select .cse1 |c_~#list~0.base|) .cse11 v_prenex_67))) (let ((.cse4 (store .cse2 .cse7 v_prenex_69)) (.cse9 (+ v_prenex_68 .cse10))) (or (not (= (select (select (store .cse1 |c_~#list~0.base| .cse2) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (= (select .cse4 .cse5) 0) (= (select (select (store .cse1 |c_~#list~0.base| .cse4) (select (store .cse6 .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse8)) (+ .cse3 v_prenex_68)) 0) (<= .cse9 3) (<= 5 .cse9)))))) (not (= (select (select (store .cse12 |c_~#list~0.base| .cse6) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (not (= (select v_arrayElimArr_6 .cse0) 0))))))))))) (= ~unnamed1~0~LIST_END |v_ULTIMATE.start_main_#t~ret30#1_49|))) (forall ((|v_ULTIMATE.start_main_#t~ret30#1_49| Int)) (or (= ~unnamed1~0~LIST_BEG |v_ULTIMATE.start_main_#t~ret30#1_49|) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (let ((.cse17 (+ |c_~#list~0.offset| (* 4 |v_ULTIMATE.start_main_#t~ret30#1_49|)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_55 Int)) (let ((.cse15 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse16 (store (select .cse15 |c_~#list~0.base|) .cse17 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (let ((.cse13 (store .cse16 .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|)) (.cse14 (+ v_prenex_55 .cse10))) (or (not (= (select v_arrayElimArr_6 .cse10) 0)) (= (select .cse13 .cse5) 0) (<= 5 .cse14) (<= .cse14 3) (= (select (select (store .cse15 |c_~#list~0.base| .cse13) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse14) 0) (not (= (select (select (store .cse15 |c_~#list~0.base| .cse16) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0))))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_54 Int)) (or (not (= (select v_arrayElimArr_5 .cse10) 0)) (not (= (select (select (let ((.cse18 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (store .cse18 |c_~#list~0.base| (store (select .cse18 |c_~#list~0.base|) .cse17 v_prenex_54))) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0))))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse19 (store (select .cse20 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (not (= (select v_arrayElimArr_6 .cse3) 0)) (= (select .cse19 .cse5) 0) (not (= (select (select (store .cse20 |c_~#list~0.base| .cse19) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_52 Int) (v_prenex_51 Int) (v_prenex_53 Int)) (let ((.cse22 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse21 (+ v_prenex_52 .cse10)) (.cse23 (select .cse22 |c_~#list~0.base|))) (or (<= .cse21 3) (= (select (select (store .cse22 |c_~#list~0.base| (store .cse23 .cse7 v_prenex_53)) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse21) 0) (not (= (select v_arrayElimArr_5 .cse3) 0)) (<= 5 .cse21) (not (= (select (select (store .cse22 |c_~#list~0.base| (store .cse23 .cse7 v_prenex_51)) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse25 (select .cse24 |c_~#list~0.base|))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (|ULTIMATE.start_main_~cursor~1#1.offset| Int) (v_ArrVal_832 Int)) (let ((.cse28 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse27 (+ .cse10 |ULTIMATE.start_main_~cursor~1#1.offset|)) (.cse26 (store (select .cse28 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (= (select (select (store .cse24 |c_~#list~0.base| (store .cse25 .cse7 v_ArrVal_832)) (select .cse26 .cse8)) (+ .cse3 |ULTIMATE.start_main_~cursor~1#1.offset|)) 0) (not (= (select v_arrayElimArr_6 .cse3) 0)) (<= .cse27 3) (<= 5 .cse27) (= (select .cse26 .cse5) 0) (not (= (select (select (store .cse28 |c_~#list~0.base| .cse26) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)))))) (forall ((v_ArrVal_828 Int)) (not (= (select (select (store .cse24 |c_~#list~0.base| (store .cse25 .cse7 v_ArrVal_828)) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0))) (not (= (select v_arrayElimArr_5 .cse3) 0)))))))) (forall ((|v_ULTIMATE.start_main_#t~ret30#1_49| Int)) (or (= ~unnamed1~0~LIST_BEG |v_ULTIMATE.start_main_#t~ret30#1_49|) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6)) (.cse34 (+ |c_~#list~0.offset| (* 4 |v_ULTIMATE.start_main_#t~ret30#1_49|)))) (let ((.cse32 (store (select .cse35 |c_~#list~0.base|) .cse34 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (not (= (select v_arrayElimArr_6 .cse10) 0)) (forall ((v_prenex_67 Int) (v_prenex_69 Int) (v_prenex_68 Int)) (let ((.cse29 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse30 (store (select .cse29 |c_~#list~0.base|) .cse34 v_prenex_67))) (let ((.cse31 (store .cse30 .cse7 v_prenex_69)) (.cse33 (+ v_prenex_68 .cse10))) (or (not (= (select (select (store .cse29 |c_~#list~0.base| .cse30) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (= (select .cse31 .cse5) 0) (= (select (select (store .cse29 |c_~#list~0.base| .cse31) (select (store .cse32 .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse8)) (+ .cse3 v_prenex_68)) 0) (<= .cse33 3) (<= 5 .cse33)))))) (not (= (select (select (store .cse35 |c_~#list~0.base| .cse32) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)))))) (not (= (select v_arrayElimArr_5 .cse10) 0)))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_59 Int)) (let ((.cse39 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse38 (store (select .cse39 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (let ((.cse37 (store .cse39 |c_~#list~0.base| .cse38)) (.cse36 (+ v_prenex_59 .cse10))) (or (<= .cse36 3) (not (= (select v_arrayElimArr_6 .cse3) 0)) (= (select (select .cse37 (select .cse38 .cse8)) (+ .cse3 v_prenex_59)) 0) (not (= (select (select .cse37 |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (<= 5 .cse36)))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_58 Int) (v_prenex_60 Int)) (let ((.cse41 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse40 (select .cse41 |c_~#list~0.base|))) (or (not (= (select v_arrayElimArr_5 .cse3) 0)) (= (select (store .cse40 .cse7 v_prenex_60) .cse5) 0) (not (= (select (select (store .cse41 |c_~#list~0.base| (store .cse40 .cse7 v_prenex_58)) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)))))))) (forall ((|v_ULTIMATE.start_main_#t~ret30#1_49| Int)) (or (= ~unnamed1~0~LIST_BEG |v_ULTIMATE.start_main_#t~ret30#1_49|) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int) (|v_ULTIMATE.start_create_item_~term_field~0#1_88| Int)) (let ((.cse44 (* 4 |v_ULTIMATE.start_create_item_~term_field~0#1_88|)) (.cse43 (+ |c_~#list~0.offset| (* 4 |v_ULTIMATE.start_main_#t~ret30#1_49|)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_56 Int)) (or (not (= (select (select (let ((.cse42 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (store .cse42 |c_~#list~0.base| (store (select .cse42 |c_~#list~0.base|) .cse43 v_prenex_56))) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (not (= (select v_arrayElimArr_5 .cse44) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_57 Int)) (let ((.cse45 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse48 (store (select .cse45 |c_~#list~0.base|) .cse43 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (let ((.cse47 (+ v_prenex_57 .cse10)) (.cse46 (store .cse48 .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (= (select (select (store .cse45 |c_~#list~0.base| .cse46) (select .cse46 .cse8)) (+ .cse3 v_prenex_57)) 0) (<= 5 .cse47) (<= .cse47 3) (= (select .cse46 .cse5) 0) (not (= (select (select (store .cse45 |c_~#list~0.base| .cse48) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (not (= (select v_arrayElimArr_6 .cse44) 0)))))))))) (= ~unnamed1~0~LIST_END |v_ULTIMATE.start_main_#t~ret30#1_49|))) (forall ((|v_ULTIMATE.start_main_#t~ret30#1_49| Int)) (or (= ~unnamed1~0~LIST_BEG |v_ULTIMATE.start_main_#t~ret30#1_49|) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int) (|v_ULTIMATE.start_create_item_~term_field~0#1_88| Int)) (let ((.cse49 (* 4 |v_ULTIMATE.start_create_item_~term_field~0#1_88|)) (.cse51 (+ |c_~#list~0.offset| (* 4 |v_ULTIMATE.start_main_#t~ret30#1_49|)))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_54 Int)) (or (not (= (select v_arrayElimArr_5 .cse49) 0)) (not (= (select (select (let ((.cse50 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (store .cse50 |c_~#list~0.base| (store (select .cse50 |c_~#list~0.base|) .cse51 v_prenex_54))) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_55 Int)) (let ((.cse54 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse55 (store (select .cse54 |c_~#list~0.base|) .cse51 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (let ((.cse52 (store .cse55 .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|)) (.cse53 (+ v_prenex_55 .cse10))) (or (= (select .cse52 .cse5) 0) (<= 5 .cse53) (<= .cse53 3) (= (select (select (store .cse54 |c_~#list~0.base| .cse52) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse53) 0) (not (= (select (select (store .cse54 |c_~#list~0.base| .cse55) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (not (= (select v_arrayElimArr_6 .cse49) 0)))))))))) (= ~unnamed1~0~LIST_END |v_ULTIMATE.start_main_#t~ret30#1_49|))) (forall ((|v_ULTIMATE.start_main_#t~ret30#1_49| Int)) (or (= ~unnamed1~0~LIST_BEG |v_ULTIMATE.start_main_#t~ret30#1_49|) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (let ((.cse60 (+ |c_~#list~0.offset| (* 4 |v_ULTIMATE.start_main_#t~ret30#1_49|)))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_57 Int)) (let ((.cse56 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse59 (store (select .cse56 |c_~#list~0.base|) .cse60 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (let ((.cse58 (+ v_prenex_57 .cse10)) (.cse57 (store .cse59 .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (= (select (select (store .cse56 |c_~#list~0.base| .cse57) (select .cse57 .cse8)) (+ .cse3 v_prenex_57)) 0) (<= 5 .cse58) (not (= (select v_arrayElimArr_6 .cse10) 0)) (<= .cse58 3) (= (select .cse57 .cse5) 0) (not (= (select (select (store .cse56 |c_~#list~0.base| .cse59) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_56 Int)) (or (not (= (select (select (let ((.cse61 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (store .cse61 |c_~#list~0.base| (store (select .cse61 |c_~#list~0.base|) .cse60 v_prenex_56))) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (not (= (select v_arrayElimArr_5 .cse10) 0))))))))) (forall ((|v_ULTIMATE.start_main_#t~ret30#1_49| Int)) (or (= ~unnamed1~0~LIST_BEG |v_ULTIMATE.start_main_#t~ret30#1_49|) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (let ((.cse65 (+ |c_~#list~0.offset| (* 4 |v_ULTIMATE.start_main_#t~ret30#1_49|)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_65 Int)) (let ((.cse62 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse64 (+ v_prenex_65 .cse10)) (.cse63 (store (select .cse62 |c_~#list~0.base|) .cse65 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (= (select (select (store .cse62 |c_~#list~0.base| (store .cse63 .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|)) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse64) 0) (not (= (select v_arrayElimArr_6 .cse10) 0)) (<= .cse64 3) (<= 5 .cse64) (not (= (select (select (store .cse62 |c_~#list~0.base| .cse63) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_66 Int) (v_prenex_64 Int)) (let ((.cse66 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse67 (store (select .cse66 |c_~#list~0.base|) .cse65 v_prenex_64))) (or (not (= (select (select (store .cse66 |c_~#list~0.base| .cse67) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (= (select (store .cse67 .cse7 v_prenex_66) .cse5) 0) (not (= (select v_arrayElimArr_5 .cse10) 0))))))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_56 Int)) (or (not (= (select v_arrayElimArr_5 .cse3) 0)) (not (= (select (select (let ((.cse68 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (store .cse68 |c_~#list~0.base| (store (select .cse68 |c_~#list~0.base|) .cse7 v_prenex_56))) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_57 Int)) (let ((.cse72 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse70 (store (select .cse72 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (let ((.cse71 (+ v_prenex_57 .cse10)) (.cse69 (store .cse72 |c_~#list~0.base| .cse70))) (or (= (select (select .cse69 (select .cse70 .cse8)) (+ .cse3 v_prenex_57)) 0) (<= 5 .cse71) (not (= (select v_arrayElimArr_6 .cse3) 0)) (<= .cse71 3) (= (select .cse70 .cse5) 0) (not (= (select (select .cse69 |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0))))))))) (forall ((|v_ULTIMATE.start_main_#t~ret30#1_49| Int)) (or (= ~unnamed1~0~LIST_BEG |v_ULTIMATE.start_main_#t~ret30#1_49|) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int) (|v_ULTIMATE.start_create_item_~term_field~0#1_88| Int)) (let ((.cse75 (* 4 |v_ULTIMATE.start_create_item_~term_field~0#1_88|)) (.cse76 (+ |c_~#list~0.offset| (* 4 |v_ULTIMATE.start_main_#t~ret30#1_49|)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_66 Int) (v_prenex_64 Int)) (let ((.cse73 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse74 (store (select .cse73 |c_~#list~0.base|) .cse76 v_prenex_64))) (or (not (= (select (select (store .cse73 |c_~#list~0.base| .cse74) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (not (= (select v_arrayElimArr_5 .cse75) 0)) (= (select (store .cse74 .cse7 v_prenex_66) .cse5) 0))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_65 Int)) (let ((.cse77 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse79 (+ v_prenex_65 .cse10)) (.cse78 (store (select .cse77 |c_~#list~0.base|) .cse76 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (= (select (select (store .cse77 |c_~#list~0.base| (store .cse78 .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|)) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse79) 0) (<= .cse79 3) (<= 5 .cse79) (not (= (select (select (store .cse77 |c_~#list~0.base| .cse78) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (not (= (select v_arrayElimArr_6 .cse75) 0))))))))) (= ~unnamed1~0~LIST_END |v_ULTIMATE.start_main_#t~ret30#1_49|))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse80 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse85 (select .cse80 |c_~#list~0.base|))) (or (not (= (select v_arrayElimArr_5 .cse3) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_69 Int) (v_prenex_68 Int)) (let ((.cse83 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse81 (store .cse85 .cse7 v_prenex_69)) (.cse82 (store (select .cse83 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|)) (.cse84 (+ v_prenex_68 .cse10))) (or (not (= (select v_arrayElimArr_6 .cse3) 0)) (= (select (select (store .cse80 |c_~#list~0.base| .cse81) (select .cse82 .cse8)) (+ .cse3 v_prenex_68)) 0) (= (select .cse81 .cse5) 0) (not (= (select (select (store .cse83 |c_~#list~0.base| .cse82) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (<= .cse84 3) (<= 5 .cse84))))) (forall ((v_prenex_67 Int)) (not (= (select (select (store .cse80 |c_~#list~0.base| (store .cse85 .cse7 v_prenex_67)) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0))))))))) (forall ((|v_ULTIMATE.start_main_#t~ret30#1_49| Int)) (or (= ~unnamed1~0~LIST_BEG |v_ULTIMATE.start_main_#t~ret30#1_49|) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int) (|v_ULTIMATE.start_create_item_~term_field~0#1_88| Int)) (let ((.cse88 (* 4 |v_ULTIMATE.start_create_item_~term_field~0#1_88|)) (.cse87 (+ |c_~#list~0.offset| (* 4 |v_ULTIMATE.start_main_#t~ret30#1_49|)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select (select (let ((.cse86 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (store .cse86 |c_~#list~0.base| (store (select .cse86 |c_~#list~0.base|) .cse87 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (not (= (select v_arrayElimArr_6 .cse88) 0)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_63 Int) (v_prenex_62 Int) (v_prenex_61 Int)) (let ((.cse89 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse92 (store (select .cse89 |c_~#list~0.base|) .cse87 v_prenex_61))) (let ((.cse91 (+ v_prenex_62 .cse10)) (.cse90 (store .cse92 .cse7 v_prenex_63))) (or (= (select (select (store .cse89 |c_~#list~0.base| .cse90) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse91) 0) (not (= (select v_arrayElimArr_5 .cse88) 0)) (<= 5 .cse91) (<= .cse91 3) (not (= (select (select (store .cse89 |c_~#list~0.base| .cse92) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (= (select .cse90 .cse5) 0))))))))) (= ~unnamed1~0~LIST_END |v_ULTIMATE.start_main_#t~ret30#1_49|))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_54 Int)) (or (not (= (select (select (let ((.cse93 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (store .cse93 |c_~#list~0.base| (store (select .cse93 |c_~#list~0.base|) .cse7 v_prenex_54))) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (not (= (select v_arrayElimArr_5 .cse3) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_55 Int)) (let ((.cse97 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse95 (store (select .cse97 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (let ((.cse94 (+ v_prenex_55 .cse10)) (.cse96 (select (store .cse97 |c_~#list~0.base| .cse95) |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (not (= (select v_arrayElimArr_6 .cse3) 0)) (<= 5 .cse94) (<= .cse94 3) (= (select .cse95 .cse5) 0) (= (select .cse96 .cse94) 0) (not (= (select .cse96 .cse3) 0))))))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse3) 0)) (not (= (select (select (let ((.cse98 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (store .cse98 |c_~#list~0.base| (store (select .cse98 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_63 Int) (v_prenex_62 Int) (v_prenex_61 Int)) (let ((.cse101 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse102 (select .cse101 |c_~#list~0.base|))) (let ((.cse99 (store .cse102 .cse7 v_prenex_63)) (.cse100 (+ v_prenex_62 .cse10))) (or (not (= (select v_arrayElimArr_5 .cse3) 0)) (= (select .cse99 .cse5) 0) (<= 5 .cse100) (<= .cse100 3) (not (= (select (select (store .cse101 |c_~#list~0.base| (store .cse102 .cse7 v_prenex_61)) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (= (select (select (store .cse101 |c_~#list~0.base| .cse99) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse100) 0)))))))) (forall ((|v_ULTIMATE.start_main_#t~ret30#1_49| Int)) (or (= ~unnamed1~0~LIST_BEG |v_ULTIMATE.start_main_#t~ret30#1_49|) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (let ((.cse105 (+ |c_~#list~0.offset| (* 4 |v_ULTIMATE.start_main_#t~ret30#1_49|)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_58 Int) (v_prenex_60 Int)) (let ((.cse104 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse103 (store (select .cse104 |c_~#list~0.base|) .cse105 v_prenex_58))) (or (= (select (store .cse103 .cse7 v_prenex_60) .cse5) 0) (not (= (select v_arrayElimArr_5 .cse10) 0)) (not (= (select (select (store .cse104 |c_~#list~0.base| .cse103) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_59 Int)) (let ((.cse107 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse106 (+ v_prenex_59 .cse10)) (.cse108 (store (select .cse107 |c_~#list~0.base|) .cse105 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (not (= (select v_arrayElimArr_6 .cse10) 0)) (<= .cse106 3) (not (= (select (select (store .cse107 |c_~#list~0.base| .cse108) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (<= 5 .cse106) (= (select (let ((.cse109 (store .cse108 .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (select (store .cse107 |c_~#list~0.base| .cse109) (select .cse109 .cse8))) (+ .cse3 v_prenex_59)) 0)))))))))) (forall ((|v_ULTIMATE.start_main_#t~ret30#1_49| Int)) (or (= ~unnamed1~0~LIST_BEG |v_ULTIMATE.start_main_#t~ret30#1_49|) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (let ((.cse114 (+ |c_~#list~0.offset| (* 4 |v_ULTIMATE.start_main_#t~ret30#1_49|)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_63 Int) (v_prenex_62 Int) (v_prenex_61 Int)) (let ((.cse110 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse113 (store (select .cse110 |c_~#list~0.base|) .cse114 v_prenex_61))) (let ((.cse112 (+ v_prenex_62 .cse10)) (.cse111 (store .cse113 .cse7 v_prenex_63))) (or (= (select (select (store .cse110 |c_~#list~0.base| .cse111) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse112) 0) (not (= (select v_arrayElimArr_5 .cse10) 0)) (<= 5 .cse112) (<= .cse112 3) (not (= (select (select (store .cse110 |c_~#list~0.base| .cse113) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (= (select .cse111 .cse5) 0)))))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 .cse10) 0)) (not (= (select (select (let ((.cse115 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (store .cse115 |c_~#list~0.base| (store (select .cse115 |c_~#list~0.base|) .cse114 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0))))))))) (forall ((|v_ULTIMATE.start_main_#t~ret30#1_49| Int)) (or (= ~unnamed1~0~LIST_BEG |v_ULTIMATE.start_main_#t~ret30#1_49|) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 .cse10) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse117 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6)) (.cse122 (+ |c_~#list~0.offset| (* 4 |v_ULTIMATE.start_main_#t~ret30#1_49|)))) (let ((.cse118 (store (select .cse117 |c_~#list~0.base|) .cse122 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (let ((.cse116 (store .cse118 .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (not (= (select v_arrayElimArr_6 .cse10) 0)) (= (select .cse116 .cse5) 0) (not (= (select (select (store .cse117 |c_~#list~0.base| .cse118) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (forall ((v_ArrVal_828 Int) (|ULTIMATE.start_main_~cursor~1#1.offset| Int) (v_ArrVal_832 Int)) (let ((.cse119 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse120 (store (select .cse119 |c_~#list~0.base|) .cse122 v_ArrVal_828)) (.cse121 (+ .cse10 |ULTIMATE.start_main_~cursor~1#1.offset|))) (or (not (= (select (select (store .cse119 |c_~#list~0.base| .cse120) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (<= .cse121 3) (= (select (select (store .cse119 |c_~#list~0.base| (store .cse120 .cse7 v_ArrVal_832)) (select .cse116 .cse8)) (+ .cse3 |ULTIMATE.start_main_~cursor~1#1.offset|)) 0) (<= 5 .cse121)))))))))))))))) (forall ((|v_ULTIMATE.start_main_#t~ret30#1_49| Int)) (or (= ~unnamed1~0~LIST_BEG |v_ULTIMATE.start_main_#t~ret30#1_49|) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (let ((.cse126 (+ |c_~#list~0.offset| (* 4 |v_ULTIMATE.start_main_#t~ret30#1_49|)))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_52 Int) (v_prenex_51 Int) (v_prenex_53 Int)) (let ((.cse124 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse123 (+ v_prenex_52 .cse10)) (.cse125 (store (select .cse124 |c_~#list~0.base|) .cse126 v_prenex_51))) (or (<= .cse123 3) (<= 5 .cse123) (not (= (select v_arrayElimArr_5 .cse10) 0)) (= (select (select (store .cse124 |c_~#list~0.base| (store .cse125 .cse7 v_prenex_53)) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse123) 0) (not (= (select (select (store .cse124 |c_~#list~0.base| .cse125) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse128 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse127 (store (select .cse128 |c_~#list~0.base|) .cse126 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (not (= (select v_arrayElimArr_6 .cse10) 0)) (= (select (store .cse127 .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse5) 0) (not (= (select (select (store .cse128 |c_~#list~0.base| .cse127) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0))))))))))) (forall ((|v_ULTIMATE.start_main_#t~ret30#1_49| Int)) (or (= ~unnamed1~0~LIST_BEG |v_ULTIMATE.start_main_#t~ret30#1_49|) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int) (|v_ULTIMATE.start_create_item_~term_field~0#1_88| Int)) (let ((.cse133 (* 4 |v_ULTIMATE.start_create_item_~term_field~0#1_88|)) (.cse134 (+ |c_~#list~0.offset| (* 4 |v_ULTIMATE.start_main_#t~ret30#1_49|)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_59 Int)) (let ((.cse130 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse129 (+ v_prenex_59 .cse10)) (.cse131 (store (select .cse130 |c_~#list~0.base|) .cse134 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (<= .cse129 3) (not (= (select (select (store .cse130 |c_~#list~0.base| .cse131) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (<= 5 .cse129) (= (select (let ((.cse132 (store .cse131 .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (select (store .cse130 |c_~#list~0.base| .cse132) (select .cse132 .cse8))) (+ .cse3 v_prenex_59)) 0) (not (= (select v_arrayElimArr_6 .cse133) 0)))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_58 Int) (v_prenex_60 Int)) (let ((.cse136 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse135 (store (select .cse136 |c_~#list~0.base|) .cse134 v_prenex_58))) (or (= (select (store .cse135 .cse7 v_prenex_60) .cse5) 0) (not (= (select v_arrayElimArr_5 .cse133) 0)) (not (= (select (select (store .cse136 |c_~#list~0.base| .cse135) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0))))))))) (= ~unnamed1~0~LIST_END |v_ULTIMATE.start_main_#t~ret30#1_49|))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_66 Int) (v_prenex_64 Int)) (let ((.cse138 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse137 (select .cse138 |c_~#list~0.base|))) (or (not (= (select v_arrayElimArr_5 .cse3) 0)) (= (select (store .cse137 .cse7 v_prenex_66) .cse5) 0) (not (= (select (select (store .cse138 |c_~#list~0.base| (store .cse137 .cse7 v_prenex_64)) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_65 Int)) (let ((.cse140 (select (let ((.cse141 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (store .cse141 |c_~#list~0.base| (store (select .cse141 |c_~#list~0.base|) .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) |v_ULTIMATE.start_create_item_~item~0#1.base_32|)) (.cse139 (+ v_prenex_65 .cse10))) (or (not (= (select v_arrayElimArr_6 .cse3) 0)) (<= .cse139 3) (<= 5 .cse139) (not (= (select .cse140 .cse3) 0)) (= (select .cse140 .cse139) 0)))))) (forall ((|v_ULTIMATE.start_main_#t~ret30#1_49| Int)) (or (= ~unnamed1~0~LIST_BEG |v_ULTIMATE.start_main_#t~ret30#1_49|) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int) (|v_ULTIMATE.start_create_item_~term_field~0#1_88| Int)) (let ((.cse143 (* 4 |v_ULTIMATE.start_create_item_~term_field~0#1_88|)) (.cse146 (+ |c_~#list~0.offset| (* 4 |v_ULTIMATE.start_main_#t~ret30#1_49|)))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_52 Int) (v_prenex_51 Int) (v_prenex_53 Int)) (let ((.cse144 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse142 (+ v_prenex_52 .cse10)) (.cse145 (store (select .cse144 |c_~#list~0.base|) .cse146 v_prenex_51))) (or (<= .cse142 3) (not (= (select v_arrayElimArr_5 .cse143) 0)) (<= 5 .cse142) (= (select (select (store .cse144 |c_~#list~0.base| (store .cse145 .cse7 v_prenex_53)) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse142) 0) (not (= (select (select (store .cse144 |c_~#list~0.base| .cse145) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse148 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6))) (let ((.cse147 (store (select .cse148 |c_~#list~0.base|) .cse146 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (= (select (store .cse147 .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse5) 0) (not (= (select (select (store .cse148 |c_~#list~0.base| .cse147) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (not (= (select v_arrayElimArr_6 .cse143) 0))))))))) (= ~unnamed1~0~LIST_END |v_ULTIMATE.start_main_#t~ret30#1_49|))) (forall ((|v_ULTIMATE.start_main_#t~ret30#1_49| Int)) (or (= ~unnamed1~0~LIST_BEG |v_ULTIMATE.start_main_#t~ret30#1_49|) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_32| Int) (|v_ULTIMATE.start_create_item_~term_field~0#1_88| Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse149 (* 4 |v_ULTIMATE.start_create_item_~term_field~0#1_88|))) (or (not (= (select v_arrayElimArr_5 .cse149) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse151 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_6)) (.cse156 (+ |c_~#list~0.offset| (* 4 |v_ULTIMATE.start_main_#t~ret30#1_49|)))) (let ((.cse152 (store (select .cse151 |c_~#list~0.base|) .cse156 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (let ((.cse150 (store .cse152 .cse7 |v_ULTIMATE.start_create_item_~item~0#1.base_32|))) (or (= (select .cse150 .cse5) 0) (not (= (select (select (store .cse151 |c_~#list~0.base| .cse152) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (forall ((v_ArrVal_828 Int) (|ULTIMATE.start_main_~cursor~1#1.offset| Int) (v_ArrVal_832 Int)) (let ((.cse153 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_32| v_arrayElimArr_5))) (let ((.cse154 (store (select .cse153 |c_~#list~0.base|) .cse156 v_ArrVal_828)) (.cse155 (+ .cse10 |ULTIMATE.start_main_~cursor~1#1.offset|))) (or (not (= (select (select (store .cse153 |c_~#list~0.base| .cse154) |v_ULTIMATE.start_create_item_~item~0#1.base_32|) .cse3) 0)) (<= .cse155 3) (= (select (select (store .cse153 |c_~#list~0.base| (store .cse154 .cse7 v_ArrVal_832)) (select .cse150 .cse8)) (+ .cse3 |ULTIMATE.start_main_~cursor~1#1.offset|)) 0) (<= 5 .cse155))))) (not (= (select v_arrayElimArr_6 .cse149) 0)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_32|) 0)))) (= ~unnamed1~0~LIST_END |v_ULTIMATE.start_main_#t~ret30#1_49|)))))) is different from true [2022-11-22 02:50:05,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669851440] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:50:05,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [877799380] [2022-11-22 02:50:05,395 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-22 02:50:05,395 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:50:05,396 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:50:05,396 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:50:05,396 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:50:05,665 INFO L321 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-11-22 02:50:05,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 216 [2022-11-22 02:50:05,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:05,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:05,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:05,954 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-11-22 02:50:05,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 253 treesize of output 244 [2022-11-22 02:50:05,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:05,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:05,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:06,048 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-11-22 02:50:06,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 253 treesize of output 244 [2022-11-22 02:50:06,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:06,126 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-11-22 02:50:06,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 222 [2022-11-22 02:50:06,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:06,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:06,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:06,377 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-11-22 02:50:06,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 248 [2022-11-22 02:50:06,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:06,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:06,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:06,535 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-11-22 02:50:06,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 248 [2022-11-22 02:50:06,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:06,601 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-11-22 02:50:06,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 222 [2022-11-22 02:50:06,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:06,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:06,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:06,833 INFO L321 Elim1Store]: treesize reduction 154, result has 15.4 percent of original size [2022-11-22 02:50:06,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 255 [2022-11-22 02:50:06,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:06,872 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:06,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:07,006 INFO L321 Elim1Store]: treesize reduction 144, result has 20.9 percent of original size [2022-11-22 02:50:07,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 265 [2022-11-22 02:50:07,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:07,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 202 [2022-11-22 02:50:07,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:07,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:07,264 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:07,273 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:07,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:07,455 INFO L321 Elim1Store]: treesize reduction 278, result has 12.9 percent of original size [2022-11-22 02:50:07,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 299 treesize of output 292 [2022-11-22 02:50:07,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:07,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:07,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:07,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:07,508 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:07,525 INFO L321 Elim1Store]: treesize reduction 85, result has 1.2 percent of original size [2022-11-22 02:50:07,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 291 treesize of output 277 [2022-11-22 02:50:07,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:07,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 226 [2022-11-22 02:50:08,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:50:08,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:50:08,637 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:50:08,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:50:08,653 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:50:08,694 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:50:08,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:50:08,786 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:50:08,787 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:50:08,804 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:50:08,872 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:50:08,872 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:50:09,015 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-11-22 02:50:09,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-11-22 02:50:09,101 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-11-22 02:50:09,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-11-22 02:50:09,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:50:09,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:09,233 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:09,400 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-11-22 02:50:09,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-11-22 02:50:09,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:09,461 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:09,567 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-11-22 02:50:09,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-11-22 02:50:09,599 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:50:10,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:50:10,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:50:10,359 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:50:10,397 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:50:10,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:50:10,441 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:50:10,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:50:10,488 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:50:10,551 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:50:10,551 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:50:10,621 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:50:10,621 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:50:10,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:50:10,820 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-11-22 02:50:10,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-11-22 02:50:10,911 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-11-22 02:50:10,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-11-22 02:50:10,997 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:50:11,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:11,038 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:11,137 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-11-22 02:50:11,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-11-22 02:50:11,176 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:11,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:11,356 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-11-22 02:50:11,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-11-22 02:50:11,909 INFO L321 Elim1Store]: treesize reduction 35, result has 32.7 percent of original size [2022-11-22 02:50:11,909 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 33 treesize of output 37 [2022-11-22 02:50:11,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:50:12,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:50:12,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:50:12,139 INFO L197 IcfgInterpreter]: Interpreting procedure rand_end_point with input of size 17 for LOIs [2022-11-22 02:50:12,147 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:50:26,561 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '29885#(and (<= |~#list~0.base| 3) (<= 0 |#NULL.base|) (or (not (= |ULTIMATE.start_main_~cursor~1#1.offset| 0)) (not (= |ULTIMATE.start_main_~cursor~1#1.base| 0))) (<= |#NULL.offset| 0) (<= |#NULL.base| 0) (<= 0 |~#list~0.offset|) (<= 3 |~#list~0.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (not (= (select |#valid| |ULTIMATE.start_main_~cursor~1#1.base|) 1)) (<= |~#list~0.offset| 0))' at error location [2022-11-22 02:50:26,561 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:50:26,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:50:26,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 31 [2022-11-22 02:50:26,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260849088] [2022-11-22 02:50:26,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 02:50:26,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-22 02:50:26,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:50:26,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-22 02:50:26,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=4403, Unknown=3, NotChecked=408, Total=5112 [2022-11-22 02:50:26,565 INFO L87 Difference]: Start difference. First operand 475 states and 640 transitions. Second operand has 31 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 31 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:50:39,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:50:39,020 INFO L93 Difference]: Finished difference Result 609 states and 798 transitions. [2022-11-22 02:50:39,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-22 02:50:39,020 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 31 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2022-11-22 02:50:39,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:50:39,023 INFO L225 Difference]: With dead ends: 609 [2022-11-22 02:50:39,023 INFO L226 Difference]: Without dead ends: 609 [2022-11-22 02:50:39,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 89 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 38.8s TimeCoverageRelationStatistics Valid=723, Invalid=6942, Unknown=3, NotChecked=522, Total=8190 [2022-11-22 02:50:39,025 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 794 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-22 02:50:39,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1762 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-22 02:50:39,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2022-11-22 02:50:39,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 536. [2022-11-22 02:50:39,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 460 states have (on average 1.4652173913043478) internal successors, (674), 503 states have internal predecessors, (674), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (26), 19 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-22 02:50:39,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 726 transitions. [2022-11-22 02:50:39,035 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 726 transitions. Word has length 40 [2022-11-22 02:50:39,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:50:39,036 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 726 transitions. [2022-11-22 02:50:39,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 31 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:50:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 726 transitions. [2022-11-22 02:50:39,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-22 02:50:39,037 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:50:39,037 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, 1, 1, 1, 1] [2022-11-22 02:50:39,043 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-22 02:50:39,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-22 02:50:39,243 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:50:39,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:50:39,244 INFO L85 PathProgramCache]: Analyzing trace with hash -362867886, now seen corresponding path program 1 times [2022-11-22 02:50:39,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:50:39,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557003749] [2022-11-22 02:50:39,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:50:39,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:50:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:50:41,243 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-22 02:50:41,244 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:50:41,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557003749] [2022-11-22 02:50:41,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557003749] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:50:41,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693991234] [2022-11-22 02:50:41,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:50:41,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:50:41,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:50:41,245 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:50:41,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-22 02:50:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:50:41,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-22 02:50:41,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:50:41,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:41,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:50:42,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:42,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:50:42,151 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-22 02:50:42,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 02:50:42,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:42,427 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-11-22 02:50:42,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 47 [2022-11-22 02:50:43,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:43,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:50:43,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 44 [2022-11-22 02:50:43,584 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-22 02:50:43,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:50:45,135 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_33|) 0)) (forall ((|ULTIMATE.start_create_item_~cursor#1.offset| Int) (v_ArrVal_889 (Array Int Int)) (v_ArrVal_887 Int)) (let ((.cse0 (select (store (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_33| v_ArrVal_889) |c_~#list~0.base|) |ULTIMATE.start_create_item_~cursor#1.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_33|) (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4)) |v_ULTIMATE.start_create_item_~item~0#1.base_33|) (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_END 4))))) (or (= (store (store |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_33| v_ArrVal_887) .cse0 0) |c_ULTIMATE.start_main_old_#valid#1|) (= .cse0 0)))))) (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_33|) 0)) (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_33| 0)) (= |v_ULTIMATE.start_create_item_~item~0#1.base_33| 0)))) is different from false [2022-11-22 02:50:45,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693991234] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:50:45,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1895999126] [2022-11-22 02:50:45,169 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-22 02:50:45,170 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:50:45,170 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:50:45,170 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:50:45,170 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:50:45,358 INFO L321 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-11-22 02:50:45,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 216 [2022-11-22 02:50:45,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:45,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:45,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:45,644 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-11-22 02:50:45,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 253 treesize of output 244 [2022-11-22 02:50:45,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:45,667 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:45,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:45,730 INFO L321 Elim1Store]: treesize reduction 88, result has 16.2 percent of original size [2022-11-22 02:50:45,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 253 treesize of output 244 [2022-11-22 02:50:45,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:45,780 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-11-22 02:50:45,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 222 [2022-11-22 02:50:45,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:45,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:45,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:45,982 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-11-22 02:50:45,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 264 treesize of output 251 [2022-11-22 02:50:46,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:46,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:46,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:46,113 INFO L321 Elim1Store]: treesize reduction 189, result has 12.9 percent of original size [2022-11-22 02:50:46,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 248 [2022-11-22 02:50:46,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:46,163 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-11-22 02:50:46,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 222 [2022-11-22 02:50:46,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:46,268 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:46,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:46,367 INFO L321 Elim1Store]: treesize reduction 154, result has 15.4 percent of original size [2022-11-22 02:50:46,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 255 [2022-11-22 02:50:46,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:46,397 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:46,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:46,503 INFO L321 Elim1Store]: treesize reduction 144, result has 20.9 percent of original size [2022-11-22 02:50:46,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 257 treesize of output 265 [2022-11-22 02:50:46,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:46,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 202 [2022-11-22 02:50:46,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:46,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:46,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:46,796 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:46,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:46,929 INFO L321 Elim1Store]: treesize reduction 281, result has 11.9 percent of original size [2022-11-22 02:50:46,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 498 treesize of output 480 [2022-11-22 02:50:46,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:46,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 450 treesize of output 409 [2022-11-22 02:50:47,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:47,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:47,017 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:47,023 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:47,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:50:47,111 INFO L321 Elim1Store]: treesize reduction 296, result has 7.2 percent of original size [2022-11-22 02:50:47,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 482 treesize of output 437 [2022-11-22 02:50:48,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:50:48,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:50:48,288 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:50:48,327 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:50:48,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:50:48,367 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:50:48,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:50:48,449 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:50:48,449 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:50:48,466 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:50:48,532 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:50:48,533 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:50:48,674 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-11-22 02:50:48,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-11-22 02:50:48,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:50:48,776 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-11-22 02:50:48,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-11-22 02:50:48,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:48,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:48,951 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-11-22 02:50:48,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-11-22 02:50:48,981 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:50:49,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:49,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:49,173 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-11-22 02:50:49,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-11-22 02:50:49,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:50:49,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:50:49,993 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:50:49,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:50:50,035 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:50:50,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:50:50,052 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:50:50,092 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:50:50,153 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:50:50,153 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:50:50,232 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:50:50,232 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:50:50,340 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-11-22 02:50:50,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-11-22 02:50:50,457 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-11-22 02:50:50,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-11-22 02:50:50,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:50:50,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:50,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:50,729 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-11-22 02:50:50,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-11-22 02:50:50,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:50,791 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:50:50,893 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-11-22 02:50:50,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-11-22 02:50:50,917 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:50:51,445 INFO L321 Elim1Store]: treesize reduction 35, result has 32.7 percent of original size [2022-11-22 02:50:51,445 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 33 treesize of output 37 [2022-11-22 02:50:51,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:50:51,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:50:51,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:50:51,667 INFO L197 IcfgInterpreter]: Interpreting procedure rand_end_point with input of size 17 for LOIs [2022-11-22 02:50:51,675 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:51:03,102 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '31343#(and (<= |~#list~0.base| 3) (<= 0 |#NULL.base|) (= |ULTIMATE.start_main_~cursor~1#1.base| 0) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (<= |#NULL.offset| 0) (= |ULTIMATE.start_main_~cursor~1#1.offset| 0) (<= |#NULL.base| 0) (<= 0 |~#list~0.offset|) (<= 3 |~#list~0.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_#res#1| 0) (<= |~#list~0.offset| 0))' at error location [2022-11-22 02:51:03,103 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:51:03,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:51:03,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 23 [2022-11-22 02:51:03,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282616995] [2022-11-22 02:51:03,103 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 02:51:03,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-22 02:51:03,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:51:03,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-22 02:51:03,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=3195, Unknown=9, NotChecked=114, Total=3540 [2022-11-22 02:51:03,105 INFO L87 Difference]: Start difference. First operand 536 states and 726 transitions. Second operand has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 24 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:51:14,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:51:14,531 INFO L93 Difference]: Finished difference Result 583 states and 772 transitions. [2022-11-22 02:51:14,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-22 02:51:14,532 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 24 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2022-11-22 02:51:14,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:51:14,535 INFO L225 Difference]: With dead ends: 583 [2022-11-22 02:51:14,535 INFO L226 Difference]: Without dead ends: 573 [2022-11-22 02:51:14,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1876 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=627, Invalid=6010, Unknown=9, NotChecked=160, Total=6806 [2022-11-22 02:51:14,536 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 707 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:51:14,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1132 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1446 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-22 02:51:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2022-11-22 02:51:14,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 535. [2022-11-22 02:51:14,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 459 states have (on average 1.4640522875816993) internal successors, (672), 502 states have internal predecessors, (672), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (26), 19 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-22 02:51:14,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 724 transitions. [2022-11-22 02:51:14,547 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 724 transitions. Word has length 40 [2022-11-22 02:51:14,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:51:14,547 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 724 transitions. [2022-11-22 02:51:14,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 24 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:51:14,548 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 724 transitions. [2022-11-22 02:51:14,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-22 02:51:14,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:51:14,548 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:51:14,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-22 02:51:14,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-22 02:51:14,764 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:51:14,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:51:14,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1148182, now seen corresponding path program 1 times [2022-11-22 02:51:14,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:51:14,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736277628] [2022-11-22 02:51:14,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:51:14,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:51:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:51:14,878 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-22 02:51:14,878 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:51:14,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736277628] [2022-11-22 02:51:14,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736277628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:51:14,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:51:14,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:51:14,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564225310] [2022-11-22 02:51:14,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:51:14,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:51:14,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:51:14,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:51:14,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:51:14,880 INFO L87 Difference]: Start difference. First operand 535 states and 724 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:51:15,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:51:15,452 INFO L93 Difference]: Finished difference Result 761 states and 1023 transitions. [2022-11-22 02:51:15,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 02:51:15,453 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-11-22 02:51:15,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:51:15,456 INFO L225 Difference]: With dead ends: 761 [2022-11-22 02:51:15,456 INFO L226 Difference]: Without dead ends: 761 [2022-11-22 02:51:15,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:51:15,457 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 95 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:51:15,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 407 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 02:51:15,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-11-22 02:51:15,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 533. [2022-11-22 02:51:15,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 459 states have (on average 1.4553376906318083) internal successors, (668), 500 states have internal predecessors, (668), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (26), 19 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-22 02:51:15,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 720 transitions. [2022-11-22 02:51:15,468 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 720 transitions. Word has length 41 [2022-11-22 02:51:15,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:51:15,469 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 720 transitions. [2022-11-22 02:51:15,469 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:51:15,469 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 720 transitions. [2022-11-22 02:51:15,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-22 02:51:15,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:51:15,470 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:51:15,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-22 02:51:15,471 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:51:15,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:51:15,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1148181, now seen corresponding path program 1 times [2022-11-22 02:51:15,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:51:15,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121488244] [2022-11-22 02:51:15,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:51:15,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:51:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:51:18,820 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:51:18,821 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:51:18,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121488244] [2022-11-22 02:51:18,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121488244] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:51:18,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393183386] [2022-11-22 02:51:18,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:51:18,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:51:18,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:51:18,823 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:51:18,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-22 02:51:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:51:19,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 111 conjunts are in the unsatisfiable core [2022-11-22 02:51:19,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:51:19,176 INFO L350 Elim1Store]: Elim1 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-22 02:51:19,236 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 02:51:19,237 INFO L350 Elim1Store]: Elim1 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-22 02:51:19,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:51:19,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:51:19,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:51:19,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:51:19,926 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-22 02:51:19,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 02:51:19,959 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-22 02:51:19,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-11-22 02:51:20,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:51:20,400 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-11-22 02:51:20,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 77 [2022-11-22 02:51:20,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:51:20,439 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-11-22 02:51:20,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 100 [2022-11-22 02:51:21,729 INFO L321 Elim1Store]: treesize reduction 23, result has 72.0 percent of original size [2022-11-22 02:51:21,729 INFO L350 Elim1Store]: Elim1 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 89 treesize of output 128 [2022-11-22 02:51:21,799 INFO L321 Elim1Store]: treesize reduction 61, result has 40.2 percent of original size [2022-11-22 02:51:21,799 INFO L350 Elim1Store]: Elim1 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 3 case distinctions, treesize of input 70 treesize of output 94 [2022-11-22 02:51:23,845 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:51:23,845 INFO L350 Elim1Store]: Elim1 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 94 treesize of output 74 [2022-11-22 02:51:23,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:51:23,872 INFO L321 Elim1Store]: treesize reduction 20, result has 13.0 percent of original size [2022-11-22 02:51:23,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 39 [2022-11-22 02:51:24,239 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-22 02:51:24,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:51:26,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393183386] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:51:26,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [66756997] [2022-11-22 02:51:26,065 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-22 02:51:26,065 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:51:26,066 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:51:26,066 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:51:26,066 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:51:26,233 INFO L321 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-11-22 02:51:26,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 216 [2022-11-22 02:51:26,489 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:51:26,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:51:26,535 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:51:26,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:51:26,550 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:51:26,630 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:51:26,631 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:51:26,699 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:51:26,699 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:51:26,719 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:51:26,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:51:26,869 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-11-22 02:51:26,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-11-22 02:51:26,955 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-11-22 02:51:26,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-11-22 02:51:27,034 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:27,040 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:27,134 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-11-22 02:51:27,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-11-22 02:51:27,156 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:51:27,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:27,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:27,354 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-11-22 02:51:27,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-11-22 02:51:27,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:51:27,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:51:28,044 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:51:28,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:51:28,091 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-22 02:51:28,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:51:28,105 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:51:28,169 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:51:28,231 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:51:28,231 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:51:28,300 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-22 02:51:28,300 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-22 02:51:28,447 INFO L321 Elim1Store]: treesize reduction 92, result has 33.8 percent of original size [2022-11-22 02:51:28,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2022-11-22 02:51:28,531 INFO L321 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2022-11-22 02:51:28,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 39 [2022-11-22 02:51:28,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:51:28,637 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:28,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:28,737 INFO L321 Elim1Store]: treesize reduction 224, result has 15.5 percent of original size [2022-11-22 02:51:28,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 64 [2022-11-22 02:51:28,775 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:28,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:51:28,940 INFO L321 Elim1Store]: treesize reduction 183, result has 30.9 percent of original size [2022-11-22 02:51:28,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 129 [2022-11-22 02:51:28,983 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 1 [2022-11-22 02:51:29,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:51:29,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:51:29,402 INFO L197 IcfgInterpreter]: Interpreting procedure rand_end_point with input of size 17 for LOIs [2022-11-22 02:51:29,410 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:51:41,757 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '34033#(and (<= |ULTIMATE.start_create_item_#in~cursor#1.offset| 8589934588) (<= 0 (+ |ULTIMATE.start_create_item_~item~0#1.offset| (* 4 |ULTIMATE.start_create_item_~link_field~0#1|))) (<= 3 |ULTIMATE.start_create_item_#in~cursor#1.base|) (<= 3 |ULTIMATE.start_create_item_~cursor#1.base|) (<= (+ |ULTIMATE.start_create_item_~cursor#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= |ULTIMATE.start_main_#t~ret30#1| 2147483647) (= |ULTIMATE.start_create_item_~link~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~item~0#1.base|) (+ |ULTIMATE.start_create_item_~item~0#1.offset| (* 4 |ULTIMATE.start_create_item_~link_field~0#1|)))) (<= |ULTIMATE.start_append_one_#in~to#1| 2147483647) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~item~0#1.base|) (+ |ULTIMATE.start_create_item_~item~0#1.offset| (* 4 |ULTIMATE.start_create_item_~link_field~0#1|))) |ULTIMATE.start_create_item_~link~0#1.offset|) (<= |ULTIMATE.start_create_item_#in~at#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_#t~ret30#1| 2147483648)) (<= |ULTIMATE.start_append_one_~to#1| 2147483647) (<= |ULTIMATE.start_append_one_~list#1.base| 3) (<= (+ |ULTIMATE.start_create_item_~item~0#1.offset| (* 4 |ULTIMATE.start_create_item_~link_field~0#1|) 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (<= 0 |ULTIMATE.start_append_one_~cursor~0#1.offset|) (<= |ULTIMATE.start_append_one_#in~list#1.offset| 0) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1) (<= 3 |ULTIMATE.start_append_one_~cursor~0#1.base|) (<= |ULTIMATE.start_create_item_~cursor#1.base| 3) (= 3 |~#list~0.base|) (<= 0 (+ 2147483648 |ULTIMATE.start_append_one_~to#1|)) (<= 0 |ULTIMATE.start_create_item_~cursor#1.offset|) (= |ULTIMATE.start_create_item_~link~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|)) (<= |ULTIMATE.start_append_one_~cursor~0#1.base| 3) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (or (not (= |ULTIMATE.start_create_item_~link~0#1.offset| 0)) (not (= |ULTIMATE.start_create_item_~link~0#1.base| 0))) (<= |ULTIMATE.start_create_item_~at#1| 2147483647) (<= 0 (+ |ULTIMATE.start_append_one_#in~to#1| 2147483648)) (<= 0 |ULTIMATE.start_append_one_#in~list#1.offset|) (<= 3 |ULTIMATE.start_append_one_~list#1.base|) (or (not (<= (+ |ULTIMATE.start_create_item_~link~0#1.offset| (* |ULTIMATE.start_create_item_~term_field~0#1| 4) 4) (select |#length| |ULTIMATE.start_create_item_~link~0#1.base|))) (not (<= 0 (+ |ULTIMATE.start_create_item_~link~0#1.offset| (* |ULTIMATE.start_create_item_~term_field~0#1| 4))))) (<= 0 (+ |ULTIMATE.start_create_item_~at#1| 2147483648)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) |ULTIMATE.start_create_item_~link~0#1.offset|) (<= |ULTIMATE.start_append_one_~cursor~0#1.offset| 8589934588) (<= |ULTIMATE.start_create_item_#in~cursor#1.base| 3) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_create_item_#in~cursor#1.offset|) (<= 0 (+ |ULTIMATE.start_create_item_#in~at#1| 2147483648)) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (<= |ULTIMATE.start_create_item_~cursor#1.offset| 8589934588) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_append_one_#in~list#1.base| 3) (= |#NULL.base| 0) (<= 3 |ULTIMATE.start_append_one_#in~list#1.base|))' at error location [2022-11-22 02:51:41,758 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:51:41,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:51:41,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 28 [2022-11-22 02:51:41,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71992905] [2022-11-22 02:51:41,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 02:51:41,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-22 02:51:41,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:51:41,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-22 02:51:41,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=3477, Unknown=0, NotChecked=0, Total=3782 [2022-11-22 02:51:41,759 INFO L87 Difference]: Start difference. First operand 533 states and 720 transitions. Second operand has 29 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 27 states have internal predecessors, (69), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-22 02:51:57,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:51:57,126 INFO L93 Difference]: Finished difference Result 822 states and 1078 transitions. [2022-11-22 02:51:57,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-22 02:51:57,126 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 27 states have internal predecessors, (69), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2022-11-22 02:51:57,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:51:57,128 INFO L225 Difference]: With dead ends: 822 [2022-11-22 02:51:57,128 INFO L226 Difference]: Without dead ends: 822 [2022-11-22 02:51:57,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1898 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=712, Invalid=6428, Unknown=0, NotChecked=0, Total=7140 [2022-11-22 02:51:57,129 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 1167 mSDsluCounter, 2239 mSDsCounter, 0 mSdLazyCounter, 2719 mSolverCounterSat, 123 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 2401 SdHoareTripleChecker+Invalid, 2847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2719 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:51:57,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 2401 Invalid, 2847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2719 Invalid, 5 Unknown, 0 Unchecked, 6.4s Time] [2022-11-22 02:51:57,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2022-11-22 02:51:57,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 547. [2022-11-22 02:51:57,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 473 states have (on average 1.4460887949260042) internal successors, (684), 513 states have internal predecessors, (684), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (26), 20 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-22 02:51:57,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 736 transitions. [2022-11-22 02:51:57,140 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 736 transitions. Word has length 41 [2022-11-22 02:51:57,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:51:57,141 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 736 transitions. [2022-11-22 02:51:57,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 27 states have internal predecessors, (69), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-22 02:51:57,141 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 736 transitions. [2022-11-22 02:51:57,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-22 02:51:57,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:51:57,142 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, 1, 1, 1, 1, 1, 1] [2022-11-22 02:51:57,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-22 02:51:57,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:51:57,351 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:51:57,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:51:57,352 INFO L85 PathProgramCache]: Analyzing trace with hash 25290299, now seen corresponding path program 1 times [2022-11-22 02:51:57,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:51:57,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926702213] [2022-11-22 02:51:57,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:51:57,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:51:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:52:04,996 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:52:04,996 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:52:04,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926702213] [2022-11-22 02:52:04,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926702213] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:52:04,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183112505] [2022-11-22 02:52:04,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:52:04,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:52:04,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:52:04,997 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:52:05,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-22 02:52:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:52:05,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 165 conjunts are in the unsatisfiable core [2022-11-22 02:52:05,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:52:05,538 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 02:52:05,539 INFO L350 Elim1Store]: Elim1 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-22 02:52:06,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 02:52:06,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-22 02:52:07,319 INFO L350 Elim1Store]: Elim1 eliminated variable 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 25 treesize of output 24 [2022-11-22 02:52:07,334 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-22 02:52:07,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-22 02:52:07,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:07,901 INFO L321 Elim1Store]: treesize reduction 72, result has 11.1 percent of original size [2022-11-22 02:52:07,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 129 treesize of output 127 [2022-11-22 02:52:07,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:07,943 INFO L321 Elim1Store]: treesize reduction 46, result has 30.3 percent of original size [2022-11-22 02:52:07,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 135 [2022-11-22 02:52:08,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:52:09,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:09,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:52:09,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:09,477 INFO L321 Elim1Store]: treesize reduction 47, result has 34.7 percent of original size [2022-11-22 02:52:09,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 121 [2022-11-22 02:52:09,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:09,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:09,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:52:09,534 INFO L321 Elim1Store]: treesize reduction 42, result has 37.3 percent of original size [2022-11-22 02:52:09,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 157 treesize of output 177 [2022-11-22 02:52:12,496 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:52:12,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:52:21,176 WARN L233 SmtUtils]: Spent 6.44s on a formula simplification. DAG size of input: 85 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:52:25,142 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:52:25,143 INFO L350 Elim1Store]: Elim1 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 1247 treesize of output 1061 [2022-11-22 02:52:25,163 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:52:25,163 INFO L350 Elim1Store]: Elim1 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 1065 treesize of output 823 [2022-11-22 02:53:26,949 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-11-22 02:53:26,950 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2022-11-22 02:53:26,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [400603508] [2022-11-22 02:53:26,949 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2022-11-22 02:53:26,953 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-22 02:53:26,953 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:53:26,953 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:53:26,953 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:53:26,954 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:53:26,962 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:158) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:273) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:221) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:156) ... 44 more [2022-11-22 02:53:26,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:53:26,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2022-11-22 02:53:26,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547866071] [2022-11-22 02:53:26,966 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-22 02:53:26,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-22 02:53:26,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:53:26,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-22 02:53:26,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=3057, Unknown=0, NotChecked=0, Total=3306 [2022-11-22 02:53:26,968 INFO L87 Difference]: Start difference. First operand 547 states and 736 transitions. Second operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:53:26,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=249, Invalid=3057, Unknown=0, NotChecked=0, Total=3306 [2022-11-22 02:53:26,970 INFO L413 NwaCegarLoop]: 0 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, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:53:26,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:53:26,980 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-22 02:53:27,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:53:27,180 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:158) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertCodeBlock(IncrementalHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:278) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1655) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:658) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:365) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:156) ... 36 more [2022-11-22 02:53:27,183 INFO L158 Benchmark]: Toolchain (without parser) took 441582.28ms. Allocated memory was 155.2MB in the beginning and 627.0MB in the end (delta: 471.9MB). Free memory was 109.9MB in the beginning and 561.2MB in the end (delta: -451.3MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2022-11-22 02:53:27,183 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 104.9MB. Free memory is still 54.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 02:53:27,183 INFO L158 Benchmark]: CACSL2BoogieTranslator took 738.26ms. Allocated memory is still 155.2MB. Free memory was 109.5MB in the beginning and 88.2MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-22 02:53:27,184 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.94ms. Allocated memory is still 155.2MB. Free memory was 88.2MB in the beginning and 85.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:53:27,184 INFO L158 Benchmark]: Boogie Preprocessor took 43.05ms. Allocated memory is still 155.2MB. Free memory was 85.6MB in the beginning and 83.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 02:53:27,184 INFO L158 Benchmark]: RCFGBuilder took 1066.71ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 95.8MB in the end (delta: -12.7MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2022-11-22 02:53:27,184 INFO L158 Benchmark]: TraceAbstraction took 439652.13ms. Allocated memory was 155.2MB in the beginning and 627.0MB in the end (delta: 471.9MB). Free memory was 95.0MB in the beginning and 561.2MB in the end (delta: -466.2MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2022-11-22 02:53:27,185 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 104.9MB. Free memory is still 54.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 738.26ms. Allocated memory is still 155.2MB. Free memory was 109.5MB in the beginning and 88.2MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.94ms. Allocated memory is still 155.2MB. Free memory was 88.2MB in the beginning and 85.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.05ms. Allocated memory is still 155.2MB. Free memory was 85.6MB in the beginning and 83.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1066.71ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 95.8MB in the end (delta: -12.7MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * TraceAbstraction took 439652.13ms. Allocated memory was 155.2MB in the beginning and 627.0MB in the end (delta: 471.9MB). Free memory was 95.0MB in the beginning and 561.2MB in the end (delta: -466.2MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0218.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 --- 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-b5237d8 [2022-11-22 02:53:29,866 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 02:53:29,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 02:53:29,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 02:53:29,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 02:53:29,939 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 02:53:29,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 02:53:29,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 02:53:29,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 02:53:29,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 02:53:29,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 02:53:29,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 02:53:29,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 02:53:29,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 02:53:29,967 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 02:53:29,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 02:53:29,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 02:53:29,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 02:53:29,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 02:53:29,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 02:53:29,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 02:53:29,995 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 02:53:29,996 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 02:53:29,998 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 02:53:30,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 02:53:30,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 02:53:30,010 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 02:53:30,013 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 02:53:30,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 02:53:30,016 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 02:53:30,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 02:53:30,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 02:53:30,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 02:53:30,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 02:53:30,025 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 02:53:30,025 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 02:53:30,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 02:53:30,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 02:53:30,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 02:53:30,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 02:53:30,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 02:53:30,038 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-22 02:53:30,093 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 02:53:30,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 02:53:30,095 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 02:53:30,095 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 02:53:30,096 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 02:53:30,096 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 02:53:30,097 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 02:53:30,097 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 02:53:30,097 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 02:53:30,098 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 02:53:30,099 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 02:53:30,099 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 02:53:30,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-22 02:53:30,101 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-22 02:53:30,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 02:53:30,102 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 02:53:30,102 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 02:53:30,102 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 02:53:30,103 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 02:53:30,103 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 02:53:30,103 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-22 02:53:30,103 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-22 02:53:30,104 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-22 02:53:30,104 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 02:53:30,104 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 02:53:30,105 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-22 02:53:30,105 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-22 02:53:30,105 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 02:53:30,106 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 02:53:30,106 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 02:53:30,106 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-22 02:53:30,107 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 02:53:30,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:53:30,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 02:53:30,108 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 02:53:30,108 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-22 02:53:30,108 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-22 02:53:30,109 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 02:53:30,109 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-22 02:53:30,109 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/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_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba 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 -> Taipan 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 -> d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 [2022-11-22 02:53:30,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 02:53:30,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 02:53:30,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 02:53:30,592 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 02:53:30,592 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 02:53:30,593 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/memsafety/test-0218.i [2022-11-22 02:53:33,749 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 02:53:34,106 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 02:53:34,113 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/sv-benchmarks/c/memsafety/test-0218.i [2022-11-22 02:53:34,139 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/data/4ad430efe/8079bc00552944e098c1cc07fdf91595/FLAGa7a35c049 [2022-11-22 02:53:34,168 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/data/4ad430efe/8079bc00552944e098c1cc07fdf91595 [2022-11-22 02:53:34,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 02:53:34,174 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 02:53:34,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 02:53:34,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 02:53:34,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 02:53:34,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:53:34" (1/1) ... [2022-11-22 02:53:34,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6efaec3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:53:34, skipping insertion in model container [2022-11-22 02:53:34,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:53:34" (1/1) ... [2022-11-22 02:53:34,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 02:53:34,281 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 02:53:34,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:53:34,951 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 02:53:35,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:53:35,086 INFO L208 MainTranslator]: Completed translation [2022-11-22 02:53:35,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:53:35 WrapperNode [2022-11-22 02:53:35,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 02:53:35,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 02:53:35,089 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 02:53:35,089 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 02:53:35,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:53:35" (1/1) ... [2022-11-22 02:53:35,123 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:53:35" (1/1) ... [2022-11-22 02:53:35,162 INFO L138 Inliner]: procedures = 182, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 196 [2022-11-22 02:53:35,163 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 02:53:35,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 02:53:35,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 02:53:35,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 02:53:35,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:53:35" (1/1) ... [2022-11-22 02:53:35,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:53:35" (1/1) ... [2022-11-22 02:53:35,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:53:35" (1/1) ... [2022-11-22 02:53:35,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:53:35" (1/1) ... [2022-11-22 02:53:35,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:53:35" (1/1) ... [2022-11-22 02:53:35,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:53:35" (1/1) ... [2022-11-22 02:53:35,215 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:53:35" (1/1) ... [2022-11-22 02:53:35,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:53:35" (1/1) ... [2022-11-22 02:53:35,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 02:53:35,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 02:53:35,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 02:53:35,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 02:53:35,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:53:35" (1/1) ... [2022-11-22 02:53:35,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:53:35,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:53:35,266 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 02:53:35,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 02:53:35,318 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2022-11-22 02:53:35,319 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2022-11-22 02:53:35,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-22 02:53:35,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 02:53:35,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-22 02:53:35,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-22 02:53:35,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 02:53:35,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-22 02:53:35,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-22 02:53:35,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 02:53:35,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 02:53:35,502 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 02:53:35,507 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 02:53:36,497 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 02:53:36,506 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 02:53:36,507 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-22 02:53:36,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:53:36 BoogieIcfgContainer [2022-11-22 02:53:36,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 02:53:36,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 02:53:36,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 02:53:36,516 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 02:53:36,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:53:34" (1/3) ... [2022-11-22 02:53:36,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3393399b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:53:36, skipping insertion in model container [2022-11-22 02:53:36,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:53:35" (2/3) ... [2022-11-22 02:53:36,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3393399b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:53:36, skipping insertion in model container [2022-11-22 02:53:36,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:53:36" (3/3) ... [2022-11-22 02:53:36,524 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0218.i [2022-11-22 02:53:36,546 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 02:53:36,546 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2022-11-22 02:53:36,621 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 02:53:36,629 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;@4f26a252, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 02:53:36,630 INFO L358 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2022-11-22 02:53:36,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 157 states, 88 states have (on average 2.0113636363636362) internal successors, (177), 153 states have internal predecessors, (177), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:53:36,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 02:53:36,644 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:53:36,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 02:53:36,645 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:53:36,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:53:36,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1044504330, now seen corresponding path program 1 times [2022-11-22 02:53:36,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:53:36,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298093293] [2022-11-22 02:53:36,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:53:36,672 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:36,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:53:36,683 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:53:36,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-22 02:53:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:53:36,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-22 02:53:36,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:53:36,836 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-22 02:53:36,837 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:53:36,838 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:53:36,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298093293] [2022-11-22 02:53:36,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298093293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:53:36,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:53:36,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:53:36,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189479432] [2022-11-22 02:53:36,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:53:36,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-22 02:53:36,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:53:36,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-22 02:53:36,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 02:53:36,897 INFO L87 Difference]: Start difference. First operand has 157 states, 88 states have (on average 2.0113636363636362) internal successors, (177), 153 states have internal predecessors, (177), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 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-22 02:53:36,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:53:36,937 INFO L93 Difference]: Finished difference Result 157 states and 175 transitions. [2022-11-22 02:53:36,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 02:53:36,940 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-22 02:53:36,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:53:36,954 INFO L225 Difference]: With dead ends: 157 [2022-11-22 02:53:36,954 INFO L226 Difference]: Without dead ends: 155 [2022-11-22 02:53:36,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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-22 02:53:36,962 INFO L413 NwaCegarLoop]: 175 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, 175 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-22 02:53:36,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:53:36,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-22 02:53:37,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2022-11-22 02:53:37,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 87 states have (on average 1.9425287356321839) internal successors, (169), 151 states have internal predecessors, (169), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:53:37,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 173 transitions. [2022-11-22 02:53:37,032 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 173 transitions. Word has length 6 [2022-11-22 02:53:37,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:53:37,033 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 173 transitions. [2022-11-22 02:53:37,033 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-22 02:53:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2022-11-22 02:53:37,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 02:53:37,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:53:37,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 02:53:37,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-22 02:53:37,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:37,250 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:53:37,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:53:37,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1037771564, now seen corresponding path program 1 times [2022-11-22 02:53:37,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:53:37,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558695423] [2022-11-22 02:53:37,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:53:37,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:37,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:53:37,254 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:53:37,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-22 02:53:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:53:37,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 02:53:37,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:53:37,417 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-22 02:53:37,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:53:37,418 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:53:37,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558695423] [2022-11-22 02:53:37,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558695423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:53:37,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:53:37,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 02:53:37,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671358825] [2022-11-22 02:53:37,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:53:37,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:53:37,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:53:37,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:53:37,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:53:37,433 INFO L87 Difference]: Start difference. First operand 155 states and 173 transitions. Second operand has 3 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-22 02:53:38,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:53:38,057 INFO L93 Difference]: Finished difference Result 301 states and 336 transitions. [2022-11-22 02:53:38,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:53:38,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 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-22 02:53:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:53:38,064 INFO L225 Difference]: With dead ends: 301 [2022-11-22 02:53:38,064 INFO L226 Difference]: Without dead ends: 301 [2022-11-22 02:53:38,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:53:38,066 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 155 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:53:38,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 219 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 02:53:38,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-11-22 02:53:38,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 211. [2022-11-22 02:53:38,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 140 states have (on average 1.9285714285714286) internal successors, (270), 204 states have internal predecessors, (270), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-22 02:53:38,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 278 transitions. [2022-11-22 02:53:38,113 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 278 transitions. Word has length 6 [2022-11-22 02:53:38,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:53:38,115 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 278 transitions. [2022-11-22 02:53:38,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-22 02:53:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 278 transitions. [2022-11-22 02:53:38,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 02:53:38,118 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:53:38,118 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 02:53:38,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-22 02:53:38,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:38,331 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:53:38,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:53:38,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1037771565, now seen corresponding path program 1 times [2022-11-22 02:53:38,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:53:38,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266264181] [2022-11-22 02:53:38,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:53:38,343 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:38,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:53:38,345 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:53:38,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-22 02:53:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:53:38,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 02:53:38,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:53:38,585 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-22 02:53:38,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:53:38,585 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:53:38,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266264181] [2022-11-22 02:53:38,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266264181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:53:38,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:53:38,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:53:38,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049377391] [2022-11-22 02:53:38,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:53:38,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:53:38,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:53:38,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:53:38,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:53:38,588 INFO L87 Difference]: Start difference. First operand 211 states and 278 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-22 02:53:39,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:53:39,149 INFO L93 Difference]: Finished difference Result 229 states and 296 transitions. [2022-11-22 02:53:39,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:53:39,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-22 02:53:39,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:53:39,156 INFO L225 Difference]: With dead ends: 229 [2022-11-22 02:53:39,156 INFO L226 Difference]: Without dead ends: 229 [2022-11-22 02:53:39,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:53:39,158 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 202 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:53:39,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 224 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 02:53:39,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-11-22 02:53:39,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 213. [2022-11-22 02:53:39,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 142 states have (on average 1.9225352112676057) internal successors, (273), 206 states have internal predecessors, (273), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-22 02:53:39,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 281 transitions. [2022-11-22 02:53:39,176 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 281 transitions. Word has length 6 [2022-11-22 02:53:39,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:53:39,176 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 281 transitions. [2022-11-22 02:53:39,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-22 02:53:39,177 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 281 transitions. [2022-11-22 02:53:39,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 02:53:39,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:53:39,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 02:53:39,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-22 02:53:39,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:39,391 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:53:39,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:53:39,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1037771627, now seen corresponding path program 1 times [2022-11-22 02:53:39,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:53:39,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308690764] [2022-11-22 02:53:39,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:53:39,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:39,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:53:39,395 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:53:39,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-22 02:53:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:53:39,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 02:53:39,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:53:39,618 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-22 02:53:39,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:53:39,619 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:53:39,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308690764] [2022-11-22 02:53:39,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308690764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:53:39,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:53:39,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:53:39,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396935454] [2022-11-22 02:53:39,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:53:39,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:53:39,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:53:39,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:53:39,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:53:39,629 INFO L87 Difference]: Start difference. First operand 213 states and 281 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-22 02:53:40,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:53:40,139 INFO L93 Difference]: Finished difference Result 228 states and 294 transitions. [2022-11-22 02:53:40,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:53:40,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-22 02:53:40,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:53:40,142 INFO L225 Difference]: With dead ends: 228 [2022-11-22 02:53:40,142 INFO L226 Difference]: Without dead ends: 228 [2022-11-22 02:53:40,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:53:40,143 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 184 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:53:40,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 237 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 02:53:40,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-22 02:53:40,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 210. [2022-11-22 02:53:40,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 140 states have (on average 1.9142857142857144) internal successors, (268), 203 states have internal predecessors, (268), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-22 02:53:40,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 276 transitions. [2022-11-22 02:53:40,156 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 276 transitions. Word has length 6 [2022-11-22 02:53:40,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:53:40,156 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 276 transitions. [2022-11-22 02:53:40,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-22 02:53:40,157 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 276 transitions. [2022-11-22 02:53:40,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 02:53:40,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:53:40,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:53:40,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-22 02:53:40,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:40,370 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:53:40,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:53:40,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1078287251, now seen corresponding path program 1 times [2022-11-22 02:53:40,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:53:40,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102084210] [2022-11-22 02:53:40,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:53:40,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:40,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:53:40,377 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:53:40,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-22 02:53:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:53:40,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-22 02:53:40,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:53:40,718 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:53:40,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 02:53:40,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:53:40,747 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:53:40,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-11-22 02:53:40,802 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-22 02:53:40,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:53:40,803 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:53:40,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102084210] [2022-11-22 02:53:40,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102084210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:53:40,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:53:40,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:53:40,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001571155] [2022-11-22 02:53:40,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:53:40,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:53:40,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:53:40,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:53:40,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:53:40,807 INFO L87 Difference]: Start difference. First operand 210 states and 276 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:53:41,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:53:41,522 INFO L93 Difference]: Finished difference Result 370 states and 477 transitions. [2022-11-22 02:53:41,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:53:41,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-22 02:53:41,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:53:41,527 INFO L225 Difference]: With dead ends: 370 [2022-11-22 02:53:41,527 INFO L226 Difference]: Without dead ends: 370 [2022-11-22 02:53:41,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:53:41,529 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 140 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:53:41,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 674 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 02:53:41,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-11-22 02:53:41,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 268. [2022-11-22 02:53:41,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 192 states have (on average 1.8697916666666667) internal successors, (359), 257 states have internal predecessors, (359), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:53:41,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 375 transitions. [2022-11-22 02:53:41,572 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 375 transitions. Word has length 9 [2022-11-22 02:53:41,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:53:41,572 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 375 transitions. [2022-11-22 02:53:41,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:53:41,573 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 375 transitions. [2022-11-22 02:53:41,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 02:53:41,573 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:53:41,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:53:41,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-22 02:53:41,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:41,788 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:53:41,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:53:41,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1080134293, now seen corresponding path program 1 times [2022-11-22 02:53:41,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:53:41,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251181998] [2022-11-22 02:53:41,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:53:41,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:41,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:53:41,790 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:53:41,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-22 02:53:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:53:41,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-22 02:53:41,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:53:42,043 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:53:42,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 02:53:42,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:53:42,052 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:53:42,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-11-22 02:53:42,114 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-22 02:53:42,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:53:42,114 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:53:42,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251181998] [2022-11-22 02:53:42,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1251181998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:53:42,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:53:42,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:53:42,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394977907] [2022-11-22 02:53:42,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:53:42,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:53:42,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:53:42,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:53:42,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:53:42,117 INFO L87 Difference]: Start difference. First operand 268 states and 375 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:53:42,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:53:42,813 INFO L93 Difference]: Finished difference Result 360 states and 466 transitions. [2022-11-22 02:53:42,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:53:42,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-22 02:53:42,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:53:42,816 INFO L225 Difference]: With dead ends: 360 [2022-11-22 02:53:42,817 INFO L226 Difference]: Without dead ends: 360 [2022-11-22 02:53:42,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:53:42,818 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 120 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:53:42,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 674 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 02:53:42,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-11-22 02:53:42,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 268. [2022-11-22 02:53:42,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 192 states have (on average 1.8697916666666667) internal successors, (359), 257 states have internal predecessors, (359), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:53:42,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 375 transitions. [2022-11-22 02:53:42,831 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 375 transitions. Word has length 9 [2022-11-22 02:53:42,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:53:42,832 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 375 transitions. [2022-11-22 02:53:42,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:53:42,832 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 375 transitions. [2022-11-22 02:53:42,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 02:53:42,833 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:53:42,833 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:53:42,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-22 02:53:43,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:43,057 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:53:43,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:53:43,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1288896398, now seen corresponding path program 1 times [2022-11-22 02:53:43,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:53:43,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629321595] [2022-11-22 02:53:43,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:53:43,058 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:43,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:53:43,060 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:53:43,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-22 02:53:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:53:43,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-22 02:53:43,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:53:43,261 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-22 02:53:43,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:53:43,261 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:53:43,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629321595] [2022-11-22 02:53:43,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629321595] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:53:43,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:53:43,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:53:43,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195433903] [2022-11-22 02:53:43,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:53:43,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:53:43,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:53:43,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:53:43,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:53:43,264 INFO L87 Difference]: Start difference. First operand 268 states and 375 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:44,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:53:44,109 INFO L93 Difference]: Finished difference Result 464 states and 570 transitions. [2022-11-22 02:53:44,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:53:44,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-11-22 02:53:44,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:53:44,115 INFO L225 Difference]: With dead ends: 464 [2022-11-22 02:53:44,115 INFO L226 Difference]: Without dead ends: 464 [2022-11-22 02:53:44,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-22 02:53:44,116 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 294 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-22 02:53:44,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 399 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-22 02:53:44,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-11-22 02:53:44,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 274. [2022-11-22 02:53:44,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 198 states have (on average 1.8434343434343434) internal successors, (365), 263 states have internal predecessors, (365), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:53:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 381 transitions. [2022-11-22 02:53:44,133 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 381 transitions. Word has length 11 [2022-11-22 02:53:44,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:53:44,133 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 381 transitions. [2022-11-22 02:53:44,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:44,134 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 381 transitions. [2022-11-22 02:53:44,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 02:53:44,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:53:44,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:53:44,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-22 02:53:44,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:44,340 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:53:44,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:53:44,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1288896399, now seen corresponding path program 1 times [2022-11-22 02:53:44,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:53:44,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777745904] [2022-11-22 02:53:44,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:53:44,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:44,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:53:44,342 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:53:44,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-22 02:53:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:53:44,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-22 02:53:44,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:53:44,596 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-22 02:53:44,596 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:53:44,597 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:53:44,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777745904] [2022-11-22 02:53:44,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777745904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:53:44,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:53:44,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:53:44,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528829632] [2022-11-22 02:53:44,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:53:44,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:53:44,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:53:44,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:53:44,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:53:44,600 INFO L87 Difference]: Start difference. First operand 274 states and 381 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:45,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:53:45,201 INFO L93 Difference]: Finished difference Result 369 states and 487 transitions. [2022-11-22 02:53:45,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:53:45,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-11-22 02:53:45,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:53:45,210 INFO L225 Difference]: With dead ends: 369 [2022-11-22 02:53:45,210 INFO L226 Difference]: Without dead ends: 369 [2022-11-22 02:53:45,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-22 02:53:45,211 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 329 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:53:45,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 235 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 02:53:45,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-11-22 02:53:45,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 271. [2022-11-22 02:53:45,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 198 states have (on average 1.7828282828282829) internal successors, (353), 260 states have internal predecessors, (353), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:53:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 369 transitions. [2022-11-22 02:53:45,221 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 369 transitions. Word has length 11 [2022-11-22 02:53:45,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:53:45,222 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 369 transitions. [2022-11-22 02:53:45,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:45,222 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 369 transitions. [2022-11-22 02:53:45,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 02:53:45,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:53:45,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:53:45,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-11-22 02:53:45,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:45,436 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:53:45,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:53:45,436 INFO L85 PathProgramCache]: Analyzing trace with hash -932834860, now seen corresponding path program 1 times [2022-11-22 02:53:45,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:53:45,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4432264] [2022-11-22 02:53:45,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:53:45,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:45,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:53:45,438 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:53:45,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-22 02:53:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:53:45,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-22 02:53:45,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:53:45,511 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-22 02:53:45,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:53:45,512 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:53:45,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4432264] [2022-11-22 02:53:45,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4432264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:53:45,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:53:45,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:53:45,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817073066] [2022-11-22 02:53:45,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:53:45,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:53:45,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:53:45,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:53:45,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:53:45,513 INFO L87 Difference]: Start difference. First operand 271 states and 369 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:53:45,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:53:45,782 INFO L93 Difference]: Finished difference Result 313 states and 410 transitions. [2022-11-22 02:53:45,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:53:45,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-22 02:53:45,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:53:45,784 INFO L225 Difference]: With dead ends: 313 [2022-11-22 02:53:45,784 INFO L226 Difference]: Without dead ends: 306 [2022-11-22 02:53:45,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-22 02:53:45,785 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 56 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:53:45,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 250 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:53:45,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-22 02:53:45,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 268. [2022-11-22 02:53:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 195 states have (on average 1.7846153846153847) internal successors, (348), 257 states have internal predecessors, (348), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:53:45,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 364 transitions. [2022-11-22 02:53:45,811 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 364 transitions. Word has length 10 [2022-11-22 02:53:45,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:53:45,812 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 364 transitions. [2022-11-22 02:53:45,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:53:45,814 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 364 transitions. [2022-11-22 02:53:45,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 02:53:45,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:53:45,817 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:53:45,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-22 02:53:46,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:46,027 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:53:46,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:53:46,028 INFO L85 PathProgramCache]: Analyzing trace with hash -2026670439, now seen corresponding path program 1 times [2022-11-22 02:53:46,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:53:46,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796415940] [2022-11-22 02:53:46,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:53:46,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:46,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:53:46,030 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:53:46,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-22 02:53:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:53:46,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-22 02:53:46,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:53:46,195 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-22 02:53:46,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-22 02:53:46,250 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-22 02:53:46,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:53:46,250 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:53:46,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796415940] [2022-11-22 02:53:46,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796415940] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:53:46,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:53:46,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:53:46,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205901730] [2022-11-22 02:53:46,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:53:46,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:53:46,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:53:46,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:53:46,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:53:46,253 INFO L87 Difference]: Start difference. First operand 268 states and 364 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:46,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:53:46,942 INFO L93 Difference]: Finished difference Result 481 states and 574 transitions. [2022-11-22 02:53:46,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:53:46,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-22 02:53:46,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:53:46,945 INFO L225 Difference]: With dead ends: 481 [2022-11-22 02:53:46,945 INFO L226 Difference]: Without dead ends: 481 [2022-11-22 02:53:46,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-22 02:53:46,946 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 357 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:53:46,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 378 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 02:53:46,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-11-22 02:53:46,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 287. [2022-11-22 02:53:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 214 states have (on average 1.8037383177570094) internal successors, (386), 276 states have internal predecessors, (386), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-22 02:53:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 402 transitions. [2022-11-22 02:53:46,965 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 402 transitions. Word has length 14 [2022-11-22 02:53:46,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:53:46,965 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 402 transitions. [2022-11-22 02:53:46,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:46,966 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 402 transitions. [2022-11-22 02:53:46,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 02:53:46,966 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:53:46,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:53:46,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-22 02:53:47,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:47,178 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:53:47,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:53:47,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2026670438, now seen corresponding path program 1 times [2022-11-22 02:53:47,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:53:47,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137837410] [2022-11-22 02:53:47,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:53:47,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:47,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:53:47,181 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:53:47,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-22 02:53:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:53:47,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-22 02:53:47,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:53:47,416 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:53:47,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-22 02:53:47,479 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-22 02:53:47,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:53:47,479 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:53:47,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137837410] [2022-11-22 02:53:47,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137837410] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:53:47,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:53:47,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:53:47,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794707621] [2022-11-22 02:53:47,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:53:47,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:53:47,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:53:47,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:53:47,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:53:47,482 INFO L87 Difference]: Start difference. First operand 287 states and 402 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:48,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:53:48,649 INFO L93 Difference]: Finished difference Result 582 states and 798 transitions. [2022-11-22 02:53:48,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 02:53:48,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-22 02:53:48,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:53:48,652 INFO L225 Difference]: With dead ends: 582 [2022-11-22 02:53:48,652 INFO L226 Difference]: Without dead ends: 582 [2022-11-22 02:53:48,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:53:48,653 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 437 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:53:48,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 654 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-22 02:53:48,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-11-22 02:53:48,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 345. [2022-11-22 02:53:48,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 268 states have (on average 1.7798507462686568) internal successors, (477), 332 states have internal predecessors, (477), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-22 02:53:48,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 501 transitions. [2022-11-22 02:53:48,667 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 501 transitions. Word has length 14 [2022-11-22 02:53:48,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:53:48,667 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 501 transitions. [2022-11-22 02:53:48,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:48,668 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 501 transitions. [2022-11-22 02:53:48,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 02:53:48,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:53:48,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:53:48,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-22 02:53:48,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:48,888 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:53:48,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:53:48,888 INFO L85 PathProgramCache]: Analyzing trace with hash 460842395, now seen corresponding path program 1 times [2022-11-22 02:53:48,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:53:48,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060096053] [2022-11-22 02:53:48,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:53:48,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:48,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:53:48,890 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:53:48,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-22 02:53:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:53:48,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-22 02:53:48,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:53:49,004 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-22 02:53:49,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:53:49,005 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:53:49,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060096053] [2022-11-22 02:53:49,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060096053] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:53:49,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:53:49,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 02:53:49,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079413767] [2022-11-22 02:53:49,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:53:49,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:53:49,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:53:49,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:53:49,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:53:49,007 INFO L87 Difference]: Start difference. First operand 345 states and 501 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:49,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:53:49,200 INFO L93 Difference]: Finished difference Result 543 states and 760 transitions. [2022-11-22 02:53:49,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:53:49,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-22 02:53:49,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:53:49,203 INFO L225 Difference]: With dead ends: 543 [2022-11-22 02:53:49,203 INFO L226 Difference]: Without dead ends: 543 [2022-11-22 02:53:49,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:53:49,204 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 226 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:53:49,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1354 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:53:49,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-11-22 02:53:49,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 345. [2022-11-22 02:53:49,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 268 states have (on average 1.7723880597014925) internal successors, (475), 332 states have internal predecessors, (475), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-22 02:53:49,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 499 transitions. [2022-11-22 02:53:49,218 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 499 transitions. Word has length 14 [2022-11-22 02:53:49,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:53:49,218 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 499 transitions. [2022-11-22 02:53:49,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:49,218 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 499 transitions. [2022-11-22 02:53:49,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 02:53:49,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:53:49,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:53:49,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-22 02:53:49,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:49,431 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:53:49,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:53:49,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1401267931, now seen corresponding path program 1 times [2022-11-22 02:53:49,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:53:49,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577340732] [2022-11-22 02:53:49,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:53:49,432 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:49,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:53:49,433 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:53:49,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-22 02:53:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:53:49,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-22 02:53:49,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:53:49,649 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:53:49,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-22 02:53:49,726 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-22 02:53:49,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:53:49,726 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:53:49,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577340732] [2022-11-22 02:53:49,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577340732] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:53:49,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:53:49,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:53:49,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346186426] [2022-11-22 02:53:49,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:53:49,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:53:49,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:53:49,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:53:49,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:53:49,728 INFO L87 Difference]: Start difference. First operand 345 states and 499 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:50,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:53:50,988 INFO L93 Difference]: Finished difference Result 601 states and 829 transitions. [2022-11-22 02:53:50,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 02:53:50,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-22 02:53:50,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:53:50,991 INFO L225 Difference]: With dead ends: 601 [2022-11-22 02:53:50,992 INFO L226 Difference]: Without dead ends: 601 [2022-11-22 02:53:50,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:53:50,993 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 432 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:53:50,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 740 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-22 02:53:50,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-11-22 02:53:51,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 322. [2022-11-22 02:53:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 245 states have (on average 1.7591836734693878) internal successors, (431), 309 states have internal predecessors, (431), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-22 02:53:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 455 transitions. [2022-11-22 02:53:51,005 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 455 transitions. Word has length 15 [2022-11-22 02:53:51,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:53:51,006 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 455 transitions. [2022-11-22 02:53:51,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:51,006 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 455 transitions. [2022-11-22 02:53:51,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 02:53:51,006 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:53:51,007 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:53:51,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-22 02:53:51,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:51,217 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:53:51,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:53:51,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1947035922, now seen corresponding path program 1 times [2022-11-22 02:53:51,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:53:51,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470523581] [2022-11-22 02:53:51,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:53:51,218 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:51,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:53:51,219 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:53:51,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-22 02:53:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:53:51,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-22 02:53:51,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:53:51,652 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:53:51,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2022-11-22 02:53:51,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:53:51,664 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:53:51,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 13 [2022-11-22 02:53:51,715 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-22 02:53:51,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:53:51,716 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:53:51,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470523581] [2022-11-22 02:53:51,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470523581] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:53:51,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:53:51,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-22 02:53:51,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289748143] [2022-11-22 02:53:51,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:53:51,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 02:53:51,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:53:51,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 02:53:51,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:53:51,717 INFO L87 Difference]: Start difference. First operand 322 states and 455 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:53,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:53:53,257 INFO L93 Difference]: Finished difference Result 663 states and 922 transitions. [2022-11-22 02:53:53,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 02:53:53,259 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-22 02:53:53,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:53:53,261 INFO L225 Difference]: With dead ends: 663 [2022-11-22 02:53:53,262 INFO L226 Difference]: Without dead ends: 663 [2022-11-22 02:53:53,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-11-22 02:53:53,262 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 392 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:53:53,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1352 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-22 02:53:53,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2022-11-22 02:53:53,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 316. [2022-11-22 02:53:53,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 239 states have (on average 1.7573221757322175) internal successors, (420), 303 states have internal predecessors, (420), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-22 02:53:53,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 444 transitions. [2022-11-22 02:53:53,282 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 444 transitions. Word has length 17 [2022-11-22 02:53:53,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:53:53,284 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 444 transitions. [2022-11-22 02:53:53,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:53,285 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 444 transitions. [2022-11-22 02:53:53,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 02:53:53,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:53:53,287 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:53:53,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-22 02:53:53,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:53,498 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:53:53,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:53:53,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1023398879, now seen corresponding path program 1 times [2022-11-22 02:53:53,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:53:53,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162222401] [2022-11-22 02:53:53,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:53:53,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:53,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:53:53,500 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:53:53,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-22 02:53:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:53:53,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-22 02:53:53,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:53:53,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:53:53,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 02:53:53,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:53:53,779 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:53:53,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-11-22 02:53:53,811 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-22 02:53:53,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:53:53,811 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:53:53,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162222401] [2022-11-22 02:53:53,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162222401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:53:53,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:53:53,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-22 02:53:53,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593946549] [2022-11-22 02:53:53,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:53:53,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 02:53:53,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:53:53,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 02:53:53,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:53:53,813 INFO L87 Difference]: Start difference. First operand 316 states and 444 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:54,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:53:54,636 INFO L93 Difference]: Finished difference Result 455 states and 608 transitions. [2022-11-22 02:53:54,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 02:53:54,637 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-11-22 02:53:54,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:53:54,639 INFO L225 Difference]: With dead ends: 455 [2022-11-22 02:53:54,639 INFO L226 Difference]: Without dead ends: 455 [2022-11-22 02:53:54,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-22 02:53:54,640 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 135 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:53:54,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 894 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 02:53:54,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-11-22 02:53:54,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 338. [2022-11-22 02:53:54,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 261 states have (on average 1.7126436781609196) internal successors, (447), 323 states have internal predecessors, (447), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-22 02:53:54,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 471 transitions. [2022-11-22 02:53:54,663 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 471 transitions. Word has length 18 [2022-11-22 02:53:54,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:53:54,664 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 471 transitions. [2022-11-22 02:53:54,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:54,664 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 471 transitions. [2022-11-22 02:53:54,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 02:53:54,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:53:54,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:53:54,684 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-22 02:53:54,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:54,877 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:53:54,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:53:54,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1496579075, now seen corresponding path program 1 times [2022-11-22 02:53:54,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:53:54,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990058127] [2022-11-22 02:53:54,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:53:54,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:54,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:53:54,880 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:53:54,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-22 02:53:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:53:54,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 02:53:54,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:53:55,049 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-22 02:53:55,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:53:55,049 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:53:55,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990058127] [2022-11-22 02:53:55,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1990058127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:53:55,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:53:55,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:53:55,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623033989] [2022-11-22 02:53:55,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:53:55,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:53:55,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:53:55,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:53:55,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:53:55,050 INFO L87 Difference]: Start difference. First operand 338 states and 471 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:55,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:53:55,703 INFO L93 Difference]: Finished difference Result 547 states and 697 transitions. [2022-11-22 02:53:55,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:53:55,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-11-22 02:53:55,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:53:55,705 INFO L225 Difference]: With dead ends: 547 [2022-11-22 02:53:55,706 INFO L226 Difference]: Without dead ends: 547 [2022-11-22 02:53:55,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-22 02:53:55,706 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 270 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:53:55,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 414 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 02:53:55,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-11-22 02:53:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 352. [2022-11-22 02:53:55,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 275 states have (on average 1.7272727272727273) internal successors, (475), 337 states have internal predecessors, (475), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-22 02:53:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 499 transitions. [2022-11-22 02:53:55,718 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 499 transitions. Word has length 19 [2022-11-22 02:53:55,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:53:55,719 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 499 transitions. [2022-11-22 02:53:55,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:55,719 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 499 transitions. [2022-11-22 02:53:55,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 02:53:55,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:53:55,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:53:55,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-22 02:53:55,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:55,931 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:53:55,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:53:55,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1496579074, now seen corresponding path program 1 times [2022-11-22 02:53:55,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:53:55,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046829280] [2022-11-22 02:53:55,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:53:55,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:55,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:53:55,933 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:53:55,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-22 02:53:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:53:56,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-22 02:53:56,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:53:56,185 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-22 02:53:56,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:53:56,186 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:53:56,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046829280] [2022-11-22 02:53:56,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046829280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:53:56,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:53:56,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:53:56,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198407891] [2022-11-22 02:53:56,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:53:56,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:53:56,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:53:56,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:53:56,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:53:56,187 INFO L87 Difference]: Start difference. First operand 352 states and 499 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:56,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:53:56,718 INFO L93 Difference]: Finished difference Result 476 states and 652 transitions. [2022-11-22 02:53:56,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:53:56,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-11-22 02:53:56,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:53:56,721 INFO L225 Difference]: With dead ends: 476 [2022-11-22 02:53:56,721 INFO L226 Difference]: Without dead ends: 476 [2022-11-22 02:53:56,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-22 02:53:56,722 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 324 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:53:56,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 228 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 02:53:56,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-11-22 02:53:56,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 349. [2022-11-22 02:53:56,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 275 states have (on average 1.6836363636363636) internal successors, (463), 334 states have internal predecessors, (463), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-22 02:53:56,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 487 transitions. [2022-11-22 02:53:56,732 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 487 transitions. Word has length 19 [2022-11-22 02:53:56,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:53:56,733 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 487 transitions. [2022-11-22 02:53:56,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:56,733 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 487 transitions. [2022-11-22 02:53:56,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 02:53:56,734 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:53:56,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:53:56,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-22 02:53:56,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:56,945 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:53:56,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:53:56,945 INFO L85 PathProgramCache]: Analyzing trace with hash 944634784, now seen corresponding path program 1 times [2022-11-22 02:53:56,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:53:56,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139934257] [2022-11-22 02:53:56,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:53:56,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:56,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:53:56,947 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:53:56,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-22 02:53:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:53:57,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-22 02:53:57,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:53:57,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:53:57,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 02:53:57,235 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:53:57,238 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:53:57,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-11-22 02:53:57,268 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-22 02:53:57,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:53:57,268 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:53:57,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139934257] [2022-11-22 02:53:57,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [139934257] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:53:57,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:53:57,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-22 02:53:57,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144361865] [2022-11-22 02:53:57,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:53:57,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 02:53:57,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:53:57,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 02:53:57,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:53:57,269 INFO L87 Difference]: Start difference. First operand 349 states and 487 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:58,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:53:58,271 INFO L93 Difference]: Finished difference Result 425 states and 562 transitions. [2022-11-22 02:53:58,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 02:53:58,272 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-11-22 02:53:58,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:53:58,274 INFO L225 Difference]: With dead ends: 425 [2022-11-22 02:53:58,274 INFO L226 Difference]: Without dead ends: 425 [2022-11-22 02:53:58,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-22 02:53:58,275 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 112 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-22 02:53:58,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1000 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-22 02:53:58,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-11-22 02:53:58,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 357. [2022-11-22 02:53:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 283 states have (on average 1.6643109540636043) internal successors, (471), 340 states have internal predecessors, (471), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-22 02:53:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 495 transitions. [2022-11-22 02:53:58,284 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 495 transitions. Word has length 19 [2022-11-22 02:53:58,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:53:58,285 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 495 transitions. [2022-11-22 02:53:58,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 495 transitions. [2022-11-22 02:53:58,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 02:53:58,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:53:58,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:53:58,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-22 02:53:58,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:58,497 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:53:58,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:53:58,498 INFO L85 PathProgramCache]: Analyzing trace with hash -52498928, now seen corresponding path program 1 times [2022-11-22 02:53:58,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:53:58,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141244339] [2022-11-22 02:53:58,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:53:58,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:58,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:53:58,500 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:53:58,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-22 02:53:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:53:58,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 02:53:58,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:53:58,604 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-22 02:53:58,634 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-22 02:53:58,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:53:58,635 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:53:58,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141244339] [2022-11-22 02:53:58,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141244339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:53:58,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:53:58,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:53:58,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006004693] [2022-11-22 02:53:58,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:53:58,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:53:58,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:53:58,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:53:58,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:53:58,638 INFO L87 Difference]: Start difference. First operand 357 states and 495 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:53:58,915 INFO L93 Difference]: Finished difference Result 437 states and 586 transitions. [2022-11-22 02:53:58,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:53:58,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-22 02:53:58,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:53:58,917 INFO L225 Difference]: With dead ends: 437 [2022-11-22 02:53:58,917 INFO L226 Difference]: Without dead ends: 437 [2022-11-22 02:53:58,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-22 02:53:58,918 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 133 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:53:58,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 245 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:53:58,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-11-22 02:53:58,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 355. [2022-11-22 02:53:58,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 283 states have (on average 1.6360424028268552) internal successors, (463), 338 states have internal predecessors, (463), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-22 02:53:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 487 transitions. [2022-11-22 02:53:58,928 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 487 transitions. Word has length 20 [2022-11-22 02:53:58,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:53:58,929 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 487 transitions. [2022-11-22 02:53:58,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:58,929 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 487 transitions. [2022-11-22 02:53:58,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 02:53:58,929 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:53:58,930 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:53:58,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-22 02:53:59,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:59,142 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:53:59,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:53:59,142 INFO L85 PathProgramCache]: Analyzing trace with hash -52498927, now seen corresponding path program 1 times [2022-11-22 02:53:59,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:53:59,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388009078] [2022-11-22 02:53:59,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:53:59,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:53:59,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:53:59,144 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:53:59,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-22 02:53:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:53:59,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 02:53:59,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:53:59,259 INFO L350 Elim1Store]: Elim1 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-22 02:53:59,350 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-22 02:53:59,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:53:59,350 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:53:59,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388009078] [2022-11-22 02:53:59,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388009078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:53:59,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:53:59,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:53:59,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092987628] [2022-11-22 02:53:59,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:53:59,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:53:59,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:53:59,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:53:59,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:53:59,352 INFO L87 Difference]: Start difference. First operand 355 states and 487 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:53:59,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:53:59,990 INFO L93 Difference]: Finished difference Result 693 states and 938 transitions. [2022-11-22 02:53:59,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:53:59,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-22 02:53:59,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:53:59,994 INFO L225 Difference]: With dead ends: 693 [2022-11-22 02:53:59,994 INFO L226 Difference]: Without dead ends: 693 [2022-11-22 02:53:59,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:53:59,995 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 439 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:53:59,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 381 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 02:53:59,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2022-11-22 02:54:00,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 415. [2022-11-22 02:54:00,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 343 states have (on average 1.6326530612244898) internal successors, (560), 398 states have internal predecessors, (560), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-22 02:54:00,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 584 transitions. [2022-11-22 02:54:00,007 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 584 transitions. Word has length 20 [2022-11-22 02:54:00,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:00,007 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 584 transitions. [2022-11-22 02:54:00,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:00,008 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 584 transitions. [2022-11-22 02:54:00,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 02:54:00,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:00,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:00,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:00,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:00,220 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:00,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:00,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2075151283, now seen corresponding path program 1 times [2022-11-22 02:54:00,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:00,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260426073] [2022-11-22 02:54:00,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:00,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:00,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:00,222 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:00,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-22 02:54:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:00,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-22 02:54:00,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:00,337 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-22 02:54:00,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:00,338 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:00,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260426073] [2022-11-22 02:54:00,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260426073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:00,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:00,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 02:54:00,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898347945] [2022-11-22 02:54:00,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:00,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:54:00,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:00,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:54:00,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:54:00,340 INFO L87 Difference]: Start difference. First operand 415 states and 584 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:00,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:00,501 INFO L93 Difference]: Finished difference Result 609 states and 832 transitions. [2022-11-22 02:54:00,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:54:00,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-11-22 02:54:00,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:00,504 INFO L225 Difference]: With dead ends: 609 [2022-11-22 02:54:00,504 INFO L226 Difference]: Without dead ends: 609 [2022-11-22 02:54:00,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:54:00,504 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 214 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:00,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1101 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:54:00,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2022-11-22 02:54:00,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 415. [2022-11-22 02:54:00,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 343 states have (on average 1.620991253644315) internal successors, (556), 398 states have internal predecessors, (556), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-22 02:54:00,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 580 transitions. [2022-11-22 02:54:00,515 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 580 transitions. Word has length 21 [2022-11-22 02:54:00,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:00,516 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 580 transitions. [2022-11-22 02:54:00,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:00,516 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 580 transitions. [2022-11-22 02:54:00,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 02:54:00,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:00,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:00,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:00,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:00,728 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:00,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:00,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1564617106, now seen corresponding path program 1 times [2022-11-22 02:54:00,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:00,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754710983] [2022-11-22 02:54:00,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:00,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:00,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:00,729 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:00,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-22 02:54:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:00,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 02:54:00,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:00,817 INFO L350 Elim1Store]: Elim1 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-22 02:54:00,920 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-22 02:54:00,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:00,921 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:00,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754710983] [2022-11-22 02:54:00,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754710983] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:00,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:00,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:54:00,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817897259] [2022-11-22 02:54:00,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:00,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:54:00,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:00,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:54:00,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:54:00,923 INFO L87 Difference]: Start difference. First operand 415 states and 580 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:01,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:01,628 INFO L93 Difference]: Finished difference Result 753 states and 1031 transitions. [2022-11-22 02:54:01,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:54:01,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-11-22 02:54:01,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:01,634 INFO L225 Difference]: With dead ends: 753 [2022-11-22 02:54:01,634 INFO L226 Difference]: Without dead ends: 753 [2022-11-22 02:54:01,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:54:01,635 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 291 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:01,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 484 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 02:54:01,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2022-11-22 02:54:01,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 415. [2022-11-22 02:54:01,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 343 states have (on average 1.620991253644315) internal successors, (556), 398 states have internal predecessors, (556), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-22 02:54:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 580 transitions. [2022-11-22 02:54:01,645 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 580 transitions. Word has length 21 [2022-11-22 02:54:01,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:01,645 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 580 transitions. [2022-11-22 02:54:01,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:01,646 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 580 transitions. [2022-11-22 02:54:01,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 02:54:01,646 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:01,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:01,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:01,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:01,858 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:01,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:01,858 INFO L85 PathProgramCache]: Analyzing trace with hash -2050291820, now seen corresponding path program 1 times [2022-11-22 02:54:01,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:01,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955611173] [2022-11-22 02:54:01,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:01,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:01,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:01,860 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:01,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-22 02:54:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:01,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-22 02:54:01,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:01,987 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-22 02:54:01,988 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:01,988 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:01,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955611173] [2022-11-22 02:54:01,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1955611173] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:01,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:01,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 02:54:01,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980206344] [2022-11-22 02:54:01,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:01,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:54:01,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:01,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:54:01,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:54:01,990 INFO L87 Difference]: Start difference. First operand 415 states and 580 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:02,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:02,156 INFO L93 Difference]: Finished difference Result 604 states and 820 transitions. [2022-11-22 02:54:02,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:54:02,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-11-22 02:54:02,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:02,159 INFO L225 Difference]: With dead ends: 604 [2022-11-22 02:54:02,159 INFO L226 Difference]: Without dead ends: 604 [2022-11-22 02:54:02,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:54:02,159 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 215 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:02,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 1306 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:54:02,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2022-11-22 02:54:02,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 354. [2022-11-22 02:54:02,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 283 states have (on average 1.5936395759717314) internal successors, (451), 337 states have internal predecessors, (451), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-22 02:54:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 475 transitions. [2022-11-22 02:54:02,170 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 475 transitions. Word has length 21 [2022-11-22 02:54:02,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:02,172 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 475 transitions. [2022-11-22 02:54:02,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 475 transitions. [2022-11-22 02:54:02,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 02:54:02,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:02,173 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:02,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:02,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:02,379 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:02,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:02,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1468431264, now seen corresponding path program 1 times [2022-11-22 02:54:02,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:02,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458107287] [2022-11-22 02:54:02,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:02,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:02,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:02,382 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:02,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-22 02:54:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:02,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-22 02:54:02,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:02,717 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-22 02:54:02,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:02,717 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:02,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458107287] [2022-11-22 02:54:02,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458107287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:02,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:02,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:54:02,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418806070] [2022-11-22 02:54:02,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:02,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:54:02,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:02,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:54:02,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:54:02,719 INFO L87 Difference]: Start difference. First operand 354 states and 475 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:03,711 INFO L93 Difference]: Finished difference Result 692 states and 936 transitions. [2022-11-22 02:54:03,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 02:54:03,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-11-22 02:54:03,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:03,715 INFO L225 Difference]: With dead ends: 692 [2022-11-22 02:54:03,715 INFO L226 Difference]: Without dead ends: 692 [2022-11-22 02:54:03,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:54:03,716 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 432 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:03,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 537 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-22 02:54:03,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2022-11-22 02:54:03,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 420. [2022-11-22 02:54:03,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 349 states have (on average 1.5702005730659025) internal successors, (548), 399 states have internal predecessors, (548), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 16 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-22 02:54:03,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 572 transitions. [2022-11-22 02:54:03,726 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 572 transitions. Word has length 22 [2022-11-22 02:54:03,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:03,726 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 572 transitions. [2022-11-22 02:54:03,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:03,727 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 572 transitions. [2022-11-22 02:54:03,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 02:54:03,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:03,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:03,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:03,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:03,939 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:03,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:03,939 INFO L85 PathProgramCache]: Analyzing trace with hash 957897087, now seen corresponding path program 1 times [2022-11-22 02:54:03,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:03,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19015524] [2022-11-22 02:54:03,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:03,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:03,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:03,942 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:03,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-22 02:54:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:04,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-22 02:54:04,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:04,251 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-22 02:54:04,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:04,251 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:04,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19015524] [2022-11-22 02:54:04,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19015524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:04,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:04,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:54:04,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538681113] [2022-11-22 02:54:04,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:04,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:54:04,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:04,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:54:04,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:54:04,252 INFO L87 Difference]: Start difference. First operand 420 states and 572 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:05,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:05,256 INFO L93 Difference]: Finished difference Result 690 states and 932 transitions. [2022-11-22 02:54:05,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 02:54:05,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-11-22 02:54:05,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:05,271 INFO L225 Difference]: With dead ends: 690 [2022-11-22 02:54:05,271 INFO L226 Difference]: Without dead ends: 690 [2022-11-22 02:54:05,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:54:05,272 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 350 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:05,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 678 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-22 02:54:05,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-11-22 02:54:05,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 352. [2022-11-22 02:54:05,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 283 states have (on average 1.5795053003533568) internal successors, (447), 335 states have internal predecessors, (447), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-22 02:54:05,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 471 transitions. [2022-11-22 02:54:05,282 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 471 transitions. Word has length 22 [2022-11-22 02:54:05,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:05,282 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 471 transitions. [2022-11-22 02:54:05,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:05,283 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 471 transitions. [2022-11-22 02:54:05,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 02:54:05,283 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:05,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:05,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:05,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:05,495 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:05,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:05,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1088139633, now seen corresponding path program 1 times [2022-11-22 02:54:05,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:05,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538587182] [2022-11-22 02:54:05,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:05,496 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:05,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:05,498 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:05,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-22 02:54:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:05,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-22 02:54:05,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:05,680 INFO L350 Elim1Store]: Elim1 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-22 02:54:05,682 INFO L350 Elim1Store]: Elim1 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-22 02:54:05,722 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-22 02:54:05,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:05,723 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:05,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538587182] [2022-11-22 02:54:05,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538587182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:05,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:05,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-22 02:54:05,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669428786] [2022-11-22 02:54:05,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:05,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:54:05,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:05,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:54:05,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:54:05,725 INFO L87 Difference]: Start difference. First operand 352 states and 471 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:06,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:06,525 INFO L93 Difference]: Finished difference Result 533 states and 704 transitions. [2022-11-22 02:54:06,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 02:54:06,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-11-22 02:54:06,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:06,528 INFO L225 Difference]: With dead ends: 533 [2022-11-22 02:54:06,528 INFO L226 Difference]: Without dead ends: 533 [2022-11-22 02:54:06,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-22 02:54:06,528 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 137 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:06,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1167 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 02:54:06,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-11-22 02:54:06,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 380. [2022-11-22 02:54:06,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 311 states have (on average 1.5562700964630225) internal successors, (484), 363 states have internal predecessors, (484), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-22 02:54:06,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 508 transitions. [2022-11-22 02:54:06,539 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 508 transitions. Word has length 22 [2022-11-22 02:54:06,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:06,540 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 508 transitions. [2022-11-22 02:54:06,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:06,540 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 508 transitions. [2022-11-22 02:54:06,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 02:54:06,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:06,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:06,557 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:06,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:06,752 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:06,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:06,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1088139827, now seen corresponding path program 1 times [2022-11-22 02:54:06,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:06,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316903888] [2022-11-22 02:54:06,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:06,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:06,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:06,755 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:06,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-22 02:54:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:06,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 02:54:06,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:06,851 INFO L350 Elim1Store]: Elim1 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-22 02:54:06,964 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-22 02:54:06,964 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:06,964 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:06,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316903888] [2022-11-22 02:54:06,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316903888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:06,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:06,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:54:06,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643301685] [2022-11-22 02:54:06,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:06,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:54:06,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:06,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:54:06,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:54:06,965 INFO L87 Difference]: Start difference. First operand 380 states and 508 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:07,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:07,510 INFO L93 Difference]: Finished difference Result 741 states and 980 transitions. [2022-11-22 02:54:07,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:54:07,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-11-22 02:54:07,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:07,514 INFO L225 Difference]: With dead ends: 741 [2022-11-22 02:54:07,514 INFO L226 Difference]: Without dead ends: 741 [2022-11-22 02:54:07,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:54:07,515 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 427 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:07,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 379 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 02:54:07,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2022-11-22 02:54:07,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 476. [2022-11-22 02:54:07,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 407 states have (on average 1.5577395577395576) internal successors, (634), 459 states have internal predecessors, (634), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-22 02:54:07,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 658 transitions. [2022-11-22 02:54:07,527 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 658 transitions. Word has length 22 [2022-11-22 02:54:07,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:07,527 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 658 transitions. [2022-11-22 02:54:07,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:07,527 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 658 transitions. [2022-11-22 02:54:07,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-22 02:54:07,528 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:07,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:07,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:07,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:07,740 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:07,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:07,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1723293756, now seen corresponding path program 1 times [2022-11-22 02:54:07,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:07,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115408370] [2022-11-22 02:54:07,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:07,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:07,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:07,746 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:07,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-11-22 02:54:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:07,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-22 02:54:07,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:07,946 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:54:07,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 02:54:07,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:54:07,953 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:54:07,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-11-22 02:54:08,019 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-22 02:54:08,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:08,020 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:08,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115408370] [2022-11-22 02:54:08,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115408370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:08,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:08,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-22 02:54:08,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015053937] [2022-11-22 02:54:08,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:08,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 02:54:08,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:08,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 02:54:08,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:54:08,021 INFO L87 Difference]: Start difference. First operand 476 states and 658 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:08,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:08,804 INFO L93 Difference]: Finished difference Result 625 states and 841 transitions. [2022-11-22 02:54:08,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 02:54:08,805 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-11-22 02:54:08,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:08,808 INFO L225 Difference]: With dead ends: 625 [2022-11-22 02:54:08,808 INFO L226 Difference]: Without dead ends: 625 [2022-11-22 02:54:08,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-22 02:54:08,809 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 285 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:08,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 1440 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 02:54:08,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-11-22 02:54:08,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 419. [2022-11-22 02:54:08,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 354 states have (on average 1.576271186440678) internal successors, (558), 406 states have internal predecessors, (558), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-22 02:54:08,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 576 transitions. [2022-11-22 02:54:08,818 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 576 transitions. Word has length 23 [2022-11-22 02:54:08,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:08,818 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 576 transitions. [2022-11-22 02:54:08,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:08,819 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 576 transitions. [2022-11-22 02:54:08,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-22 02:54:08,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:08,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:08,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:09,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:09,031 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:09,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:09,031 INFO L85 PathProgramCache]: Analyzing trace with hash 358486388, now seen corresponding path program 1 times [2022-11-22 02:54:09,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:09,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310261558] [2022-11-22 02:54:09,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:09,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:09,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:09,033 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:09,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-11-22 02:54:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:09,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 02:54:09,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:09,130 INFO L350 Elim1Store]: Elim1 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-22 02:54:09,237 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-22 02:54:09,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:09,237 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:09,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310261558] [2022-11-22 02:54:09,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310261558] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:09,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:09,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:54:09,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174684266] [2022-11-22 02:54:09,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:09,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:54:09,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:09,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:54:09,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:54:09,238 INFO L87 Difference]: Start difference. First operand 419 states and 576 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:09,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:09,791 INFO L93 Difference]: Finished difference Result 597 states and 788 transitions. [2022-11-22 02:54:09,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:54:09,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-11-22 02:54:09,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:09,795 INFO L225 Difference]: With dead ends: 597 [2022-11-22 02:54:09,795 INFO L226 Difference]: Without dead ends: 597 [2022-11-22 02:54:09,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:54:09,796 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 281 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:09,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 379 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 02:54:09,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-11-22 02:54:09,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 326. [2022-11-22 02:54:09,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 262 states have (on average 1.5458015267175573) internal successors, (405), 313 states have internal predecessors, (405), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-22 02:54:09,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 423 transitions. [2022-11-22 02:54:09,814 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 423 transitions. Word has length 23 [2022-11-22 02:54:09,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:09,815 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 423 transitions. [2022-11-22 02:54:09,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:09,815 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 423 transitions. [2022-11-22 02:54:09,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-22 02:54:09,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:09,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:09,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:10,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:10,027 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:10,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:10,028 INFO L85 PathProgramCache]: Analyzing trace with hash -693515938, now seen corresponding path program 1 times [2022-11-22 02:54:10,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:10,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039542782] [2022-11-22 02:54:10,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:10,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:10,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:10,029 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:10,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-11-22 02:54:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:10,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 02:54:10,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:10,120 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-22 02:54:10,173 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-22 02:54:10,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:10,174 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:10,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039542782] [2022-11-22 02:54:10,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039542782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:10,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:10,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:54:10,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714784520] [2022-11-22 02:54:10,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:10,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:54:10,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:10,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:54:10,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:54:10,176 INFO L87 Difference]: Start difference. First operand 326 states and 423 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:10,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:10,627 INFO L93 Difference]: Finished difference Result 399 states and 506 transitions. [2022-11-22 02:54:10,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:54:10,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-11-22 02:54:10,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:10,629 INFO L225 Difference]: With dead ends: 399 [2022-11-22 02:54:10,629 INFO L226 Difference]: Without dead ends: 399 [2022-11-22 02:54:10,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 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-22 02:54:10,631 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 300 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:10,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 351 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 02:54:10,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-11-22 02:54:10,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 325. [2022-11-22 02:54:10,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 262 states have (on average 1.5381679389312977) internal successors, (403), 312 states have internal predecessors, (403), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-22 02:54:10,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 421 transitions. [2022-11-22 02:54:10,637 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 421 transitions. Word has length 28 [2022-11-22 02:54:10,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:10,638 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 421 transitions. [2022-11-22 02:54:10,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:10,638 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 421 transitions. [2022-11-22 02:54:10,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-22 02:54:10,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:10,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:10,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:10,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:10,850 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:10,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:10,851 INFO L85 PathProgramCache]: Analyzing trace with hash -693515937, now seen corresponding path program 1 times [2022-11-22 02:54:10,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:10,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57981689] [2022-11-22 02:54:10,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:10,851 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:10,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:10,852 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:10,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-11-22 02:54:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:10,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-22 02:54:10,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:10,951 INFO L350 Elim1Store]: Elim1 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-22 02:54:11,073 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-22 02:54:11,073 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:11,073 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:11,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57981689] [2022-11-22 02:54:11,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57981689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:11,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:11,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:54:11,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682998113] [2022-11-22 02:54:11,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:11,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:54:11,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:11,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:54:11,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:54:11,075 INFO L87 Difference]: Start difference. First operand 325 states and 421 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:11,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:11,478 INFO L93 Difference]: Finished difference Result 324 states and 419 transitions. [2022-11-22 02:54:11,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:54:11,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-11-22 02:54:11,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:11,480 INFO L225 Difference]: With dead ends: 324 [2022-11-22 02:54:11,480 INFO L226 Difference]: Without dead ends: 324 [2022-11-22 02:54:11,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:54:11,481 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 330 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:11,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 249 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 02:54:11,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-11-22 02:54:11,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2022-11-22 02:54:11,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 262 states have (on average 1.5305343511450382) internal successors, (401), 311 states have internal predecessors, (401), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-22 02:54:11,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 419 transitions. [2022-11-22 02:54:11,487 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 419 transitions. Word has length 28 [2022-11-22 02:54:11,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:11,488 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 419 transitions. [2022-11-22 02:54:11,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:11,488 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 419 transitions. [2022-11-22 02:54:11,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-22 02:54:11,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:11,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:11,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:11,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:11,700 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:11,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:11,701 INFO L85 PathProgramCache]: Analyzing trace with hash -748882625, now seen corresponding path program 1 times [2022-11-22 02:54:11,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:11,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551551229] [2022-11-22 02:54:11,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:11,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:11,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:11,703 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:11,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-11-22 02:54:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:11,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 02:54:11,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:11,856 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-22 02:54:11,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:11,857 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:11,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551551229] [2022-11-22 02:54:11,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551551229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:11,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:11,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:54:11,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421161134] [2022-11-22 02:54:11,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:11,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:54:11,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:11,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:54:11,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:54:11,862 INFO L87 Difference]: Start difference. First operand 324 states and 419 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:12,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:12,402 INFO L93 Difference]: Finished difference Result 612 states and 749 transitions. [2022-11-22 02:54:12,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:54:12,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-11-22 02:54:12,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:12,406 INFO L225 Difference]: With dead ends: 612 [2022-11-22 02:54:12,406 INFO L226 Difference]: Without dead ends: 612 [2022-11-22 02:54:12,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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-22 02:54:12,407 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 411 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:12,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 314 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 02:54:12,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2022-11-22 02:54:12,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 321. [2022-11-22 02:54:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 262 states have (on average 1.4885496183206106) internal successors, (390), 308 states have internal predecessors, (390), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-22 02:54:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 408 transitions. [2022-11-22 02:54:12,414 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 408 transitions. Word has length 30 [2022-11-22 02:54:12,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:12,415 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 408 transitions. [2022-11-22 02:54:12,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:12,415 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 408 transitions. [2022-11-22 02:54:12,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-22 02:54:12,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:12,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:12,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:12,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:12,628 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:12,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:12,628 INFO L85 PathProgramCache]: Analyzing trace with hash -748882624, now seen corresponding path program 1 times [2022-11-22 02:54:12,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:12,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153267645] [2022-11-22 02:54:12,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:12,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:12,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:12,630 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:12,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-11-22 02:54:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:12,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-22 02:54:12,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:12,940 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-22 02:54:12,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:12,940 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:12,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153267645] [2022-11-22 02:54:12,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153267645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:12,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:12,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:54:12,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377062970] [2022-11-22 02:54:12,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:12,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:54:12,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:12,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:54:12,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:54:12,942 INFO L87 Difference]: Start difference. First operand 321 states and 408 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:13,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:13,990 INFO L93 Difference]: Finished difference Result 728 states and 925 transitions. [2022-11-22 02:54:13,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 02:54:13,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-11-22 02:54:13,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:13,998 INFO L225 Difference]: With dead ends: 728 [2022-11-22 02:54:13,998 INFO L226 Difference]: Without dead ends: 728 [2022-11-22 02:54:13,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-22 02:54:13,999 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 740 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:13,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 689 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-22 02:54:14,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-11-22 02:54:14,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 447. [2022-11-22 02:54:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 388 states have (on average 1.5025773195876289) internal successors, (583), 434 states have internal predecessors, (583), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-22 02:54:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 601 transitions. [2022-11-22 02:54:14,009 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 601 transitions. Word has length 30 [2022-11-22 02:54:14,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:14,009 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 601 transitions. [2022-11-22 02:54:14,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 601 transitions. [2022-11-22 02:54:14,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-22 02:54:14,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:14,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:14,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:14,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:14,222 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:14,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:14,222 INFO L85 PathProgramCache]: Analyzing trace with hash -748882463, now seen corresponding path program 1 times [2022-11-22 02:54:14,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:14,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766456639] [2022-11-22 02:54:14,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:14,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:14,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:14,224 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:14,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-11-22 02:54:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:14,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-22 02:54:14,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:14,425 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:54:14,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-22 02:54:14,578 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-22 02:54:14,578 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:14,578 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:14,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766456639] [2022-11-22 02:54:14,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766456639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:14,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:14,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:54:14,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939598641] [2022-11-22 02:54:14,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:14,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:54:14,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:14,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:54:14,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:54:14,580 INFO L87 Difference]: Start difference. First operand 447 states and 601 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:14,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:14,836 INFO L93 Difference]: Finished difference Result 444 states and 595 transitions. [2022-11-22 02:54:14,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:54:14,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-11-22 02:54:14,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:14,839 INFO L225 Difference]: With dead ends: 444 [2022-11-22 02:54:14,839 INFO L226 Difference]: Without dead ends: 444 [2022-11-22 02:54:14,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-22 02:54:14,840 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 264 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:14,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 140 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:54:14,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-11-22 02:54:14,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 318. [2022-11-22 02:54:14,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 262 states have (on average 1.465648854961832) internal successors, (384), 305 states have internal predecessors, (384), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-22 02:54:14,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 402 transitions. [2022-11-22 02:54:14,846 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 402 transitions. Word has length 30 [2022-11-22 02:54:14,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:14,847 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 402 transitions. [2022-11-22 02:54:14,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:14,847 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 402 transitions. [2022-11-22 02:54:14,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-22 02:54:14,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:14,848 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:14,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Ended with exit code 0 [2022-11-22 02:54:15,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:15,059 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:15,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:15,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1521758729, now seen corresponding path program 1 times [2022-11-22 02:54:15,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:15,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267794426] [2022-11-22 02:54:15,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:15,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:15,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:15,062 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:15,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-11-22 02:54:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:15,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-22 02:54:15,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:15,229 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-22 02:54:15,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 02:54:15,458 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 11 [2022-11-22 02:54:15,503 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-22 02:54:15,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:15,503 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:15,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267794426] [2022-11-22 02:54:15,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1267794426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:15,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:15,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 02:54:15,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495140688] [2022-11-22 02:54:15,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:15,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 02:54:15,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:15,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 02:54:15,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:54:15,504 INFO L87 Difference]: Start difference. First operand 318 states and 402 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:17,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:17,340 INFO L93 Difference]: Finished difference Result 898 states and 1137 transitions. [2022-11-22 02:54:17,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-22 02:54:17,340 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-11-22 02:54:17,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:17,343 INFO L225 Difference]: With dead ends: 898 [2022-11-22 02:54:17,344 INFO L226 Difference]: Without dead ends: 898 [2022-11-22 02:54:17,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-11-22 02:54:17,344 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 488 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:17,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 880 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-22 02:54:17,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2022-11-22 02:54:17,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 438. [2022-11-22 02:54:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 375 states have (on average 1.44) internal successors, (540), 421 states have internal predecessors, (540), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-11-22 02:54:17,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 570 transitions. [2022-11-22 02:54:17,355 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 570 transitions. Word has length 41 [2022-11-22 02:54:17,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:17,355 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 570 transitions. [2022-11-22 02:54:17,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:17,356 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 570 transitions. [2022-11-22 02:54:17,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-22 02:54:17,357 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:17,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:17,369 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:17,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:17,568 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:17,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:17,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1521758728, now seen corresponding path program 1 times [2022-11-22 02:54:17,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:17,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949016745] [2022-11-22 02:54:17,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:17,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:17,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:17,569 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:17,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-11-22 02:54:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:17,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-22 02:54:17,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:17,717 INFO L350 Elim1Store]: Elim1 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-22 02:54:17,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 02:54:17,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 02:54:18,085 INFO L350 Elim1Store]: Elim1 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 9 [2022-11-22 02:54:18,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-11-22 02:54:18,152 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-22 02:54:18,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:18,152 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:18,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949016745] [2022-11-22 02:54:18,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949016745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:18,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:18,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 02:54:18,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126634870] [2022-11-22 02:54:18,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:18,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 02:54:18,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:18,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 02:54:18,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:54:18,154 INFO L87 Difference]: Start difference. First operand 438 states and 570 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:20,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:20,026 INFO L93 Difference]: Finished difference Result 948 states and 1202 transitions. [2022-11-22 02:54:20,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 02:54:20,028 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-11-22 02:54:20,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:20,032 INFO L225 Difference]: With dead ends: 948 [2022-11-22 02:54:20,032 INFO L226 Difference]: Without dead ends: 948 [2022-11-22 02:54:20,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-11-22 02:54:20,032 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 527 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:20,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 926 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-22 02:54:20,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2022-11-22 02:54:20,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 487. [2022-11-22 02:54:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 420 states have (on average 1.4523809523809523) internal successors, (610), 468 states have internal predecessors, (610), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2022-11-22 02:54:20,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 646 transitions. [2022-11-22 02:54:20,042 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 646 transitions. Word has length 41 [2022-11-22 02:54:20,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:20,043 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 646 transitions. [2022-11-22 02:54:20,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:20,043 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 646 transitions. [2022-11-22 02:54:20,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-22 02:54:20,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:20,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:20,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:20,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:20,256 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:20,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:20,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1519911687, now seen corresponding path program 1 times [2022-11-22 02:54:20,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:20,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456322357] [2022-11-22 02:54:20,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:20,257 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:20,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:20,258 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:20,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-11-22 02:54:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:20,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-22 02:54:20,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:20,537 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-22 02:54:20,538 INFO L350 Elim1Store]: Elim1 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 13 [2022-11-22 02:54:20,708 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2022-11-22 02:54:20,721 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2022-11-22 02:54:20,797 INFO L350 Elim1Store]: Elim1 eliminated variable 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-22 02:54:20,808 INFO L350 Elim1Store]: Elim1 eliminated variable 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-22 02:54:20,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-22 02:54:20,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-22 02:54:20,962 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-22 02:54:20,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:20,963 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:20,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456322357] [2022-11-22 02:54:20,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456322357] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:20,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:20,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-22 02:54:20,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618082926] [2022-11-22 02:54:20,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:20,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 02:54:20,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:20,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 02:54:20,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-22 02:54:20,964 INFO L87 Difference]: Start difference. First operand 487 states and 646 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:23,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:23,237 INFO L93 Difference]: Finished difference Result 953 states and 1167 transitions. [2022-11-22 02:54:23,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-22 02:54:23,237 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-11-22 02:54:23,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:23,240 INFO L225 Difference]: With dead ends: 953 [2022-11-22 02:54:23,240 INFO L226 Difference]: Without dead ends: 953 [2022-11-22 02:54:23,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2022-11-22 02:54:23,241 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 780 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:23,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1151 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-22 02:54:23,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-11-22 02:54:23,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 492. [2022-11-22 02:54:23,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 425 states have (on average 1.4470588235294117) internal successors, (615), 473 states have internal predecessors, (615), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2022-11-22 02:54:23,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 651 transitions. [2022-11-22 02:54:23,252 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 651 transitions. Word has length 41 [2022-11-22 02:54:23,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:23,252 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 651 transitions. [2022-11-22 02:54:23,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:23,252 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 651 transitions. [2022-11-22 02:54:23,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-22 02:54:23,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:23,253 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:23,263 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:23,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:23,459 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:23,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:23,460 INFO L85 PathProgramCache]: Analyzing trace with hash -565670668, now seen corresponding path program 1 times [2022-11-22 02:54:23,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:23,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11803507] [2022-11-22 02:54:23,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:23,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:23,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:23,461 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:23,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-11-22 02:54:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:23,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-22 02:54:23,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:23,616 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-22 02:54:23,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 02:54:23,923 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 11 [2022-11-22 02:54:23,962 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-22 02:54:23,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:23,963 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:23,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11803507] [2022-11-22 02:54:23,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [11803507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:23,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:23,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-22 02:54:23,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495720584] [2022-11-22 02:54:23,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:23,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 02:54:23,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:23,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 02:54:23,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-22 02:54:23,972 INFO L87 Difference]: Start difference. First operand 492 states and 651 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:26,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:26,102 INFO L93 Difference]: Finished difference Result 970 states and 1264 transitions. [2022-11-22 02:54:26,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-22 02:54:26,103 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-11-22 02:54:26,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:26,107 INFO L225 Difference]: With dead ends: 970 [2022-11-22 02:54:26,107 INFO L226 Difference]: Without dead ends: 970 [2022-11-22 02:54:26,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2022-11-22 02:54:26,108 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 823 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:26,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 945 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-22 02:54:26,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2022-11-22 02:54:26,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 549. [2022-11-22 02:54:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 474 states have (on average 1.4451476793248945) internal successors, (685), 526 states have internal predecessors, (685), 16 states have call successors, (16), 8 states have call predecessors, (16), 16 states have return successors, (32), 14 states have call predecessors, (32), 16 states have call successors, (32) [2022-11-22 02:54:26,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 733 transitions. [2022-11-22 02:54:26,120 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 733 transitions. Word has length 42 [2022-11-22 02:54:26,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:26,120 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 733 transitions. [2022-11-22 02:54:26,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:26,121 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 733 transitions. [2022-11-22 02:54:26,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-22 02:54:26,121 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:26,122 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:26,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Ended with exit code 0 [2022-11-22 02:54:26,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:26,327 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:26,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:26,328 INFO L85 PathProgramCache]: Analyzing trace with hash -565670667, now seen corresponding path program 1 times [2022-11-22 02:54:26,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:26,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745588765] [2022-11-22 02:54:26,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:26,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:26,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:26,329 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:26,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-11-22 02:54:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:26,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-22 02:54:26,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:26,487 INFO L350 Elim1Store]: Elim1 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-22 02:54:26,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 02:54:26,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 02:54:26,934 INFO L350 Elim1Store]: Elim1 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 9 [2022-11-22 02:54:26,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-11-22 02:54:27,021 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-22 02:54:27,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:27,022 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:27,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745588765] [2022-11-22 02:54:27,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745588765] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:27,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:27,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-22 02:54:27,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836062110] [2022-11-22 02:54:27,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:27,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 02:54:27,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:27,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 02:54:27,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-22 02:54:27,023 INFO L87 Difference]: Start difference. First operand 549 states and 733 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:29,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:29,284 INFO L93 Difference]: Finished difference Result 929 states and 1217 transitions. [2022-11-22 02:54:29,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-22 02:54:29,285 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-11-22 02:54:29,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:29,288 INFO L225 Difference]: With dead ends: 929 [2022-11-22 02:54:29,288 INFO L226 Difference]: Without dead ends: 929 [2022-11-22 02:54:29,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2022-11-22 02:54:29,289 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 914 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:29,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 912 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-22 02:54:29,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2022-11-22 02:54:29,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 498. [2022-11-22 02:54:29,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 431 states have (on average 1.445475638051044) internal successors, (623), 479 states have internal predecessors, (623), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2022-11-22 02:54:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 659 transitions. [2022-11-22 02:54:29,300 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 659 transitions. Word has length 42 [2022-11-22 02:54:29,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:29,300 INFO L495 AbstractCegarLoop]: Abstraction has 498 states and 659 transitions. [2022-11-22 02:54:29,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:29,300 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 659 transitions. [2022-11-22 02:54:29,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-22 02:54:29,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:29,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:29,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:29,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:29,514 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:29,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:29,514 INFO L85 PathProgramCache]: Analyzing trace with hash -563823626, now seen corresponding path program 1 times [2022-11-22 02:54:29,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:29,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805873252] [2022-11-22 02:54:29,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:29,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:29,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:29,516 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:29,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-11-22 02:54:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:29,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-22 02:54:29,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:29,875 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-22 02:54:29,876 INFO L350 Elim1Store]: Elim1 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 13 [2022-11-22 02:54:30,143 INFO L350 Elim1Store]: Elim1 eliminated variable 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-22 02:54:30,162 INFO L350 Elim1Store]: Elim1 eliminated variable 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-22 02:54:30,210 INFO L350 Elim1Store]: Elim1 eliminated variable 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-22 02:54:30,219 INFO L350 Elim1Store]: Elim1 eliminated variable 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-22 02:54:30,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:54:30,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:54:30,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:54:30,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:54:30,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:54:30,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:54:30,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:54:30,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-22 02:54:30,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:54:30,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 02:54:30,424 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:54:30,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-22 02:54:30,445 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-22 02:54:30,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:30,445 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:30,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805873252] [2022-11-22 02:54:30,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805873252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:30,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:30,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 02:54:30,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165401983] [2022-11-22 02:54:30,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:30,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 02:54:30,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:30,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 02:54:30,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:54:30,447 INFO L87 Difference]: Start difference. First operand 498 states and 659 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:31,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:31,310 INFO L93 Difference]: Finished difference Result 519 states and 680 transitions. [2022-11-22 02:54:31,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:54:31,311 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-11-22 02:54:31,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:31,312 INFO L225 Difference]: With dead ends: 519 [2022-11-22 02:54:31,312 INFO L226 Difference]: Without dead ends: 519 [2022-11-22 02:54:31,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-11-22 02:54:31,313 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 120 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:31,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 585 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 02:54:31,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-11-22 02:54:31,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 514. [2022-11-22 02:54:31,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 447 states have (on average 1.429530201342282) internal successors, (639), 495 states have internal predecessors, (639), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2022-11-22 02:54:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 675 transitions. [2022-11-22 02:54:31,320 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 675 transitions. Word has length 42 [2022-11-22 02:54:31,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:31,321 INFO L495 AbstractCegarLoop]: Abstraction has 514 states and 675 transitions. [2022-11-22 02:54:31,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:31,321 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 675 transitions. [2022-11-22 02:54:31,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-22 02:54:31,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:31,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:31,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:31,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:31,535 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:31,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:31,535 INFO L85 PathProgramCache]: Analyzing trace with hash 204373270, now seen corresponding path program 1 times [2022-11-22 02:54:31,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:31,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360782234] [2022-11-22 02:54:31,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:31,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:31,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:31,537 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:31,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-11-22 02:54:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:31,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-22 02:54:31,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:31,889 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-22 02:54:31,889 INFO L350 Elim1Store]: Elim1 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 13 [2022-11-22 02:54:32,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:54:32,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-11-22 02:54:32,324 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:54:32,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-11-22 02:54:32,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:54:32,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-11-22 02:54:32,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:54:32,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-11-22 02:54:32,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-11-22 02:54:32,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 02:54:32,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-11-22 02:54:32,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-22 02:54:32,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-22 02:54:32,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-22 02:54:32,755 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-22 02:54:32,755 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:32,755 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:32,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360782234] [2022-11-22 02:54:32,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [360782234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:32,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:32,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-22 02:54:32,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419161492] [2022-11-22 02:54:32,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:32,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-22 02:54:32,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:32,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-22 02:54:32,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-11-22 02:54:32,757 INFO L87 Difference]: Start difference. First operand 514 states and 675 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:35,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:35,344 INFO L93 Difference]: Finished difference Result 528 states and 689 transitions. [2022-11-22 02:54:35,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 02:54:35,345 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-11-22 02:54:35,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:35,347 INFO L225 Difference]: With dead ends: 528 [2022-11-22 02:54:35,347 INFO L226 Difference]: Without dead ends: 528 [2022-11-22 02:54:35,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2022-11-22 02:54:35,348 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 69 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:35,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1350 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-22 02:54:35,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-11-22 02:54:35,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 514. [2022-11-22 02:54:35,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 447 states have (on average 1.429530201342282) internal successors, (639), 495 states have internal predecessors, (639), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2022-11-22 02:54:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 675 transitions. [2022-11-22 02:54:35,356 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 675 transitions. Word has length 42 [2022-11-22 02:54:35,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:35,356 INFO L495 AbstractCegarLoop]: Abstraction has 514 states and 675 transitions. [2022-11-22 02:54:35,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:35,356 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 675 transitions. [2022-11-22 02:54:35,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-22 02:54:35,357 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:35,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:35,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:35,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:35,567 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:35,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:35,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1739824239, now seen corresponding path program 1 times [2022-11-22 02:54:35,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:35,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018243938] [2022-11-22 02:54:35,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:35,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:35,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:35,569 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:35,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-11-22 02:54:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:35,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-22 02:54:35,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:35,739 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-22 02:54:35,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 02:54:36,052 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 11 [2022-11-22 02:54:36,086 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-22 02:54:36,086 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:36,087 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:36,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018243938] [2022-11-22 02:54:36,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018243938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:36,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:36,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 02:54:36,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957778535] [2022-11-22 02:54:36,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:36,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 02:54:36,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:36,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 02:54:36,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:54:36,088 INFO L87 Difference]: Start difference. First operand 514 states and 675 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:37,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:37,722 INFO L93 Difference]: Finished difference Result 912 states and 1187 transitions. [2022-11-22 02:54:37,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 02:54:37,723 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-11-22 02:54:37,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:37,726 INFO L225 Difference]: With dead ends: 912 [2022-11-22 02:54:37,726 INFO L226 Difference]: Without dead ends: 912 [2022-11-22 02:54:37,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2022-11-22 02:54:37,727 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 588 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:37,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 724 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-22 02:54:37,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2022-11-22 02:54:37,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 611. [2022-11-22 02:54:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 528 states have (on average 1.4299242424242424) internal successors, (755), 584 states have internal predecessors, (755), 20 states have call successors, (20), 10 states have call predecessors, (20), 20 states have return successors, (40), 16 states have call predecessors, (40), 20 states have call successors, (40) [2022-11-22 02:54:37,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 815 transitions. [2022-11-22 02:54:37,739 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 815 transitions. Word has length 43 [2022-11-22 02:54:37,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:37,739 INFO L495 AbstractCegarLoop]: Abstraction has 611 states and 815 transitions. [2022-11-22 02:54:37,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:37,739 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 815 transitions. [2022-11-22 02:54:37,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-22 02:54:37,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:37,739 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:37,750 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Ended with exit code 0 [2022-11-22 02:54:37,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:37,940 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:37,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:37,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1739824238, now seen corresponding path program 1 times [2022-11-22 02:54:37,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:37,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327503427] [2022-11-22 02:54:37,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:37,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:37,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:37,942 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:37,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-11-22 02:54:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:38,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-22 02:54:38,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:38,106 INFO L350 Elim1Store]: Elim1 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-22 02:54:38,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 02:54:38,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 02:54:38,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-11-22 02:54:38,601 INFO L350 Elim1Store]: Elim1 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 9 [2022-11-22 02:54:38,663 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-22 02:54:38,663 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:38,663 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:38,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327503427] [2022-11-22 02:54:38,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327503427] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:38,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:38,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 02:54:38,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628869160] [2022-11-22 02:54:38,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:38,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 02:54:38,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:38,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 02:54:38,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:54:38,666 INFO L87 Difference]: Start difference. First operand 611 states and 815 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:40,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:40,320 INFO L93 Difference]: Finished difference Result 901 states and 1187 transitions. [2022-11-22 02:54:40,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 02:54:40,320 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-11-22 02:54:40,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:40,324 INFO L225 Difference]: With dead ends: 901 [2022-11-22 02:54:40,324 INFO L226 Difference]: Without dead ends: 901 [2022-11-22 02:54:40,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2022-11-22 02:54:40,325 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 678 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:40,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 695 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-22 02:54:40,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2022-11-22 02:54:40,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 692. [2022-11-22 02:54:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 601 states have (on average 1.4492512479201332) internal successors, (871), 661 states have internal predecessors, (871), 24 states have call successors, (24), 12 states have call predecessors, (24), 24 states have return successors, (48), 18 states have call predecessors, (48), 24 states have call successors, (48) [2022-11-22 02:54:40,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 943 transitions. [2022-11-22 02:54:40,337 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 943 transitions. Word has length 43 [2022-11-22 02:54:40,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:40,337 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 943 transitions. [2022-11-22 02:54:40,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:40,337 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 943 transitions. [2022-11-22 02:54:40,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-22 02:54:40,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:40,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:40,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:40,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:40,551 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:40,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:40,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1406660791, now seen corresponding path program 1 times [2022-11-22 02:54:40,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:40,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354112457] [2022-11-22 02:54:40,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:40,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:40,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:40,553 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:40,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2022-11-22 02:54:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:40,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-22 02:54:40,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:40,778 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-22 02:54:41,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 02:54:41,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:54:41,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-11-22 02:54:41,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-22 02:54:41,380 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-22 02:54:41,380 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:41,380 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:41,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354112457] [2022-11-22 02:54:41,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354112457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:41,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:41,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-22 02:54:41,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614691590] [2022-11-22 02:54:41,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:41,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 02:54:41,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:41,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 02:54:41,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-22 02:54:41,382 INFO L87 Difference]: Start difference. First operand 692 states and 943 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:43,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:43,952 INFO L93 Difference]: Finished difference Result 1370 states and 1825 transitions. [2022-11-22 02:54:43,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-22 02:54:43,953 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-11-22 02:54:43,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:43,958 INFO L225 Difference]: With dead ends: 1370 [2022-11-22 02:54:43,958 INFO L226 Difference]: Without dead ends: 1370 [2022-11-22 02:54:43,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2022-11-22 02:54:43,959 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 635 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:43,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1414 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-22 02:54:43,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2022-11-22 02:54:43,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 820. [2022-11-22 02:54:43,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 713 states have (on average 1.4361851332398317) internal successors, (1024), 781 states have internal predecessors, (1024), 32 states have call successors, (32), 16 states have call predecessors, (32), 32 states have return successors, (64), 22 states have call predecessors, (64), 32 states have call successors, (64) [2022-11-22 02:54:43,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1120 transitions. [2022-11-22 02:54:43,975 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1120 transitions. Word has length 43 [2022-11-22 02:54:43,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:43,976 INFO L495 AbstractCegarLoop]: Abstraction has 820 states and 1120 transitions. [2022-11-22 02:54:43,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:43,976 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1120 transitions. [2022-11-22 02:54:43,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-22 02:54:43,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:43,977 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:43,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:44,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:44,189 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:44,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:44,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1406660792, now seen corresponding path program 1 times [2022-11-22 02:54:44,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:44,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193536964] [2022-11-22 02:54:44,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:44,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:44,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:44,191 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:44,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-11-22 02:54:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:44,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-22 02:54:44,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:44,485 INFO L350 Elim1Store]: Elim1 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-22 02:54:44,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 02:54:44,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 02:54:45,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:54:45,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-11-22 02:54:45,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:54:45,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-11-22 02:54:45,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-22 02:54:45,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-22 02:54:45,309 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-22 02:54:45,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:45,309 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:45,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193536964] [2022-11-22 02:54:45,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193536964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:45,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:45,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-22 02:54:45,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255675372] [2022-11-22 02:54:45,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:45,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 02:54:45,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:45,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 02:54:45,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-22 02:54:45,311 INFO L87 Difference]: Start difference. First operand 820 states and 1120 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:48,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:48,224 INFO L93 Difference]: Finished difference Result 1523 states and 2064 transitions. [2022-11-22 02:54:48,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-22 02:54:48,224 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-11-22 02:54:48,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:48,229 INFO L225 Difference]: With dead ends: 1523 [2022-11-22 02:54:48,229 INFO L226 Difference]: Without dead ends: 1523 [2022-11-22 02:54:48,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-11-22 02:54:48,230 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 679 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:48,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 1640 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-22 02:54:48,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2022-11-22 02:54:48,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 723. [2022-11-22 02:54:48,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 632 states have (on average 1.4367088607594938) internal successors, (908), 692 states have internal predecessors, (908), 24 states have call successors, (24), 12 states have call predecessors, (24), 24 states have return successors, (48), 18 states have call predecessors, (48), 24 states have call successors, (48) [2022-11-22 02:54:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 980 transitions. [2022-11-22 02:54:48,246 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 980 transitions. Word has length 43 [2022-11-22 02:54:48,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:48,246 INFO L495 AbstractCegarLoop]: Abstraction has 723 states and 980 transitions. [2022-11-22 02:54:48,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:48,246 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 980 transitions. [2022-11-22 02:54:48,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-22 02:54:48,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:48,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:48,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:48,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:48,460 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:48,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:48,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1842763864, now seen corresponding path program 1 times [2022-11-22 02:54:48,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:48,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967212748] [2022-11-22 02:54:48,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:48,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:48,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:48,462 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:48,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2022-11-22 02:54:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:48,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-22 02:54:48,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:48,929 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2022-11-22 02:54:48,995 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-22 02:54:48,995 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 27 [2022-11-22 02:54:49,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 8 [2022-11-22 02:54:49,104 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-22 02:54:49,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:49,104 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:49,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967212748] [2022-11-22 02:54:49,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [967212748] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:49,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:49,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-22 02:54:49,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206126836] [2022-11-22 02:54:49,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:49,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 02:54:49,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:49,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 02:54:49,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-11-22 02:54:49,105 INFO L87 Difference]: Start difference. First operand 723 states and 980 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:50,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:50,627 INFO L93 Difference]: Finished difference Result 1166 states and 1554 transitions. [2022-11-22 02:54:50,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-22 02:54:50,628 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-11-22 02:54:50,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:50,632 INFO L225 Difference]: With dead ends: 1166 [2022-11-22 02:54:50,632 INFO L226 Difference]: Without dead ends: 1166 [2022-11-22 02:54:50,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2022-11-22 02:54:50,633 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 928 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:50,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 1224 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-22 02:54:50,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2022-11-22 02:54:50,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 819. [2022-11-22 02:54:50,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 716 states have (on average 1.4427374301675977) internal successors, (1033), 782 states have internal predecessors, (1033), 30 states have call successors, (30), 15 states have call predecessors, (30), 30 states have return successors, (60), 21 states have call predecessors, (60), 30 states have call successors, (60) [2022-11-22 02:54:50,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1123 transitions. [2022-11-22 02:54:50,654 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1123 transitions. Word has length 44 [2022-11-22 02:54:50,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:50,654 INFO L495 AbstractCegarLoop]: Abstraction has 819 states and 1123 transitions. [2022-11-22 02:54:50,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1123 transitions. [2022-11-22 02:54:50,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-22 02:54:50,655 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:50,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:50,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:50,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:50,855 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:50,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:50,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1900022166, now seen corresponding path program 1 times [2022-11-22 02:54:50,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:50,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232844570] [2022-11-22 02:54:50,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:50,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:50,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:50,857 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:50,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2022-11-22 02:54:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:51,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-22 02:54:51,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:51,227 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2022-11-22 02:54:51,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 8 [2022-11-22 02:54:51,329 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-22 02:54:51,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:51,329 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:51,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232844570] [2022-11-22 02:54:51,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232844570] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:51,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:51,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-22 02:54:51,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661286110] [2022-11-22 02:54:51,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:51,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 02:54:51,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:51,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 02:54:51,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:54:51,331 INFO L87 Difference]: Start difference. First operand 819 states and 1123 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:52,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:52,288 INFO L93 Difference]: Finished difference Result 1203 states and 1629 transitions. [2022-11-22 02:54:52,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 02:54:52,290 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-11-22 02:54:52,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:52,292 INFO L225 Difference]: With dead ends: 1203 [2022-11-22 02:54:52,293 INFO L226 Difference]: Without dead ends: 1203 [2022-11-22 02:54:52,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2022-11-22 02:54:52,294 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 674 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:52,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 840 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 02:54:52,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2022-11-22 02:54:52,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 997. [2022-11-22 02:54:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 870 states have (on average 1.4540229885057472) internal successors, (1265), 948 states have internal predecessors, (1265), 42 states have call successors, (42), 21 states have call predecessors, (42), 42 states have return successors, (84), 27 states have call predecessors, (84), 42 states have call successors, (84) [2022-11-22 02:54:52,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1391 transitions. [2022-11-22 02:54:52,312 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1391 transitions. Word has length 44 [2022-11-22 02:54:52,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:52,313 INFO L495 AbstractCegarLoop]: Abstraction has 997 states and 1391 transitions. [2022-11-22 02:54:52,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:52,313 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1391 transitions. [2022-11-22 02:54:52,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-22 02:54:52,314 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:52,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:52,331 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:52,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:52,526 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:52,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:52,527 INFO L85 PathProgramCache]: Analyzing trace with hash 656810288, now seen corresponding path program 1 times [2022-11-22 02:54:52,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:52,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696938280] [2022-11-22 02:54:52,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:52,527 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:52,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:52,528 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:52,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Waiting until timeout for monitored process [2022-11-22 02:54:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:52,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-22 02:54:52,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:52,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:54:52,935 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 21 [2022-11-22 02:54:52,943 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-22 02:54:52,944 INFO L350 Elim1Store]: Elim1 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 16 [2022-11-22 02:54:52,991 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-22 02:54:52,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:54:52,991 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:52,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696938280] [2022-11-22 02:54:52,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [696938280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:54:52,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:54:52,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-22 02:54:52,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543579162] [2022-11-22 02:54:52,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:52,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 02:54:52,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:52,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 02:54:52,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-22 02:54:52,993 INFO L87 Difference]: Start difference. First operand 997 states and 1391 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:55,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:55,118 INFO L93 Difference]: Finished difference Result 1387 states and 1890 transitions. [2022-11-22 02:54:55,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-22 02:54:55,119 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-11-22 02:54:55,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:55,122 INFO L225 Difference]: With dead ends: 1387 [2022-11-22 02:54:55,122 INFO L226 Difference]: Without dead ends: 1387 [2022-11-22 02:54:55,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2022-11-22 02:54:55,123 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 305 mSDsluCounter, 1825 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:55,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 2135 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-22 02:54:55,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2022-11-22 02:54:55,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 859. [2022-11-22 02:54:55,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 752 states have (on average 1.4507978723404256) internal successors, (1091), 820 states have internal predecessors, (1091), 32 states have call successors, (32), 16 states have call predecessors, (32), 32 states have return successors, (64), 22 states have call predecessors, (64), 32 states have call successors, (64) [2022-11-22 02:54:55,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1187 transitions. [2022-11-22 02:54:55,140 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1187 transitions. Word has length 44 [2022-11-22 02:54:55,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:55,140 INFO L495 AbstractCegarLoop]: Abstraction has 859 states and 1187 transitions. [2022-11-22 02:54:55,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1187 transitions. [2022-11-22 02:54:55,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-22 02:54:55,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:55,142 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:55,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Forceful destruction successful, exit code 0 [2022-11-22 02:54:55,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:55,362 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:55,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:55,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1371004124, now seen corresponding path program 1 times [2022-11-22 02:54:55,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:55,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559949725] [2022-11-22 02:54:55,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:55,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:55,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:55,364 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:55,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2022-11-22 02:54:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:54:55,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-22 02:54:55,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:54:55,645 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-22 02:54:55,645 INFO L350 Elim1Store]: Elim1 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 13 [2022-11-22 02:54:55,988 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2022-11-22 02:54:56,084 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-22 02:54:56,084 INFO L350 Elim1Store]: Elim1 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 39 treesize of output 30 [2022-11-22 02:54:56,204 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 11 [2022-11-22 02:54:56,291 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-22 02:54:56,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:54:56,767 INFO L350 Elim1Store]: Elim1 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 214 treesize of output 198 [2022-11-22 02:54:57,290 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-22 02:54:57,290 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:54:57,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559949725] [2022-11-22 02:54:57,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [559949725] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 02:54:57,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:54:57,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 20 [2022-11-22 02:54:57,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472897592] [2022-11-22 02:54:57,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:54:57,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 02:54:57,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:54:57,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 02:54:57,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2022-11-22 02:54:57,292 INFO L87 Difference]: Start difference. First operand 859 states and 1187 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:59,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:54:59,626 INFO L93 Difference]: Finished difference Result 1113 states and 1500 transitions. [2022-11-22 02:54:59,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-22 02:54:59,628 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-11-22 02:54:59,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:54:59,630 INFO L225 Difference]: With dead ends: 1113 [2022-11-22 02:54:59,630 INFO L226 Difference]: Without dead ends: 1113 [2022-11-22 02:54:59,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2022-11-22 02:54:59,631 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 896 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:54:59,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 667 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-22 02:54:59,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2022-11-22 02:54:59,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 913. [2022-11-22 02:54:59,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 802 states have (on average 1.458852867830424) internal successors, (1170), 872 states have internal predecessors, (1170), 34 states have call successors, (34), 17 states have call predecessors, (34), 34 states have return successors, (68), 23 states have call predecessors, (68), 34 states have call successors, (68) [2022-11-22 02:54:59,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1272 transitions. [2022-11-22 02:54:59,648 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1272 transitions. Word has length 46 [2022-11-22 02:54:59,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:54:59,648 INFO L495 AbstractCegarLoop]: Abstraction has 913 states and 1272 transitions. [2022-11-22 02:54:59,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:54:59,648 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1272 transitions. [2022-11-22 02:54:59,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-22 02:54:59,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:54:59,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:54:59,662 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Ended with exit code 0 [2022-11-22 02:54:59,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:59,862 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:54:59,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:54:59,862 INFO L85 PathProgramCache]: Analyzing trace with hash 561657498, now seen corresponding path program 1 times [2022-11-22 02:54:59,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:54:59,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901222950] [2022-11-22 02:54:59,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:54:59,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:54:59,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:54:59,864 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:54:59,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (51)] Waiting until timeout for monitored process [2022-11-22 02:55:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:55:00,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-22 02:55:00,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:55:00,451 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2022-11-22 02:55:00,576 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 11 [2022-11-22 02:55:00,657 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-22 02:55:00,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:55:00,658 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:55:00,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901222950] [2022-11-22 02:55:00,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [901222950] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:55:00,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:55:00,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 02:55:00,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572310000] [2022-11-22 02:55:00,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:55:00,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 02:55:00,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:55:00,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 02:55:00,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-22 02:55:00,659 INFO L87 Difference]: Start difference. First operand 913 states and 1272 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:55:02,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:55:02,261 INFO L93 Difference]: Finished difference Result 1297 states and 1778 transitions. [2022-11-22 02:55:02,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-22 02:55:02,263 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-11-22 02:55:02,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:55:02,266 INFO L225 Difference]: With dead ends: 1297 [2022-11-22 02:55:02,266 INFO L226 Difference]: Without dead ends: 1297 [2022-11-22 02:55:02,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2022-11-22 02:55:02,267 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 707 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:55:02,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 757 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-22 02:55:02,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2022-11-22 02:55:02,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1091. [2022-11-22 02:55:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 956 states have (on average 1.4665271966527196) internal successors, (1402), 1038 states have internal predecessors, (1402), 46 states have call successors, (46), 23 states have call predecessors, (46), 46 states have return successors, (92), 29 states have call predecessors, (92), 46 states have call successors, (92) [2022-11-22 02:55:02,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1540 transitions. [2022-11-22 02:55:02,285 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1540 transitions. Word has length 46 [2022-11-22 02:55:02,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:55:02,285 INFO L495 AbstractCegarLoop]: Abstraction has 1091 states and 1540 transitions. [2022-11-22 02:55:02,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:55:02,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1540 transitions. [2022-11-22 02:55:02,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-22 02:55:02,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:55:02,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:55:02,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (51)] Forceful destruction successful, exit code 0 [2022-11-22 02:55:02,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:55:02,499 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:55:02,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:55:02,500 INFO L85 PathProgramCache]: Analyzing trace with hash -164048972, now seen corresponding path program 1 times [2022-11-22 02:55:02,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:55:02,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628777887] [2022-11-22 02:55:02,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:55:02,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:55:02,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:55:02,502 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:55:02,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Waiting until timeout for monitored process [2022-11-22 02:55:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:55:02,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-22 02:55:02,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:55:02,883 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-22 02:55:02,883 INFO L350 Elim1Store]: Elim1 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 13 [2022-11-22 02:55:03,464 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2022-11-22 02:55:03,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:55:03,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-11-22 02:55:03,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2022-11-22 02:55:03,838 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-22 02:55:03,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:55:04,227 INFO L350 Elim1Store]: Elim1 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 114 treesize of output 106 [2022-11-22 02:55:05,040 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-22 02:55:05,040 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:55:05,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628777887] [2022-11-22 02:55:05,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628777887] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 02:55:05,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:55:05,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 18 [2022-11-22 02:55:05,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762676585] [2022-11-22 02:55:05,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:55:05,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 02:55:05,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:55:05,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 02:55:05,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-11-22 02:55:05,042 INFO L87 Difference]: Start difference. First operand 1091 states and 1540 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:55:16,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:55:18,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:55:18,081 INFO L93 Difference]: Finished difference Result 1743 states and 2408 transitions. [2022-11-22 02:55:18,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-22 02:55:18,084 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-11-22 02:55:18,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:55:18,087 INFO L225 Difference]: With dead ends: 1743 [2022-11-22 02:55:18,087 INFO L226 Difference]: Without dead ends: 1743 [2022-11-22 02:55:18,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2022-11-22 02:55:18,088 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 457 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1746 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:55:18,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1746 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1143 Invalid, 1 Unknown, 0 Unchecked, 8.6s Time] [2022-11-22 02:55:18,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2022-11-22 02:55:18,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 906. [2022-11-22 02:55:18,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 795 states have (on average 1.460377358490566) internal successors, (1161), 865 states have internal predecessors, (1161), 34 states have call successors, (34), 17 states have call predecessors, (34), 34 states have return successors, (68), 23 states have call predecessors, (68), 34 states have call successors, (68) [2022-11-22 02:55:18,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1263 transitions. [2022-11-22 02:55:18,107 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1263 transitions. Word has length 46 [2022-11-22 02:55:18,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:55:18,107 INFO L495 AbstractCegarLoop]: Abstraction has 906 states and 1263 transitions. [2022-11-22 02:55:18,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 02:55:18,108 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1263 transitions. [2022-11-22 02:55:18,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-22 02:55:18,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:55:18,109 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:55:18,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Forceful destruction successful, exit code 0 [2022-11-22 02:55:18,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:55:18,323 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:55:18,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:55:18,323 INFO L85 PathProgramCache]: Analyzing trace with hash -835878450, now seen corresponding path program 1 times [2022-11-22 02:55:18,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:55:18,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455881343] [2022-11-22 02:55:18,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:55:18,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:55:18,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:55:18,324 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:55:18,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (53)] Waiting until timeout for monitored process [2022-11-22 02:55:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:55:18,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-22 02:55:18,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:55:18,689 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-22 02:55:18,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-22 02:55:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:55:19,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:55:19,729 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:55:19,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455881343] [2022-11-22 02:55:19,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455881343] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:55:19,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1946438473] [2022-11-22 02:55:19,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:55:19,729 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-22 02:55:19,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/cvc4 [2022-11-22 02:55:19,731 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-22 02:55:19,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (54)] Waiting until timeout for monitored process [2022-11-22 02:55:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:55:20,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-22 02:55:20,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:55:20,198 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-22 02:55:20,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-22 02:55:21,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 02:55:21,435 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 16 [2022-11-22 02:55:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:55:21,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:55:21,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1946438473] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:55:21,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571258718] [2022-11-22 02:55:21,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:55:21,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:55:21,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:55:21,711 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:55:21,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-11-22 02:55:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:55:21,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-22 02:55:21,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:55:22,298 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2022-11-22 02:55:22,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:55:22,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-11-22 02:55:22,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:55:22,779 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:55:22,779 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 11 [2022-11-22 02:55:22,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:55:22,878 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:55:22,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571258718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:55:22,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:55:22,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4, 7] total 22 [2022-11-22 02:55:22,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821485984] [2022-11-22 02:55:22,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:55:22,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 02:55:22,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:55:22,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 02:55:22,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2022-11-22 02:55:22,880 INFO L87 Difference]: Start difference. First operand 906 states and 1263 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:55:27,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:55:27,773 INFO L93 Difference]: Finished difference Result 1993 states and 2713 transitions. [2022-11-22 02:55:27,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-22 02:55:27,780 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-11-22 02:55:27,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:55:27,784 INFO L225 Difference]: With dead ends: 1993 [2022-11-22 02:55:27,784 INFO L226 Difference]: Without dead ends: 1993 [2022-11-22 02:55:27,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=297, Invalid=1595, Unknown=0, NotChecked=0, Total=1892 [2022-11-22 02:55:27,785 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 1692 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1692 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:55:27,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1692 Valid, 1704 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-22 02:55:27,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2022-11-22 02:55:27,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 983. [2022-11-22 02:55:27,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 860 states have (on average 1.4604651162790698) internal successors, (1256), 936 states have internal predecessors, (1256), 40 states have call successors, (40), 20 states have call predecessors, (40), 40 states have return successors, (80), 26 states have call predecessors, (80), 40 states have call successors, (80) [2022-11-22 02:55:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1376 transitions. [2022-11-22 02:55:27,812 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1376 transitions. Word has length 48 [2022-11-22 02:55:27,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:55:27,813 INFO L495 AbstractCegarLoop]: Abstraction has 983 states and 1376 transitions. [2022-11-22 02:55:27,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:55:27,813 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1376 transitions. [2022-11-22 02:55:27,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-22 02:55:27,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:55:27,814 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:55:27,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (54)] Forceful destruction successful, exit code 0 [2022-11-22 02:55:28,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-11-22 02:55:28,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (53)] Forceful destruction successful, exit code 0 [2022-11-22 02:55:28,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt,55 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:55:28,419 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:55:28,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:55:28,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1839873128, now seen corresponding path program 1 times [2022-11-22 02:55:28,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:55:28,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893127417] [2022-11-22 02:55:28,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:55:28,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:55:28,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:55:28,422 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:55:28,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (56)] Waiting until timeout for monitored process [2022-11-22 02:55:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:55:28,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-22 02:55:28,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:55:29,090 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2022-11-22 02:55:29,548 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:55:29,549 INFO L350 Elim1Store]: Elim1 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 19 [2022-11-22 02:55:29,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:55:29,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:55:29,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:55:29,559 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:55:29,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 20 [2022-11-22 02:55:29,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:55:29,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:55:30,278 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:55:30,279 INFO L350 Elim1Store]: Elim1 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 65 [2022-11-22 02:55:30,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-11-22 02:55:30,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:55:30,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2022-11-22 02:55:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 02:55:31,027 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:55:31,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893127417] [2022-11-22 02:55:31,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893127417] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 02:55:31,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:55:31,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 27 [2022-11-22 02:55:31,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611109689] [2022-11-22 02:55:31,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:55:31,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 02:55:31,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:55:31,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 02:55:31,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2022-11-22 02:55:31,029 INFO L87 Difference]: Start difference. First operand 983 states and 1376 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:55:37,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:55:37,389 INFO L93 Difference]: Finished difference Result 2084 states and 2897 transitions. [2022-11-22 02:55:37,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-22 02:55:37,390 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-11-22 02:55:37,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:55:37,392 INFO L225 Difference]: With dead ends: 2084 [2022-11-22 02:55:37,392 INFO L226 Difference]: Without dead ends: 2084 [2022-11-22 02:55:37,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=313, Invalid=1757, Unknown=0, NotChecked=0, Total=2070 [2022-11-22 02:55:37,393 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 1353 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:55:37,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 1990 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-11-22 02:55:37,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2022-11-22 02:55:37,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 894. [2022-11-22 02:55:37,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 783 states have (on average 1.4521072796934866) internal successors, (1137), 853 states have internal predecessors, (1137), 34 states have call successors, (34), 17 states have call predecessors, (34), 34 states have return successors, (68), 23 states have call predecessors, (68), 34 states have call successors, (68) [2022-11-22 02:55:37,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1239 transitions. [2022-11-22 02:55:37,410 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1239 transitions. Word has length 48 [2022-11-22 02:55:37,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:55:37,410 INFO L495 AbstractCegarLoop]: Abstraction has 894 states and 1239 transitions. [2022-11-22 02:55:37,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:55:37,410 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1239 transitions. [2022-11-22 02:55:37,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-22 02:55:37,411 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:55:37,411 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:55:37,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (56)] Forceful destruction successful, exit code 0 [2022-11-22 02:55:37,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:55:37,625 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:55:37,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:55:37,625 INFO L85 PathProgramCache]: Analyzing trace with hash 652399267, now seen corresponding path program 1 times [2022-11-22 02:55:37,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:55:37,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595683238] [2022-11-22 02:55:37,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:55:37,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:55:37,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:55:37,627 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:55:37,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (57)] Waiting until timeout for monitored process [2022-11-22 02:55:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:55:37,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-22 02:55:37,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:55:37,963 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-22 02:55:38,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 02:55:38,480 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-22 02:55:38,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2022-11-22 02:55:38,666 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-22 02:55:38,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-11-22 02:55:38,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-22 02:55:38,805 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:55:38,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:55:41,361 INFO L350 Elim1Store]: Elim1 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 122 treesize of output 114 [2022-11-22 02:55:42,501 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:55:42,502 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:55:42,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595683238] [2022-11-22 02:55:42,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595683238] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:55:42,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [244650197] [2022-11-22 02:55:42,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:55:42,502 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-22 02:55:42,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/cvc4 [2022-11-22 02:55:42,508 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-22 02:55:42,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (58)] Waiting until timeout for monitored process [2022-11-22 02:55:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:55:42,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-22 02:55:42,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:55:43,089 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-22 02:55:43,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-22 02:55:43,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 02:55:44,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:55:44,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-11-22 02:55:44,533 INFO L321 Elim1Store]: treesize reduction 78, result has 31.0 percent of original size [2022-11-22 02:55:44,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 55 [2022-11-22 02:55:44,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-22 02:55:44,831 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:55:44,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:55:49,385 INFO L350 Elim1Store]: Elim1 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 122 treesize of output 114 [2022-11-22 02:55:50,076 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:55:50,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [244650197] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:55:50,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478477164] [2022-11-22 02:55:50,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:55:50,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:55:50,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:55:50,078 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:55:50,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-11-22 02:55:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:55:50,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-22 02:55:50,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:55:51,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 02:55:51,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:55:51,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-11-22 02:55:51,625 INFO L321 Elim1Store]: treesize reduction 40, result has 37.5 percent of original size [2022-11-22 02:55:51,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 39 [2022-11-22 02:55:51,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-22 02:55:51,793 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:55:51,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:55:54,292 INFO L350 Elim1Store]: Elim1 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 122 treesize of output 114 [2022-11-22 02:55:54,961 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:55:54,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478477164] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:55:54,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-22 02:55:54,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10, 10, 11, 11] total 40 [2022-11-22 02:55:54,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418210170] [2022-11-22 02:55:54,962 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-22 02:55:54,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-22 02:55:54,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:55:54,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-22 02:55:54,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1443, Unknown=2, NotChecked=0, Total=1640 [2022-11-22 02:55:54,964 INFO L87 Difference]: Start difference. First operand 894 states and 1239 transitions. Second operand has 41 states, 40 states have (on average 4.425) internal successors, (177), 35 states have internal predecessors, (177), 6 states have call successors, (7), 6 states have call predecessors, (7), 8 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-22 02:56:06,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:56:06,994 INFO L93 Difference]: Finished difference Result 1466 states and 1890 transitions. [2022-11-22 02:56:06,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-22 02:56:06,995 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 4.425) internal successors, (177), 35 states have internal predecessors, (177), 6 states have call successors, (7), 6 states have call predecessors, (7), 8 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) Word has length 49 [2022-11-22 02:56:06,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:56:06,997 INFO L225 Difference]: With dead ends: 1466 [2022-11-22 02:56:06,998 INFO L226 Difference]: Without dead ends: 1466 [2022-11-22 02:56:06,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 249 SyntacticMatches, 9 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2077 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=1067, Invalid=5573, Unknown=2, NotChecked=0, Total=6642 [2022-11-22 02:56:06,999 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 3058 mSDsluCounter, 3100 mSDsCounter, 0 mSdLazyCounter, 2860 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3063 SdHoareTripleChecker+Valid, 3237 SdHoareTripleChecker+Invalid, 3064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 2860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:56:07,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3063 Valid, 3237 Invalid, 3064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 2860 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2022-11-22 02:56:07,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2022-11-22 02:56:07,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 914. [2022-11-22 02:56:07,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 803 states have (on average 1.4470734744707348) internal successors, (1162), 871 states have internal predecessors, (1162), 34 states have call successors, (34), 17 states have call predecessors, (34), 34 states have return successors, (68), 25 states have call predecessors, (68), 34 states have call successors, (68) [2022-11-22 02:56:07,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1264 transitions. [2022-11-22 02:56:07,019 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1264 transitions. Word has length 49 [2022-11-22 02:56:07,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:56:07,019 INFO L495 AbstractCegarLoop]: Abstraction has 914 states and 1264 transitions. [2022-11-22 02:56:07,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 4.425) internal successors, (177), 35 states have internal predecessors, (177), 6 states have call successors, (7), 6 states have call predecessors, (7), 8 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-22 02:56:07,019 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1264 transitions. [2022-11-22 02:56:07,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-22 02:56:07,020 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:56:07,021 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:56:07,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (58)] Forceful destruction successful, exit code 0 [2022-11-22 02:56:07,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-11-22 02:56:07,442 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (57)] Ended with exit code 0 [2022-11-22 02:56:07,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt,59 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,57 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:56:07,633 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:56:07,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:56:07,633 INFO L85 PathProgramCache]: Analyzing trace with hash 652399268, now seen corresponding path program 1 times [2022-11-22 02:56:07,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:56:07,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906568291] [2022-11-22 02:56:07,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:56:07,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:56:07,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:56:07,635 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:56:07,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (60)] Waiting until timeout for monitored process [2022-11-22 02:56:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:56:07,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-22 02:56:07,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:56:08,018 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-22 02:56:08,035 INFO L350 Elim1Store]: Elim1 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-22 02:56:08,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 02:56:08,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 02:56:09,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:56:09,022 INFO L350 Elim1Store]: Elim1 eliminated variable 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 44 treesize of output 35 [2022-11-22 02:56:09,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:56:09,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-11-22 02:56:09,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:56:09,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-22 02:56:09,447 INFO L321 Elim1Store]: treesize reduction 6, result has 62.5 percent of original size [2022-11-22 02:56:09,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-11-22 02:56:09,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-22 02:56:09,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-22 02:56:09,758 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:56:09,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:56:10,964 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:56:10,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906568291] [2022-11-22 02:56:10,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906568291] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:56:10,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1985454154] [2022-11-22 02:56:10,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:56:10,965 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-22 02:56:10,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/cvc4 [2022-11-22 02:56:10,968 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-22 02:56:10,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (61)] Waiting until timeout for monitored process [2022-11-22 02:56:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:56:11,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-22 02:56:11,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:56:11,634 INFO L350 Elim1Store]: Elim1 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 7 [2022-11-22 02:56:11,644 INFO L350 Elim1Store]: Elim1 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-22 02:56:12,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 02:56:12,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 02:56:12,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:56:12,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-11-22 02:56:12,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:56:12,905 INFO L350 Elim1Store]: Elim1 eliminated variable 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 44 treesize of output 35 [2022-11-22 02:56:13,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:56:13,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-22 02:56:13,446 INFO L321 Elim1Store]: treesize reduction 6, result has 62.5 percent of original size [2022-11-22 02:56:13,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-11-22 02:56:13,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-22 02:56:13,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-22 02:56:13,855 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:56:13,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:56:14,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1985454154] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:56:14,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321297685] [2022-11-22 02:56:14,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:56:14,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:56:14,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:56:14,385 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:56:14,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-11-22 02:56:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:56:14,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-22 02:56:14,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:56:14,616 INFO L350 Elim1Store]: Elim1 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-22 02:56:15,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 02:56:15,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-22 02:56:15,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:56:15,418 INFO L350 Elim1Store]: Elim1 eliminated variable 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 44 treesize of output 35 [2022-11-22 02:56:15,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:56:15,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-11-22 02:56:15,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:56:15,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-22 02:56:15,652 INFO L321 Elim1Store]: treesize reduction 6, result has 62.5 percent of original size [2022-11-22 02:56:15,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-11-22 02:56:15,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-22 02:56:15,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-22 02:56:15,796 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:56:15,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:56:16,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321297685] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:56:16,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:56:16,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 24 [2022-11-22 02:56:16,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25255405] [2022-11-22 02:56:16,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:56:16,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-22 02:56:16,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:56:16,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-22 02:56:16,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2022-11-22 02:56:16,224 INFO L87 Difference]: Start difference. First operand 914 states and 1264 transitions. Second operand has 26 states, 25 states have (on average 4.12) internal successors, (103), 22 states have internal predecessors, (103), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-22 02:56:23,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:56:23,132 INFO L93 Difference]: Finished difference Result 1341 states and 1814 transitions. [2022-11-22 02:56:23,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-22 02:56:23,133 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.12) internal successors, (103), 22 states have internal predecessors, (103), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 49 [2022-11-22 02:56:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:56:23,139 INFO L225 Difference]: With dead ends: 1341 [2022-11-22 02:56:23,139 INFO L226 Difference]: Without dead ends: 1341 [2022-11-22 02:56:23,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 146 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=393, Invalid=1769, Unknown=0, NotChecked=0, Total=2162 [2022-11-22 02:56:23,141 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 1788 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 1517 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1789 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-22 02:56:23,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1789 Valid, 1484 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1517 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-11-22 02:56:23,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2022-11-22 02:56:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 914. [2022-11-22 02:56:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 803 states have (on average 1.4445828144458281) internal successors, (1160), 871 states have internal predecessors, (1160), 34 states have call successors, (34), 17 states have call predecessors, (34), 34 states have return successors, (68), 25 states have call predecessors, (68), 34 states have call successors, (68) [2022-11-22 02:56:23,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1262 transitions. [2022-11-22 02:56:23,161 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1262 transitions. Word has length 49 [2022-11-22 02:56:23,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:56:23,161 INFO L495 AbstractCegarLoop]: Abstraction has 914 states and 1262 transitions. [2022-11-22 02:56:23,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.12) internal successors, (103), 22 states have internal predecessors, (103), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-22 02:56:23,162 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1262 transitions. [2022-11-22 02:56:23,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-22 02:56:23,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:56:23,163 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:56:23,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-11-22 02:56:23,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (60)] Ended with exit code 0 [2022-11-22 02:56:23,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (61)] Forceful destruction successful, exit code 0 [2022-11-22 02:56:23,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,60 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,61 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt [2022-11-22 02:56:23,772 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-22 02:56:23,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:56:23,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1554828300, now seen corresponding path program 1 times [2022-11-22 02:56:23,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:56:23,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944020256] [2022-11-22 02:56:23,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:56:23,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:56:23,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:56:23,775 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:56:23,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9a929a-438b-49fa-97c6-415bdf96664e/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (63)] Waiting until timeout for monitored process [2022-11-22 02:56:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:56:24,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-22 02:56:24,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:56:25,361 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:56:25,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:56:25,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-11-22 02:56:25,393 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:56:25,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:56:25,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-11-22 02:56:25,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:56:25,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:56:25,680 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-22 02:56:25,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2022-11-22 02:56:25,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:56:25,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:56:25,745 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-22 02:56:25,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2022-11-22 02:56:26,134 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-22 02:56:26,135 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 45 [2022-11-22 02:56:26,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 3 [2022-11-22 02:56:26,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 3 [2022-11-22 02:56:26,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:56:26,218 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:56:26,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 33 [2022-11-22 02:56:26,922 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:56:26,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:56:26,965 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-22 02:56:26,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 48 [2022-11-22 02:56:26,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:56:26,981 INFO L350 Elim1Store]: Elim1 eliminated variable 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 24 treesize of output 26 [2022-11-22 02:56:27,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:56:27,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:56:27,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:56:27,207 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:56:27,236 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-22 02:56:27,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 59 [2022-11-22 02:56:27,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:56:27,253 INFO L350 Elim1Store]: Elim1 eliminated variable 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 24 treesize of output 26 [2022-11-22 02:56:27,966 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:56:27,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 15 [2022-11-22 02:56:27,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:56:27,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:56:28,056 INFO L321 Elim1Store]: treesize reduction 22, result has 55.1 percent of original size [2022-11-22 02:56:28,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 39 [2022-11-22 02:56:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:56:28,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:56:29,526 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|)) (.cse3 (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END))) (.cse1 (bvadd |c_~#list~0.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (.cse4 (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT))) (and (forall ((v_ArrVal_1130 (_ BitVec 32))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store .cse2 .cse3 v_ArrVal_1130)))) (select .cse0 (select (select .cse0 |c_~#list~0.base|) .cse1))) .cse4) (_ bv0 32))) (forall ((v_ArrVal_1130 (_ BitVec 32)) (v_ArrVal_1129 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1129) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store .cse2 .cse3 v_ArrVal_1130)) |c_~#list~0.base|) .cse1)) .cse4) (_ bv0 32))))) is different from false [2022-11-22 02:59:18,078 WARN L233 SmtUtils]: Spent 7.15s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)