./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcpy-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcpy-alloca-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh --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 64bit --witnessprinter.graph.data.programhash 96d73e5144e69b17de356213175b4cac1e1bd0fb8c4e4377e7e151c0511f2395 --- 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-2329fc7 [2022-12-14 11:48:57,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 11:48:57,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 11:48:57,061 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 11:48:57,062 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 11:48:57,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 11:48:57,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 11:48:57,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 11:48:57,067 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 11:48:57,068 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 11:48:57,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 11:48:57,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 11:48:57,070 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 11:48:57,071 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 11:48:57,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 11:48:57,073 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 11:48:57,074 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 11:48:57,075 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 11:48:57,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 11:48:57,078 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 11:48:57,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 11:48:57,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 11:48:57,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 11:48:57,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 11:48:57,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 11:48:57,086 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 11:48:57,087 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 11:48:57,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 11:48:57,088 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 11:48:57,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 11:48:57,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 11:48:57,090 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 11:48:57,091 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 11:48:57,091 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 11:48:57,092 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 11:48:57,092 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 11:48:57,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 11:48:57,093 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 11:48:57,093 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 11:48:57,093 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 11:48:57,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 11:48:57,095 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2022-12-14 11:48:57,115 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 11:48:57,115 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 11:48:57,115 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 11:48:57,116 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 11:48:57,116 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 11:48:57,116 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 11:48:57,117 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 11:48:57,117 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 11:48:57,117 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 11:48:57,117 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 11:48:57,117 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 11:48:57,117 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 11:48:57,117 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 11:48:57,118 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 11:48:57,118 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 11:48:57,118 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 11:48:57,118 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 11:48:57,118 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 11:48:57,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 11:48:57,119 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 11:48:57,119 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 11:48:57,119 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 11:48:57,119 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 11:48:57,119 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 11:48:57,120 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 11:48:57,120 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 11:48:57,120 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 11:48:57,120 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 11:48:57,120 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 11:48:57,120 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 11:48:57,121 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 11:48:57,121 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 11:48:57,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:48:57,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 11:48:57,121 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 11:48:57,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 11:48:57,121 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 11:48:57,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 11:48:57,122 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 11:48:57,122 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_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/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_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 96d73e5144e69b17de356213175b4cac1e1bd0fb8c4e4377e7e151c0511f2395 [2022-12-14 11:48:57,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 11:48:57,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 11:48:57,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 11:48:57,350 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 11:48:57,351 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 11:48:57,351 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcpy-alloca-1.i [2022-12-14 11:49:00,058 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 11:49:00,214 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 11:49:00,215 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcpy-alloca-1.i [2022-12-14 11:49:00,221 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/data/f84e8be69/b285113ce03c4e43a84c2d8580af4b3b/FLAG81f7bf1f2 [2022-12-14 11:49:00,233 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/data/f84e8be69/b285113ce03c4e43a84c2d8580af4b3b [2022-12-14 11:49:00,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 11:49:00,236 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 11:49:00,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 11:49:00,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 11:49:00,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 11:49:00,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:49:00" (1/1) ... [2022-12-14 11:49:00,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@625bf55b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:00, skipping insertion in model container [2022-12-14 11:49:00,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:49:00" (1/1) ... [2022-12-14 11:49:00,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 11:49:00,268 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 11:49:00,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:49:00,496 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 11:49:00,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:49:00,534 INFO L208 MainTranslator]: Completed translation [2022-12-14 11:49:00,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:00 WrapperNode [2022-12-14 11:49:00,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 11:49:00,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 11:49:00,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 11:49:00,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 11:49:00,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:00" (1/1) ... [2022-12-14 11:49:00,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:00" (1/1) ... [2022-12-14 11:49:00,560 INFO L138 Inliner]: procedures = 111, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2022-12-14 11:49:00,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 11:49:00,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 11:49:00,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 11:49:00,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 11:49:00,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:00" (1/1) ... [2022-12-14 11:49:00,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:00" (1/1) ... [2022-12-14 11:49:00,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:00" (1/1) ... [2022-12-14 11:49:00,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:00" (1/1) ... [2022-12-14 11:49:00,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:00" (1/1) ... [2022-12-14 11:49:00,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:00" (1/1) ... [2022-12-14 11:49:00,576 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:00" (1/1) ... [2022-12-14 11:49:00,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:00" (1/1) ... [2022-12-14 11:49:00,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 11:49:00,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 11:49:00,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 11:49:00,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 11:49:00,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:00" (1/1) ... [2022-12-14 11:49:00,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:49:00,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:49:00,601 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 11:49:00,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 11:49:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 11:49:00,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 11:49:00,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 11:49:00,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 11:49:00,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 11:49:00,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 11:49:00,702 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 11:49:00,703 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 11:49:00,810 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 11:49:00,835 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 11:49:00,835 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 11:49:00,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:49:00 BoogieIcfgContainer [2022-12-14 11:49:00,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 11:49:00,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 11:49:00,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 11:49:00,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 11:49:00,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:49:00" (1/3) ... [2022-12-14 11:49:00,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a19239b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:49:00, skipping insertion in model container [2022-12-14 11:49:00,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:49:00" (2/3) ... [2022-12-14 11:49:00,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a19239b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:49:00, skipping insertion in model container [2022-12-14 11:49:00,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:49:00" (3/3) ... [2022-12-14 11:49:00,843 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca-1.i [2022-12-14 11:49:00,857 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 11:49:00,857 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-12-14 11:49:00,887 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 11:49:00,892 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;@20c1d7ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 11:49:00,892 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-14 11:49:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 8 states have (on average 2.25) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:00,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 11:49:00,899 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:00,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 11:49:00,900 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:49:00,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:00,903 INFO L85 PathProgramCache]: Analyzing trace with hash 86103, now seen corresponding path program 1 times [2022-12-14 11:49:00,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:00,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217574575] [2022-12-14 11:49:00,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:00,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:01,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:01,018 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:01,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217574575] [2022-12-14 11:49:01,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217574575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:49:01,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:49:01,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 11:49:01,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883324634] [2022-12-14 11:49:01,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:01,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:49:01,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:01,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:49:01,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:49:01,052 INFO L87 Difference]: Start difference. First operand has 16 states, 8 states have (on average 2.25) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:01,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:01,087 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-12-14 11:49:01,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:49:01,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-14 11:49:01,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:01,094 INFO L225 Difference]: With dead ends: 17 [2022-12-14 11:49:01,095 INFO L226 Difference]: Without dead ends: 15 [2022-12-14 11:49:01,096 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-12-14 11:49:01,098 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:49:01,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 15 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:49:01,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-12-14 11:49:01,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-12-14 11:49:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 8 states have (on average 1.875) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-12-14 11:49:01,120 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 3 [2022-12-14 11:49:01,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:01,120 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-12-14 11:49:01,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:01,120 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-12-14 11:49:01,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 11:49:01,120 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:01,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 11:49:01,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 11:49:01,121 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:49:01,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:01,121 INFO L85 PathProgramCache]: Analyzing trace with hash 86139, now seen corresponding path program 1 times [2022-12-14 11:49:01,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:01,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901369284] [2022-12-14 11:49:01,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:01,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:01,207 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:01,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901369284] [2022-12-14 11:49:01,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901369284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:49:01,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:49:01,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 11:49:01,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322768872] [2022-12-14 11:49:01,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:01,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:49:01,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:01,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:49:01,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:49:01,210 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:01,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:01,229 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-12-14 11:49:01,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:49:01,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-14 11:49:01,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:01,230 INFO L225 Difference]: With dead ends: 14 [2022-12-14 11:49:01,230 INFO L226 Difference]: Without dead ends: 14 [2022-12-14 11:49:01,230 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-12-14 11:49:01,232 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:49:01,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:49:01,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-12-14 11:49:01,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-12-14 11:49:01,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 8 states have (on average 1.75) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:01,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-12-14 11:49:01,234 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 3 [2022-12-14 11:49:01,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:01,234 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-12-14 11:49:01,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:01,234 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-12-14 11:49:01,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 11:49:01,234 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:01,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 11:49:01,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 11:49:01,235 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:49:01,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:01,235 INFO L85 PathProgramCache]: Analyzing trace with hash 86140, now seen corresponding path program 1 times [2022-12-14 11:49:01,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:01,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943813681] [2022-12-14 11:49:01,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:01,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:01,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:01,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943813681] [2022-12-14 11:49:01,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943813681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:49:01,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:49:01,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 11:49:01,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162719244] [2022-12-14 11:49:01,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:01,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:49:01,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:01,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:49:01,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:49:01,405 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:01,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:01,428 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-12-14 11:49:01,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:49:01,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-14 11:49:01,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:01,428 INFO L225 Difference]: With dead ends: 13 [2022-12-14 11:49:01,428 INFO L226 Difference]: Without dead ends: 13 [2022-12-14 11:49:01,429 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-12-14 11:49:01,429 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:49:01,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 4 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:49:01,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-12-14 11:49:01,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-12-14 11:49:01,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.625) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 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-12-14 11:49:01,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-12-14 11:49:01,432 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 3 [2022-12-14 11:49:01,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:01,432 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-12-14 11:49:01,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:01,432 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-12-14 11:49:01,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 11:49:01,432 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:01,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 11:49:01,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 11:49:01,433 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:49:01,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:01,433 INFO L85 PathProgramCache]: Analyzing trace with hash 2671267, now seen corresponding path program 1 times [2022-12-14 11:49:01,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:01,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721590907] [2022-12-14 11:49:01,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:01,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:01,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:01,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:01,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721590907] [2022-12-14 11:49:01,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721590907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:49:01,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:49:01,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 11:49:01,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783991196] [2022-12-14 11:49:01,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:01,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:49:01,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:01,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:49:01,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:49:01,474 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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-12-14 11:49:01,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:01,491 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-12-14 11:49:01,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:49:01,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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-12-14 11:49:01,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:01,492 INFO L225 Difference]: With dead ends: 12 [2022-12-14 11:49:01,492 INFO L226 Difference]: Without dead ends: 12 [2022-12-14 11:49:01,492 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-12-14 11:49:01,493 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:49:01,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:49:01,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-12-14 11:49:01,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-12-14 11:49:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.5) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-12-14 11:49:01,495 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 4 [2022-12-14 11:49:01,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:01,495 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-12-14 11:49:01,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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-12-14 11:49:01,495 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-12-14 11:49:01,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 11:49:01,495 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:01,495 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 11:49:01,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 11:49:01,496 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:49:01,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:01,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2671268, now seen corresponding path program 1 times [2022-12-14 11:49:01,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:01,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286030750] [2022-12-14 11:49:01,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:01,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:01,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:01,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:01,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286030750] [2022-12-14 11:49:01,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286030750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:49:01,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:49:01,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:49:01,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927000875] [2022-12-14 11:49:01,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:01,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:49:01,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:01,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:49:01,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:49:01,567 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-12-14 11:49:01,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:01,598 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-12-14 11:49:01,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:49:01,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-12-14 11:49:01,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:01,599 INFO L225 Difference]: With dead ends: 20 [2022-12-14 11:49:01,599 INFO L226 Difference]: Without dead ends: 20 [2022-12-14 11:49:01,599 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-12-14 11:49:01,600 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 25 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:49:01,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 8 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:49:01,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-12-14 11:49:01,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2022-12-14 11:49:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 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-12-14 11:49:01,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-12-14 11:49:01,602 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 4 [2022-12-14 11:49:01,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:01,602 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-12-14 11:49:01,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-12-14 11:49:01,602 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-12-14 11:49:01,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 11:49:01,602 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:01,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 11:49:01,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 11:49:01,603 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:49:01,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:01,603 INFO L85 PathProgramCache]: Analyzing trace with hash 82809278, now seen corresponding path program 1 times [2022-12-14 11:49:01,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:01,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603929674] [2022-12-14 11:49:01,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:01,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:01,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:01,756 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:01,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603929674] [2022-12-14 11:49:01,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603929674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:49:01,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:49:01,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:49:01,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511699742] [2022-12-14 11:49:01,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:01,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:49:01,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:01,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:49:01,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:49:01,758 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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-12-14 11:49:01,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:01,808 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-12-14 11:49:01,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:49:01,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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-12-14 11:49:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:01,809 INFO L225 Difference]: With dead ends: 19 [2022-12-14 11:49:01,809 INFO L226 Difference]: Without dead ends: 19 [2022-12-14 11:49:01,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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-12-14 11:49:01,811 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 40 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:49:01,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 4 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:49:01,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-12-14 11:49:01,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2022-12-14 11:49:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.5) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:01,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-12-14 11:49:01,814 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 5 [2022-12-14 11:49:01,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:01,814 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-12-14 11:49:01,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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-12-14 11:49:01,814 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-12-14 11:49:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 11:49:01,814 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:01,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 11:49:01,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 11:49:01,815 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:49:01,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:01,815 INFO L85 PathProgramCache]: Analyzing trace with hash 82809277, now seen corresponding path program 1 times [2022-12-14 11:49:01,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:01,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463842335] [2022-12-14 11:49:01,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:01,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:01,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:01,884 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:01,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463842335] [2022-12-14 11:49:01,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463842335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:49:01,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:49:01,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:49:01,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514653743] [2022-12-14 11:49:01,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:01,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:49:01,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:01,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:49:01,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:49:01,886 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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-12-14 11:49:01,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:01,908 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-12-14 11:49:01,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:49:01,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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-12-14 11:49:01,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:01,908 INFO L225 Difference]: With dead ends: 13 [2022-12-14 11:49:01,908 INFO L226 Difference]: Without dead ends: 13 [2022-12-14 11:49:01,909 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-12-14 11:49:01,909 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:49:01,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 4 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:49:01,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-12-14 11:49:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-12-14 11:49:01,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.3) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 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-12-14 11:49:01,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-12-14 11:49:01,912 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 5 [2022-12-14 11:49:01,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:01,912 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-12-14 11:49:01,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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-12-14 11:49:01,912 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-12-14 11:49:01,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 11:49:01,913 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:01,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:49:01,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 11:49:01,913 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:49:01,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:01,913 INFO L85 PathProgramCache]: Analyzing trace with hash -2024662716, now seen corresponding path program 1 times [2022-12-14 11:49:01,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:01,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138681553] [2022-12-14 11:49:01,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:01,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:02,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:02,109 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:02,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138681553] [2022-12-14 11:49:02,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138681553] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:49:02,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112863690] [2022-12-14 11:49:02,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:02,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:49:02,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:49:02,111 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:49:02,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 11:49:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:02,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 11:49:02,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:49:02,249 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 14 treesize of output 10 [2022-12-14 11:49:02,305 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:49:02,305 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 18 treesize of output 19 [2022-12-14 11:49:02,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:02,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:49:02,490 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 13 treesize of output 11 [2022-12-14 11:49:02,497 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 22 treesize of output 20 [2022-12-14 11:49:02,503 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 31 treesize of output 23 [2022-12-14 11:49:02,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:02,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112863690] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:49:02,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1256424906] [2022-12-14 11:49:02,533 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 11:49:02,533 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:49:02,536 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:49:02,540 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:49:02,540 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:49:02,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:49:02,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 11:49:02,650 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 14 treesize of output 10 [2022-12-14 11:49:02,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:49:02,727 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:49:02,728 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 29 treesize of output 31 [2022-12-14 11:49:02,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 11 treesize of output 7 [2022-12-14 11:49:02,846 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 11 treesize of output 7 [2022-12-14 11:49:02,886 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:49:03,324 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '304#(and (<= 0 |ULTIMATE.start_cstrcpy_~from#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~from#1.offset|) (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (< (select |#length| |ULTIMATE.start_cstrcpy_~from#1.base|) (+ |ULTIMATE.start_cstrcpy_~from#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_~save~0#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#in~to#1.base|) (<= |ULTIMATE.start_cstrcpy_~save~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~to#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_~save~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~from#1.base|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~to#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~from#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc7#1.base|) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~to#1.base|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~from#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~to#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-12-14 11:49:03,324 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 11:49:03,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:49:03,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-14 11:49:03,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266862462] [2022-12-14 11:49:03,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:49:03,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 11:49:03,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:03,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 11:49:03,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-12-14 11:49:03,327 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:03,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:03,548 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-12-14 11:49:03,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 11:49:03,548 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-14 11:49:03,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:03,548 INFO L225 Difference]: With dead ends: 24 [2022-12-14 11:49:03,548 INFO L226 Difference]: Without dead ends: 24 [2022-12-14 11:49:03,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-12-14 11:49:03,549 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 50 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:49:03,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 15 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:49:03,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-12-14 11:49:03,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2022-12-14 11:49:03,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:03,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-12-14 11:49:03,551 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 7 [2022-12-14 11:49:03,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:03,551 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-12-14 11:49:03,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:03,551 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-12-14 11:49:03,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 11:49:03,551 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:03,551 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:49:03,558 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 11:49:03,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-14 11:49:03,753 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:49:03,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:03,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1659948644, now seen corresponding path program 1 times [2022-12-14 11:49:03,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:03,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6904493] [2022-12-14 11:49:03,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:03,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:03,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:03,916 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:03,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6904493] [2022-12-14 11:49:03,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6904493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:49:03,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:49:03,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:49:03,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912839168] [2022-12-14 11:49:03,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:49:03,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:49:03,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:03,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:49:03,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:49:03,917 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:03,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:03,946 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-12-14 11:49:03,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:49:03,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 11:49:03,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:03,947 INFO L225 Difference]: With dead ends: 14 [2022-12-14 11:49:03,947 INFO L226 Difference]: Without dead ends: 12 [2022-12-14 11:49:03,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:49:03,948 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:49:03,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:49:03,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-12-14 11:49:03,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-12-14 11:49:03,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:03,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-12-14 11:49:03,950 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2022-12-14 11:49:03,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:03,950 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-12-14 11:49:03,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:03,950 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-12-14 11:49:03,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 11:49:03,951 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:03,951 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-12-14 11:49:03,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 11:49:03,951 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:49:03,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:03,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1659965214, now seen corresponding path program 1 times [2022-12-14 11:49:03,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:03,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581060409] [2022-12-14 11:49:03,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:03,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:04,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:04,217 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:04,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581060409] [2022-12-14 11:49:04,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581060409] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:49:04,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408670071] [2022-12-14 11:49:04,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:04,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:49:04,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:49:04,219 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:49:04,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 11:49:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:04,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 11:49:04,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:49:04,316 INFO L321 Elim1Store]: treesize reduction 11, result has 50.0 percent of original size [2022-12-14 11:49:04,317 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 1 case distinctions, treesize of input 11 treesize of output 17 [2022-12-14 11:49:04,345 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 10 treesize of output 8 [2022-12-14 11:49:04,414 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 14 treesize of output 10 [2022-12-14 11:49:04,489 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:49:04,489 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 18 treesize of output 15 [2022-12-14 11:49:04,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:04,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:49:04,773 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 13 treesize of output 11 [2022-12-14 11:49:04,777 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 14 treesize of output 12 [2022-12-14 11:49:04,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:49:04,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:04,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408670071] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:49:04,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [215586754] [2022-12-14 11:49:04,865 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 11:49:04,865 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:49:04,865 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:49:04,865 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:49:04,865 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:49:04,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:49:04,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 11:49:04,926 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 14 treesize of output 10 [2022-12-14 11:49:04,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:49:04,972 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:49:04,972 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 29 treesize of output 31 [2022-12-14 11:49:05,039 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 11 treesize of output 7 [2022-12-14 11:49:05,070 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 11 treesize of output 7 [2022-12-14 11:49:05,094 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:49:05,470 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '456#(and (<= 0 |ULTIMATE.start_cstrcpy_~from#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~from#1.offset|) (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~save~0#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#in~to#1.base|) (<= |ULTIMATE.start_cstrcpy_~save~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~to#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_~save~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~from#1.base|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~to#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~from#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc7#1.base|) (< (select |#length| |ULTIMATE.start_cstrcpy_~to#1.base|) (+ |ULTIMATE.start_cstrcpy_~to#1.offset| 1)) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~to#1.base|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~from#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~to#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-12-14 11:49:05,470 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 11:49:05,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:49:05,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-14 11:49:05,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490165096] [2022-12-14 11:49:05,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:49:05,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 11:49:05,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:05,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 11:49:05,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-12-14 11:49:05,472 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:06,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:06,142 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-12-14 11:49:06,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 11:49:06,143 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 11:49:06,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:06,143 INFO L225 Difference]: With dead ends: 13 [2022-12-14 11:49:06,143 INFO L226 Difference]: Without dead ends: 13 [2022-12-14 11:49:06,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=164, Invalid=766, Unknown=0, NotChecked=0, Total=930 [2022-12-14 11:49:06,145 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:49:06,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:49:06,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-12-14 11:49:06,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2022-12-14 11:49:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:06,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-12-14 11:49:06,147 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2022-12-14 11:49:06,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:06,147 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-12-14 11:49:06,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:06,148 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-12-14 11:49:06,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 11:49:06,148 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:06,148 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2022-12-14 11:49:06,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 11:49:06,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:49:06,350 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:49:06,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:06,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1793703588, now seen corresponding path program 2 times [2022-12-14 11:49:06,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:06,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758890641] [2022-12-14 11:49:06,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:06,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:06,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:06,765 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:06,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758890641] [2022-12-14 11:49:06,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758890641] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:49:06,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847325171] [2022-12-14 11:49:06,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:49:06,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:49:06,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:49:06,767 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:49:06,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 11:49:06,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 11:49:06,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:49:06,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-14 11:49:06,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:49:06,837 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 10 treesize of output 8 [2022-12-14 11:49:06,861 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 14 treesize of output 10 [2022-12-14 11:49:06,953 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 24 [2022-12-14 11:49:07,066 INFO L321 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2022-12-14 11:49:07,067 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 29 [2022-12-14 11:49:07,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:07,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:49:07,388 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:49:07,388 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2022-12-14 11:49:07,394 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 38 treesize of output 34 [2022-12-14 11:49:07,402 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 51 treesize of output 45 [2022-12-14 11:49:07,409 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 11 treesize of output 7 [2022-12-14 11:49:07,414 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 16 treesize of output 12 [2022-12-14 11:49:07,456 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:07,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847325171] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:49:07,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1188187542] [2022-12-14 11:49:07,459 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 11:49:07,459 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:49:07,459 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:49:07,459 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:49:07,459 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:49:07,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:49:07,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 11:49:07,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 14 treesize of output 10 [2022-12-14 11:49:07,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:49:07,579 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:49:07,580 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 29 treesize of output 31 [2022-12-14 11:49:07,648 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 11 treesize of output 7 [2022-12-14 11:49:07,680 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 11 treesize of output 7 [2022-12-14 11:49:07,720 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:49:08,218 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '573#(and (<= 0 |ULTIMATE.start_cstrcpy_~from#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~from#1.offset|) (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (< (select |#length| |ULTIMATE.start_cstrcpy_~from#1.base|) (+ |ULTIMATE.start_cstrcpy_~from#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_~save~0#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#in~to#1.base|) (<= |ULTIMATE.start_cstrcpy_~save~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~to#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_~save~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~from#1.base|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~to#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~from#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc7#1.base|) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~to#1.base|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~from#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~to#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-12-14 11:49:08,218 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 11:49:08,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:49:08,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2022-12-14 11:49:08,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371006926] [2022-12-14 11:49:08,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:49:08,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 11:49:08,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:08,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 11:49:08,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=617, Unknown=4, NotChecked=0, Total=702 [2022-12-14 11:49:08,220 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:08,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:08,961 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-12-14 11:49:08,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 11:49:08,961 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 11:49:08,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:08,961 INFO L225 Difference]: With dead ends: 19 [2022-12-14 11:49:08,961 INFO L226 Difference]: Without dead ends: 19 [2022-12-14 11:49:08,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=208, Invalid=1119, Unknown=5, NotChecked=0, Total=1332 [2022-12-14 11:49:08,963 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:49:08,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 124 Invalid, 2 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:49:08,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-12-14 11:49:08,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-12-14 11:49:08,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:08,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-12-14 11:49:08,965 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2022-12-14 11:49:08,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:08,965 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-12-14 11:49:08,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:08,966 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-12-14 11:49:08,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:49:08,966 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:08,966 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1] [2022-12-14 11:49:08,970 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 11:49:09,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:49:09,168 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:49:09,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:09,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1744681636, now seen corresponding path program 3 times [2022-12-14 11:49:09,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:09,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948425047] [2022-12-14 11:49:09,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:09,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:09,597 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:09,598 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:09,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948425047] [2022-12-14 11:49:09,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948425047] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:49:09,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598975158] [2022-12-14 11:49:09,598 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 11:49:09,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:49:09,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:49:09,599 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:49:09,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 11:49:09,671 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 11:49:09,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:49:09,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-14 11:49:09,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:49:09,682 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 10 treesize of output 8 [2022-12-14 11:49:09,686 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 9 treesize of output 11 [2022-12-14 11:49:09,707 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 14 treesize of output 10 [2022-12-14 11:49:09,788 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 24 [2022-12-14 11:49:09,889 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 34 treesize of output 32 [2022-12-14 11:49:10,000 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 40 [2022-12-14 11:49:10,153 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-14 11:49:10,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 39 [2022-12-14 11:49:10,236 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:10,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:49:10,878 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:49:10,878 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 60 [2022-12-14 11:49:10,884 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 88 treesize of output 80 [2022-12-14 11:49:10,887 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-12-14 11:49:10,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 63 [2022-12-14 11:49:10,942 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-12-14 11:49:10,946 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-12-14 11:49:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:11,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598975158] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:49:11,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1907239106] [2022-12-14 11:49:11,009 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 11:49:11,009 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:49:11,009 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:49:11,009 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:49:11,009 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:49:11,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:49:11,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 11:49:11,060 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 14 treesize of output 10 [2022-12-14 11:49:11,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:49:11,108 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:49:11,108 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 29 treesize of output 31 [2022-12-14 11:49:11,159 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 11 treesize of output 7 [2022-12-14 11:49:11,190 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 11 treesize of output 7 [2022-12-14 11:49:11,223 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:49:11,744 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '757#(and (<= 0 |ULTIMATE.start_cstrcpy_~from#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~from#1.offset|) (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (< (select |#length| |ULTIMATE.start_cstrcpy_~from#1.base|) (+ |ULTIMATE.start_cstrcpy_~from#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_~save~0#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#in~to#1.base|) (<= |ULTIMATE.start_cstrcpy_~save~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~to#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_~save~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~from#1.base|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~to#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~from#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc7#1.base|) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~to#1.base|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~from#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~to#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-12-14 11:49:11,744 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 11:49:11,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:49:11,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 14] total 32 [2022-12-14 11:49:11,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368746160] [2022-12-14 11:49:11,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:49:11,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 11:49:11,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:11,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 11:49:11,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1238, Unknown=22, NotChecked=0, Total=1406 [2022-12-14 11:49:11,747 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 33 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:21,091 WARN L233 SmtUtils]: Spent 8.51s on a formula simplification. DAG size of input: 115 DAG size of output: 100 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:49:22,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:22,442 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-12-14 11:49:22,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 11:49:22,442 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 11:49:22,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:22,443 INFO L225 Difference]: With dead ends: 31 [2022-12-14 11:49:22,443 INFO L226 Difference]: Without dead ends: 31 [2022-12-14 11:49:22,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=449, Invalid=2716, Unknown=27, NotChecked=0, Total=3192 [2022-12-14 11:49:22,444 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 109 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 25 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 11:49:22,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 310 Invalid, 13 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 11:49:22,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-12-14 11:49:22,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-12-14 11:49:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-12-14 11:49:22,445 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 16 [2022-12-14 11:49:22,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:22,445 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-12-14 11:49:22,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:22,446 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-12-14 11:49:22,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 11:49:22,446 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:22,446 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1] [2022-12-14 11:49:22,450 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 11:49:22,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:49:22,648 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:49:22,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:22,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1608600924, now seen corresponding path program 4 times [2022-12-14 11:49:22,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:22,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756992815] [2022-12-14 11:49:22,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:22,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:23,661 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:23,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:23,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756992815] [2022-12-14 11:49:23,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756992815] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:49:23,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500767838] [2022-12-14 11:49:23,662 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 11:49:23,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:49:23,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:49:23,663 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:49:23,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 11:49:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:23,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 107 conjunts are in the unsatisfiable core [2022-12-14 11:49:23,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:49:23,775 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 10 treesize of output 8 [2022-12-14 11:49:23,814 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 13 treesize of output 9 [2022-12-14 11:49:23,909 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 23 [2022-12-14 11:49:24,023 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 29 [2022-12-14 11:49:24,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 41 treesize of output 37 [2022-12-14 11:49:24,289 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 51 treesize of output 45 [2022-12-14 11:49:24,479 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 55 treesize of output 47 [2022-12-14 11:49:24,674 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 63 treesize of output 53 [2022-12-14 11:49:24,875 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 71 treesize of output 59 [2022-12-14 11:49:25,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:49:25,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:49:25,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:49:25,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:49:25,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:49:25,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:49:25,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:49:25,136 INFO L321 Elim1Store]: treesize reduction 28, result has 58.2 percent of original size [2022-12-14 11:49:25,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 75 treesize of output 73 [2022-12-14 11:49:25,141 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-14 11:49:25,153 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 11:49:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:25,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:49:28,404 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:49:28,404 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 175 treesize of output 108 [2022-12-14 11:49:28,408 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 188 treesize of output 172 [2022-12-14 11:49:28,412 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-12-14 11:49:28,415 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-12-14 11:49:28,417 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-12-14 11:49:28,419 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-12-14 11:49:28,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 131 [2022-12-14 11:49:28,453 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-12-14 11:49:28,456 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-12-14 11:49:28,460 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-12-14 11:49:28,465 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 16 treesize of output 12 [2022-12-14 11:49:28,603 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 10 treesize of output 8 [2022-12-14 11:49:28,635 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:28,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500767838] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:49:28,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1930348735] [2022-12-14 11:49:28,637 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 11:49:28,637 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:49:28,637 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:49:28,637 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:49:28,637 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:49:28,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:49:28,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 11:49:28,682 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 14 treesize of output 10 [2022-12-14 11:49:28,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:49:28,725 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:49:28,725 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 29 treesize of output 31 [2022-12-14 11:49:28,773 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 11 treesize of output 7 [2022-12-14 11:49:28,796 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 11 treesize of output 7 [2022-12-14 11:49:28,825 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:49:29,575 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1081#(and (<= 0 |ULTIMATE.start_cstrcpy_~from#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~from#1.offset|) (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (< (select |#length| |ULTIMATE.start_cstrcpy_~from#1.base|) (+ |ULTIMATE.start_cstrcpy_~from#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_~save~0#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#in~to#1.base|) (<= |ULTIMATE.start_cstrcpy_~save~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~to#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_~save~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~from#1.base|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~to#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~from#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc7#1.base|) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~to#1.base|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~from#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~to#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-12-14 11:49:29,575 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 11:49:29,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:49:29,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20, 26] total 57 [2022-12-14 11:49:29,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903306674] [2022-12-14 11:49:29,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:49:29,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-12-14 11:49:29,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:49:29,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-12-14 11:49:29,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=3498, Unknown=135, NotChecked=0, Total=4032 [2022-12-14 11:49:29,577 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 59 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:39,994 WARN L233 SmtUtils]: Spent 7.40s on a formula simplification. DAG size of input: 217 DAG size of output: 193 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:49:42,079 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (.cse50 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) (.cse49 (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) (.cse26 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) (.cse48 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) (.cse51 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) (.cse47 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) (.cse6 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (.cse40 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) (.cse8 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1))) (let ((.cse4 (forall ((v_ArrVal_214 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_214) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse8) 0))) (.cse5 (and (<= .cse47 .cse6) (<= 0 .cse40))) (.cse38 (not (= |c_ULTIMATE.start_main_~nondetString~0#1.base| |c_ULTIMATE.start_main_~nondetArea~0#1.base|))) (.cse10 (and (<= 0 .cse48) (<= .cse51 .cse6))) (.cse11 (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_212) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse8) 0))) (.cse12 (forall ((v_ArrVal_214 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_214) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse47) 0))) (.cse13 (forall ((v_ArrVal_213 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_213) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse40) 0))) (.cse14 (and (<= 0 .cse49) (<= .cse26 .cse6))) (.cse15 (forall ((v_ArrVal_213 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_213) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse51) 0))) (.cse16 (forall ((v_ArrVal_211 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_211) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse47) 0))) (.cse17 (forall ((v_ArrVal_214 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_214) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse50) 0))) (.cse18 (forall ((v_ArrVal_210 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_210) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse40) 0))) (.cse19 (forall ((v_ArrVal_209 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_209) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse8) 0))) (.cse20 (forall ((v_ArrVal_212 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_212) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse48)))) (.cse30 (forall ((v_ArrVal_213 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_213) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse47) 0))) (.cse31 (and (<= 0 .cse51) (<= .cse50 .cse6))) (.cse32 (forall ((v_ArrVal_214 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_214) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse48) 0))) (.cse33 (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_212) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse40) 0))) (.cse34 (forall ((v_ArrVal_211 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_211) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse8) 0))) (.cse41 (forall ((v_ArrVal_210 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_210) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse8) 0))) (.cse42 (forall ((v_ArrVal_213 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_213) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse48) 0))) (.cse43 (forall ((v_ArrVal_211 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_211) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse40) 0))) (.cse44 (forall ((v_ArrVal_214 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_214) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse51) 0))) (.cse45 (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_212) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse47) 0))) (.cse46 (and (<= .cse49 .cse6) (<= 0 .cse50))) (.cse3 (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0)) (.cse0 (forall ((v_ArrVal_214 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_214) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse40) 0))) (.cse1 (forall ((v_ArrVal_213 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_213) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse8) 0))) (.cse2 (and (<= .cse48 .cse6) (<= 0 .cse47))) (.cse9 (= (select .cse7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|) 0)) (.cse21 (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_212) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse51) 0))) (.cse22 (forall ((v_ArrVal_213 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_213) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse50) 0))) (.cse23 (forall ((v_ArrVal_208 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_208) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse8)))) (.cse27 (<= (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9) .cse6)) (.cse24 (forall ((v_ArrVal_214 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_214) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse49) 0))) (.cse25 (forall ((v_ArrVal_209 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_209) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse40) 0))) (.cse28 (forall ((v_ArrVal_211 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_211) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse48) 0))) (.cse29 (forall ((v_ArrVal_210 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_210) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse47) 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse3) (= 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|) (exists ((|ULTIMATE.start_main_~length2~0#1| Int)) (and (<= |ULTIMATE.start_main_~length2~0#1| .cse6) (not (< |ULTIMATE.start_main_~length2~0#1| 1)) (= (select .cse7 (+ (- 1) |ULTIMATE.start_main_~length2~0#1|)) 0))) (not (= (select .cse7 0) 0)) (or .cse5 (= (select .cse7 .cse8) 0) .cse3) (not (= (select .cse7 (+ (- 1) |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) (not (= (select .cse7 4) 0)) (or .cse9 .cse4 .cse5) (or .cse10 .cse9 .cse11 .cse12 .cse13) (or .cse14 .cse9 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse21 .cse22 .cse23 .cse24 .cse25 (and (<= 0 .cse26) .cse27) .cse28 .cse29 .cse3) (or .cse30 .cse31 .cse32 .cse33 .cse34 .cse3) (let ((.cse39 (div |c_ULTIMATE.start_main_~length2~0#1| 18446744073709551616))) (let ((.cse37 (<= (+ .cse39 1) 0))) (let ((.cse36 (+ (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (* 18446744073709551616 .cse39))) (.cse35 (not .cse37))) (or (and (or .cse35 (<= 1 .cse36)) (or (<= .cse36 1) .cse37)) (and (<= .cse36 |c_ULTIMATE.start_main_~length2~0#1|) .cse35 .cse38))))) (or (<= .cse40 .cse6) (and (<= .cse8 .cse6) .cse3)) (not (= (select .cse7 3) 0)) .cse38 (or .cse10 .cse11 .cse12 .cse3 .cse13) (or .cse41 .cse9 .cse42 .cse43 .cse44 .cse45 .cse46) (= |c_ULTIMATE.start_main_~nondetString~0#1.offset| 0) (or .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse3 .cse20) (or .cse9 .cse30 .cse31 .cse32 .cse33 .cse34) (not (= (select .cse7 5) 0)) (not (= (select .cse7 2) 0)) (not (= (select .cse7 1) 0)) (or .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse3) (or .cse9 .cse0 .cse1 .cse2) (not (< |c_ULTIMATE.start_main_~length2~0#1| 1)) (or .cse9 .cse21 .cse22 .cse23 .cse27 .cse24 (not (<= 0 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) .cse25 .cse28 .cse29)))) is different from true [2022-12-14 11:49:51,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:49:51,660 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-12-14 11:49:51,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-14 11:49:51,661 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 11:49:51,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:49:51,662 INFO L225 Difference]: With dead ends: 55 [2022-12-14 11:49:51,662 INFO L226 Difference]: Without dead ends: 55 [2022-12-14 11:49:51,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2004 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=1179, Invalid=8766, Unknown=159, NotChecked=198, Total=10302 [2022-12-14 11:49:51,667 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 168 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 27 mSolverCounterUnsat, 39 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 39 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:49:51,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 4 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 838 Invalid, 39 Unknown, 1 Unchecked, 1.1s Time] [2022-12-14 11:49:51,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-14 11:49:51,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-12-14 11:49:51,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 0 states have call successors, (0), 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-12-14 11:49:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2022-12-14 11:49:51,669 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 28 [2022-12-14 11:49:51,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:49:51,669 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2022-12-14 11:49:51,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:49:51,670 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-12-14 11:49:51,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-14 11:49:51,670 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:49:51,670 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1] [2022-12-14 11:49:51,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-14 11:49:51,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:49:51,871 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:49:51,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:49:51,872 INFO L85 PathProgramCache]: Analyzing trace with hash 960799396, now seen corresponding path program 5 times [2022-12-14 11:49:51,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:49:51,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466634310] [2022-12-14 11:49:51,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:49:51,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:49:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:49:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:49:53,848 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:49:53,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466634310] [2022-12-14 11:49:53,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466634310] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:49:53,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983398902] [2022-12-14 11:49:53,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:49:53,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:49:53,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:49:53,849 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:49:53,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 11:49:54,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2022-12-14 11:49:54,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:49:54,305 WARN L261 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 228 conjunts are in the unsatisfiable core [2022-12-14 11:49:54,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:49:54,317 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 10 treesize of output 8 [2022-12-14 11:49:54,361 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 13 treesize of output 9 [2022-12-14 11:49:54,477 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 23 [2022-12-14 11:49:54,666 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 33 treesize of output 31 [2022-12-14 11:49:54,889 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 43 treesize of output 39 [2022-12-14 11:49:55,127 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 47 treesize of output 41 [2022-12-14 11:49:55,362 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 55 treesize of output 47 [2022-12-14 11:49:55,628 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 65 treesize of output 55 [2022-12-14 11:49:55,902 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 75 treesize of output 63 [2022-12-14 11:49:56,203 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 85 treesize of output 71 [2022-12-14 11:49:56,560 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 95 treesize of output 79 [2022-12-14 11:49:56,912 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 95 treesize of output 77 [2022-12-14 11:49:57,258 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 103 treesize of output 83 [2022-12-14 11:49:57,628 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 113 treesize of output 91 [2022-12-14 11:49:58,093 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 119 treesize of output 95 [2022-12-14 11:49:58,577 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 129 treesize of output 103 [2022-12-14 11:49:59,050 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 135 treesize of output 107 [2022-12-14 11:49:59,645 INFO L321 Elim1Store]: treesize reduction 60, result has 76.1 percent of original size [2022-12-14 11:49:59,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 105 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 31 case distinctions, treesize of input 137 treesize of output 257 [2022-12-14 11:49:59,678 WARN L718 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2022-12-14 11:50:02,150 WARN L718 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2022-12-14 11:50:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:50:03,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:50:05,640 WARN L837 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~from#1.base|) |c_ULTIMATE.start_cstrcpy_~from#1.offset|) 0) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3))) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0))) (forall ((v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_310) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0))) is different from false [2022-12-14 11:50:05,933 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4))))) (forall ((v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_310) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0)) is different from false [2022-12-14 11:50:06,911 WARN L837 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~from#1.base|) |c_ULTIMATE.start_cstrcpy_~from#1.offset|) 0) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5))) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0))) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_310) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0))) is different from false [2022-12-14 11:50:07,272 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6))) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0))) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) (forall ((v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_310) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0))) is different from false [2022-12-14 11:50:08,590 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_311 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)))) (forall ((v_ArrVal_306 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_306) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~from#1.base|) |c_ULTIMATE.start_cstrcpy_~from#1.offset|) 0) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) (forall ((v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_310) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|))) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0)))) is different from false [2022-12-14 11:50:09,668 WARN L837 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~from#1.base|) |c_ULTIMATE.start_cstrcpy_~from#1.offset|) 0) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_305 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_305) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) (forall ((v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_310) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) (forall ((v_ArrVal_306 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_306) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0))) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0))) is different from false [2022-12-14 11:50:10,832 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~from#1.base|) |c_ULTIMATE.start_cstrcpy_~from#1.offset|) 0) (forall ((v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_310) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) (forall ((v_ArrVal_306 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_306) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9))) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0))) (forall ((v_ArrVal_305 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_305) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) (forall ((v_ArrVal_304 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_304) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0))) is different from false [2022-12-14 11:50:11,513 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_306 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_306) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_304 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_304) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) (forall ((v_ArrVal_305 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_305) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)))) (forall ((v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_310) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) (forall ((v_ArrVal_303 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_303) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0) (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)))))) is different from false [2022-12-14 11:50:17,099 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_306 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_306) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~from#1.base|) |c_ULTIMATE.start_cstrcpy_~from#1.offset|) 0) (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 12))) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0))) (forall ((v_ArrVal_303 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_303) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) (forall ((v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_310) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)) 0)) (forall ((v_ArrVal_300 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_300) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 11)) 0)) (forall ((v_ArrVal_304 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_304) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) (forall ((v_ArrVal_302 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_302) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) (forall ((v_ArrVal_305 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_305) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0))) is different from false [2022-12-14 11:50:23,061 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_298) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 13)) 0)) (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 14))))) (forall ((v_ArrVal_306 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_306) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) (forall ((v_ArrVal_300 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_300) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) (forall ((v_ArrVal_302 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_302) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_310) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 12)) 0)) (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) (forall ((v_ArrVal_303 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_303) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) (forall ((v_ArrVal_299 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_299) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) (forall ((v_ArrVal_304 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_304) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 11)) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)) 0)) (forall ((v_ArrVal_305 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_305) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0)) is different from false [2022-12-14 11:50:23,116 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_298) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 13)) 0)) (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 14))))) (forall ((v_ArrVal_306 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_306) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) (forall ((v_ArrVal_300 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_300) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~from#1.base|) |c_ULTIMATE.start_cstrcpy_~from#1.offset|) 0) (forall ((v_ArrVal_302 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_302) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_310) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 12)) 0)) (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) (forall ((v_ArrVal_303 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_303) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) (forall ((v_ArrVal_299 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_299) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) (forall ((v_ArrVal_304 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_304) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 11)) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)) 0)) (forall ((v_ArrVal_305 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_305) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0))) is different from false [2022-12-14 11:50:27,506 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_297 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_297) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 15))) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0))) (forall ((v_ArrVal_306 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_306) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~from#1.base|) |c_ULTIMATE.start_cstrcpy_~from#1.offset|) 0) (forall ((v_ArrVal_305 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_305) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 12)) 0)) (forall ((v_ArrVal_300 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_300) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_310) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 13)) 0)) (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)) 0)) (forall ((v_ArrVal_304 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_304) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 11)) 0)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_298) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) (forall ((v_ArrVal_302 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_302) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) (forall ((v_ArrVal_303 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_303) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) (forall ((v_ArrVal_299 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_299) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 14)) 0))) is different from false [2022-12-14 11:50:27,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:50:27,596 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 357 treesize of output 202 [2022-12-14 11:50:27,664 INFO L321 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2022-12-14 11:50:27,665 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 2 case distinctions, treesize of input 26 treesize of output 31 [2022-12-14 11:50:27,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:50:27,962 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:50:27,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 106 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 30 case distinctions, treesize of input 390 treesize of output 563 [2022-12-14 11:50:27,988 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-12-14 11:50:27,992 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-12-14 11:50:27,995 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-12-14 11:50:28,043 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 7 [2022-12-14 11:50:28,086 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 16 treesize of output 12 [2022-12-14 11:50:28,871 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2022-12-14 11:50:28,936 WARN L718 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2022-12-14 11:50:29,913 WARN L718 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2022-12-14 11:50:30,367 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2022-12-14 11:50:30,575 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2022-12-14 11:50:30,669 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-12-14 11:50:30,673 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-12-14 11:50:30,676 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-12-14 11:50:30,679 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-12-14 11:50:30,681 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-12-14 11:50:30,686 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-12-14 11:50:30,688 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-12-14 11:50:30,691 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-12-14 11:50:30,695 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-12-14 11:50:30,698 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-12-14 11:50:30,701 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-12-14 11:50:30,862 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 154 not checked. [2022-12-14 11:50:30,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983398902] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:50:30,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2003753941] [2022-12-14 11:50:30,863 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 11:50:30,864 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:50:30,864 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:50:30,864 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:50:30,864 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:50:30,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:50:30,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 11:50:30,914 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 14 treesize of output 10 [2022-12-14 11:50:30,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:50:30,955 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:50:30,955 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 29 treesize of output 31 [2022-12-14 11:50:31,009 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 11 treesize of output 7 [2022-12-14 11:50:31,033 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 11 treesize of output 7 [2022-12-14 11:50:31,067 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:50:32,529 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1680#(and (<= 0 |ULTIMATE.start_cstrcpy_~from#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~from#1.offset|) (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (< (select |#length| |ULTIMATE.start_cstrcpy_~from#1.base|) (+ |ULTIMATE.start_cstrcpy_~from#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_~save~0#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#in~to#1.base|) (<= |ULTIMATE.start_cstrcpy_~save~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~to#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_~save~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~from#1.base|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~to#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~from#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc7#1.base|) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~to#1.base|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~from#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~to#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-12-14 11:50:32,529 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 11:50:32,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:50:32,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 35, 50] total 103 [2022-12-14 11:50:32,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463513426] [2022-12-14 11:50:32,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:50:32,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-12-14 11:50:32,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:50:32,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-12-14 11:50:32,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=920, Invalid=8021, Unknown=419, NotChecked=2412, Total=11772 [2022-12-14 11:50:32,533 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 104 states, 103 states have (on average 1.4951456310679612) internal successors, (154), 104 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:51:12,965 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (.cse18 (div |c_ULTIMATE.start_main_~length2~0#1| 18446744073709551616))) (let ((.cse2 (<= (+ .cse18 1) 0)) (.cse1 (+ (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (* 18446744073709551616 .cse18))) (.cse17 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 13)) (.cse7 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 12)) (.cse11 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 11)) (.cse4 (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) (.cse16 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) (.cse13 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) (.cse9 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)) (.cse6 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (.cse3 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) (.cse15 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) (.cse5 (= (select .cse0 |c_ULTIMATE.start_cstrcpy_~from#1.offset|) 0)) (.cse10 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) (.cse8 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) (.cse12 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) (.cse14 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2))) (and (<= 15 |c_ULTIMATE.start_cstrcpy_~from#1.offset|) (not (= (select .cse0 0) 0)) (not (= (select .cse0 14) 0)) (not (= (select .cse0 13) 0)) (or (<= .cse1 |c_ULTIMATE.start_main_~length2~0#1|) .cse2) (or (forall ((v_ArrVal_306 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_306) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse3) 0)) (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse4) 0)) .cse5 (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) .cse6) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| .cse7)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0))) (forall ((v_ArrVal_303 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_303) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse8) 0)) (forall ((v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_310) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse9) 0)) (forall ((v_ArrVal_300 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_300) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse10) 0)) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse11) 0)) (forall ((v_ArrVal_304 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_304) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse12) 0)) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse13) 0)) (forall ((v_ArrVal_302 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_302) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse14) 0)) (forall ((v_ArrVal_305 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_305) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse15) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse16) 0))) (= 0 |c_ULTIMATE.start_main_~nondetArea~0#1.offset|) (or .cse5 (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse10) 0)) (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) .cse6) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| .cse14)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0)))) (<= .cse10 .cse6) (<= |c_ULTIMATE.start_cstrcpy_~from#1.offset| 16) (not (= (select .cse0 11) 0)) (not (= (select .cse0 4) 0)) (not (= 0 (select .cse0 9))) (not (= (select .cse0 6) 0)) (not (= (select .cse0 7) 0)) (or (forall ((v_ArrVal_306 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_306) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse12) 0)) .cse5 (forall ((v_ArrVal_304 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_304) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse14) 0)) (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse15) 0)) (forall ((v_ArrVal_305 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_305) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse8) 0)) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse4) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse3))) (forall ((v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_310) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse16) 0)) (forall ((v_ArrVal_303 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_303) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse10) 0)) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse13) 0)) (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) .cse6) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| .cse9))))) (or .cse5 (<= .cse6 |c_ULTIMATE.start_cstrcpy_~from#1.offset|) (<= .cse14 .cse6)) (or (not .cse2) (<= |c_ULTIMATE.start_main_~length2~0#1| .cse1)) (or .cse5 (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse14) 0)) (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) .cse6) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| .cse8)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0))) (forall ((v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_310) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse10) 0))) (or (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) .cse6) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| .cse10)))) .cse5) (exists ((|ULTIMATE.start_main_~length2~0#1| Int)) (and (<= |ULTIMATE.start_main_~length2~0#1| .cse6) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= (select .cse0 (+ (- 1) |ULTIMATE.start_main_~length2~0#1|)) 0))) (or .cse5 (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse15) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse12) 0)) (forall ((v_ArrVal_305 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_305) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse10) 0)) (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse8) 0)) (forall ((v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_310) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse3) 0)) (forall ((v_ArrVal_306 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_306) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse14) 0)) (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) .cse6) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| .cse16)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0))) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse4) 0))) (not (= (select .cse0 3) 0)) (not (= |c_ULTIMATE.start_main_~nondetString~0#1.base| |c_ULTIMATE.start_main_~nondetArea~0#1.base|)) (<= 16 .cse6) (or (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_298) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse10) 0)) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse17) 0)) (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) .cse6) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 14))))) (forall ((v_ArrVal_306 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_306) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse16) 0)) (forall ((v_ArrVal_300 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_300) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse8) 0)) .cse5 (forall ((v_ArrVal_302 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_302) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse12) 0)) (forall ((v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_310) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse7) 0)) (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse13) 0)) (forall ((v_ArrVal_303 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_303) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse15) 0)) (forall ((v_ArrVal_299 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_299) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse14) 0)) (forall ((v_ArrVal_304 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_304) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse3) 0)) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse11) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse9) 0)) (forall ((v_ArrVal_305 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_305) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse4) 0))) (or (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) .cse6) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| .cse12)))) .cse5 (forall ((v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_310) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse14) 0)) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse10) 0)) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse8) 0))) (= |c_ULTIMATE.start_main_~nondetString~0#1.offset| 0) (or .cse5 (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse12) 0)) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse14) 0)) (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) .cse6) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| .cse15)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0))) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse10) 0)) (forall ((v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_310) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse8) 0))) (or (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse16) 0)) (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse12) 0)) .cse5 (forall ((v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_310) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse4) 0)) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse3) 0)) (forall ((v_ArrVal_306 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_306) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse8) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse15) 0)) (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) .cse6) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| .cse13)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0))) (forall ((v_ArrVal_305 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_305) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse14) 0)) (forall ((v_ArrVal_304 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_304) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse10) 0))) (not (= (select .cse0 12) 0)) (not (= (select .cse0 8) 0)) (not (= (select .cse0 10) 0)) (or (forall ((v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_310) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse11) 0)) (forall ((v_ArrVal_302 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_302) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse8) 0)) (forall ((v_ArrVal_303 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_303) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse12) 0)) .cse5 (forall ((v_ArrVal_304 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_304) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse15) 0)) (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) .cse6) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| .cse17)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0))) (forall ((v_ArrVal_305 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_305) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse3) 0)) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse9) 0)) (forall ((v_ArrVal_306 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_306) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse4) 0)) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse7) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse13) 0)) (forall ((v_ArrVal_300 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_300) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse14) 0)) (forall ((v_ArrVal_299 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_299) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse10) 0)) (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse16) 0))) (not (= (select .cse0 5) 0)) (or (forall ((v_ArrVal_311 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse3))) (forall ((v_ArrVal_306 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_306) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse10) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse8) 0)) .cse5 (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse12) 0)) (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse14) 0)) (forall ((v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_310) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse15) 0)) (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) .cse6) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| .cse4)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0)))) (not (= (select .cse0 2) 0)) (not (= (select .cse0 1) 0)) (<= 1 |c_ULTIMATE.start_cstrcpy_~from#1.offset|) (or (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) .cse6) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| .cse11)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0))) (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse3) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse4) 0)) .cse5 (forall ((v_ArrVal_303 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_303) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse14) 0)) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse16) 0)) (forall ((v_ArrVal_304 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_304) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse8) 0)) (forall ((v_ArrVal_302 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_302) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse10) 0)) (forall ((v_ArrVal_306 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_306) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse15) 0)) (forall ((v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_310) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse13) 0)) (forall ((v_ArrVal_311 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse9))) (forall ((v_ArrVal_305 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_305) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse12) 0))) (<= |c_ULTIMATE.start_cstrcpy_~from#1.offset| 15) (or (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_312 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) .cse6) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| .cse3)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|) 0))) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse15) 0)) .cse5 (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse10) 0)) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse8) 0)) (forall ((v_ArrVal_310 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_310) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse12) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse14) 0)))))) is different from true [2022-12-14 11:51:25,009 WARN L233 SmtUtils]: Spent 10.82s on a formula simplification. DAG size of input: 487 DAG size of output: 290 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:51:37,932 WARN L233 SmtUtils]: Spent 9.30s on a formula simplification. DAG size of input: 456 DAG size of output: 259 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:51:47,189 WARN L233 SmtUtils]: Spent 7.86s on a formula simplification. DAG size of input: 392 DAG size of output: 248 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:52:07,389 WARN L233 SmtUtils]: Spent 18.45s on a formula simplification. DAG size of input: 411 DAG size of output: 331 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:52:09,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 11:52:12,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 11:52:21,299 WARN L233 SmtUtils]: Spent 7.67s on a formula simplification. DAG size of input: 364 DAG size of output: 249 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:52:27,145 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2022-12-14 11:52:27,145 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-12-14 11:52:27,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-14 11:52:27,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 83 SyntacticMatches, 14 SemanticMatches, 144 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 3146 ImplicationChecksByTransitivity, 126.9s TimeCoverageRelationStatistics Valid=1985, Invalid=15178, Unknown=445, NotChecked=3562, Total=21170 [2022-12-14 11:52:27,155 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 106 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 5 mSolverCounterUnsat, 62 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 3044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 62 IncrementalHoareTripleChecker+Unknown, 457 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:27,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1 Invalid, 3044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2520 Invalid, 62 Unknown, 457 Unchecked, 10.5s Time] [2022-12-14 11:52:27,161 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 11:52:27,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 11:52:27,358 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_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/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") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) 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: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 55 more [2022-12-14 11:52:27,367 INFO L158 Benchmark]: Toolchain (without parser) took 207130.28ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 108.7MB in the beginning and 258.0MB in the end (delta: -149.3MB). Peak memory consumption was 189.1MB. Max. memory is 16.1GB. [2022-12-14 11:52:27,368 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 142.6MB. Free memory is still 114.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 11:52:27,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.14ms. Allocated memory is still 142.6MB. Free memory was 108.7MB in the beginning and 92.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 11:52:27,368 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.14ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 91.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 11:52:27,369 INFO L158 Benchmark]: Boogie Preprocessor took 16.26ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 89.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 11:52:27,369 INFO L158 Benchmark]: RCFGBuilder took 258.75ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 75.6MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 11:52:27,369 INFO L158 Benchmark]: TraceAbstraction took 206527.59ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 75.1MB in the beginning and 258.0MB in the end (delta: -182.8MB). Peak memory consumption was 155.6MB. Max. memory is 16.1GB. [2022-12-14 11:52:27,370 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.13ms. Allocated memory is still 142.6MB. Free memory is still 114.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.14ms. Allocated memory is still 142.6MB. Free memory was 108.7MB in the beginning and 92.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.14ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 91.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.26ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 89.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 258.75ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 75.6MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 206527.59ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 75.1MB in the beginning and 258.0MB in the end (delta: -182.8MB). Peak memory consumption was 155.6MB. 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_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/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") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/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") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) 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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcpy-alloca-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh --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 64bit --witnessprinter.graph.data.programhash 96d73e5144e69b17de356213175b4cac1e1bd0fb8c4e4377e7e151c0511f2395 --- 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-2329fc7 [2022-12-14 11:52:28,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 11:52:28,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 11:52:28,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 11:52:28,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 11:52:28,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 11:52:28,736 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 11:52:28,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 11:52:28,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 11:52:28,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 11:52:28,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 11:52:28,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 11:52:28,741 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 11:52:28,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 11:52:28,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 11:52:28,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 11:52:28,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 11:52:28,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 11:52:28,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 11:52:28,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 11:52:28,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 11:52:28,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 11:52:28,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 11:52:28,750 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 11:52:28,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 11:52:28,753 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 11:52:28,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 11:52:28,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 11:52:28,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 11:52:28,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 11:52:28,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 11:52:28,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 11:52:28,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 11:52:28,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 11:52:28,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 11:52:28,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 11:52:28,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 11:52:28,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 11:52:28,759 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 11:52:28,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 11:52:28,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 11:52:28,761 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Bitvector.epf [2022-12-14 11:52:28,783 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 11:52:28,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 11:52:28,784 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 11:52:28,784 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 11:52:28,784 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 11:52:28,784 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 11:52:28,784 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 11:52:28,785 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 11:52:28,785 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 11:52:28,785 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 11:52:28,785 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 11:52:28,785 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 11:52:28,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 11:52:28,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 11:52:28,786 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 11:52:28,786 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 11:52:28,786 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 11:52:28,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 11:52:28,786 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 11:52:28,786 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 11:52:28,786 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 11:52:28,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 11:52:28,787 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 11:52:28,787 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 11:52:28,787 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 11:52:28,787 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 11:52:28,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 11:52:28,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 11:52:28,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 11:52:28,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:52:28,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 11:52:28,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 11:52:28,794 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 11:52:28,794 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 11:52:28,794 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 11:52:28,794 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 11:52:28,794 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_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/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_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 96d73e5144e69b17de356213175b4cac1e1bd0fb8c4e4377e7e151c0511f2395 [2022-12-14 11:52:28,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 11:52:29,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 11:52:29,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 11:52:29,010 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 11:52:29,010 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 11:52:29,013 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcpy-alloca-1.i [2022-12-14 11:52:31,575 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 11:52:31,750 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 11:52:31,750 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcpy-alloca-1.i [2022-12-14 11:52:31,757 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/data/b5f1ba0e2/af0d44cd23624b47a881fe87dfa188c2/FLAG42740f3f1 [2022-12-14 11:52:32,139 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/data/b5f1ba0e2/af0d44cd23624b47a881fe87dfa188c2 [2022-12-14 11:52:32,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 11:52:32,145 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 11:52:32,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 11:52:32,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 11:52:32,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 11:52:32,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:52:32" (1/1) ... [2022-12-14 11:52:32,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20903a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:32, skipping insertion in model container [2022-12-14 11:52:32,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:52:32" (1/1) ... [2022-12-14 11:52:32,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 11:52:32,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 11:52:32,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:52:32,359 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 11:52:32,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:52:32,402 INFO L208 MainTranslator]: Completed translation [2022-12-14 11:52:32,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:32 WrapperNode [2022-12-14 11:52:32,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 11:52:32,404 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 11:52:32,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 11:52:32,404 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 11:52:32,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:32" (1/1) ... [2022-12-14 11:52:32,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:32" (1/1) ... [2022-12-14 11:52:32,433 INFO L138 Inliner]: procedures = 112, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2022-12-14 11:52:32,433 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 11:52:32,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 11:52:32,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 11:52:32,434 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 11:52:32,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:32" (1/1) ... [2022-12-14 11:52:32,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:32" (1/1) ... [2022-12-14 11:52:32,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:32" (1/1) ... [2022-12-14 11:52:32,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:32" (1/1) ... [2022-12-14 11:52:32,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:32" (1/1) ... [2022-12-14 11:52:32,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:32" (1/1) ... [2022-12-14 11:52:32,452 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:32" (1/1) ... [2022-12-14 11:52:32,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:32" (1/1) ... [2022-12-14 11:52:32,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 11:52:32,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 11:52:32,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 11:52:32,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 11:52:32,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:32" (1/1) ... [2022-12-14 11:52:32,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:52:32,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:52:32,492 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 11:52:32,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 11:52:32,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-12-14 11:52:32,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 11:52:32,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-12-14 11:52:32,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 11:52:32,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 11:52:32,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 11:52:32,604 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 11:52:32,605 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 11:52:32,785 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 11:52:32,789 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 11:52:32,789 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 11:52:32,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:52:32 BoogieIcfgContainer [2022-12-14 11:52:32,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 11:52:32,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 11:52:32,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 11:52:32,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 11:52:32,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:52:32" (1/3) ... [2022-12-14 11:52:32,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b2cdf26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:52:32, skipping insertion in model container [2022-12-14 11:52:32,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:32" (2/3) ... [2022-12-14 11:52:32,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b2cdf26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:52:32, skipping insertion in model container [2022-12-14 11:52:32,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:52:32" (3/3) ... [2022-12-14 11:52:32,797 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca-1.i [2022-12-14 11:52:32,812 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 11:52:32,812 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-12-14 11:52:32,844 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 11:52:32,849 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;@de2eff3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 11:52:32,849 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-14 11:52:32,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.8) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:32,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 11:52:32,856 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:32,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 11:52:32,857 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:52:32,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:32,861 INFO L85 PathProgramCache]: Analyzing trace with hash 889510823, now seen corresponding path program 1 times [2022-12-14 11:52:32,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:52:32,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572974596] [2022-12-14 11:52:32,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:32,873 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-12-14 11:52:32,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:52:32,875 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:32,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:32,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 11:52:32,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:32,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:32,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:32,982 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:52:32,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572974596] [2022-12-14 11:52:32,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572974596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:32,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:52:32,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:52:32,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790043427] [2022-12-14 11:52:32,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:32,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:52:32,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:52:33,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:52:33,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:52:33,013 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.8) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-12-14 11:52:33,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:33,112 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-12-14 11:52:33,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:52:33,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-12-14 11:52:33,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:33,126 INFO L225 Difference]: With dead ends: 62 [2022-12-14 11:52:33,126 INFO L226 Difference]: Without dead ends: 56 [2022-12-14 11:52:33,127 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-12-14 11:52:33,131 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 56 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:33,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 62 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:52:33,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-12-14 11:52:33,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 23. [2022-12-14 11:52:33,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.6875) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-12-14 11:52:33,153 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 6 [2022-12-14 11:52:33,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:33,154 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-12-14 11:52:33,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-12-14 11:52:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-12-14 11:52:33,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 11:52:33,155 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:33,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 11:52:33,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:33,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:33,356 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:52:33,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:33,356 INFO L85 PathProgramCache]: Analyzing trace with hash 889510859, now seen corresponding path program 1 times [2022-12-14 11:52:33,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:52:33,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604588688] [2022-12-14 11:52:33,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:33,357 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-12-14 11:52:33,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:52:33,358 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:33,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:33,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 11:52:33,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:33,457 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 11:52:33,458 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 1 case distinctions, treesize of input 9 treesize of output 19 [2022-12-14 11:52:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:33,467 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:33,467 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:52:33,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604588688] [2022-12-14 11:52:33,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604588688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:33,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:52:33,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 11:52:33,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053155739] [2022-12-14 11:52:33,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:33,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:52:33,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:52:33,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:52:33,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:52:33,471 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 2 states have (on average 3.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-12-14 11:52:33,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:33,532 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-12-14 11:52:33,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:52:33,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.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-12-14 11:52:33,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:33,533 INFO L225 Difference]: With dead ends: 22 [2022-12-14 11:52:33,533 INFO L226 Difference]: Without dead ends: 22 [2022-12-14 11:52:33,533 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-12-14 11:52:33,534 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:33,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 20 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:52:33,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-12-14 11:52:33,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-12-14 11:52:33,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.625) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:33,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-12-14 11:52:33,537 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 6 [2022-12-14 11:52:33,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:33,538 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-12-14 11:52:33,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.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-12-14 11:52:33,538 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-12-14 11:52:33,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 11:52:33,538 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:33,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 11:52:33,546 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 11:52:33,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:33,741 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:52:33,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:33,744 INFO L85 PathProgramCache]: Analyzing trace with hash 889510860, now seen corresponding path program 1 times [2022-12-14 11:52:33,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:52:33,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394076434] [2022-12-14 11:52:33,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:33,748 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-12-14 11:52:33,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:52:33,752 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:33,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:33,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 11:52:33,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:33,876 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-12-14 11:52:33,877 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 1 case distinctions, treesize of input 10 treesize of output 16 [2022-12-14 11:52:33,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-12-14 11:52:33,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:33,895 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:52:33,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394076434] [2022-12-14 11:52:33,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394076434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:33,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:52:33,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:52:33,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893108372] [2022-12-14 11:52:33,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:33,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:52:33,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:52:33,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:52:33,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:52:33,897 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-12-14 11:52:34,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:34,017 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-12-14 11:52:34,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:52:34,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-12-14 11:52:34,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:34,019 INFO L225 Difference]: With dead ends: 39 [2022-12-14 11:52:34,019 INFO L226 Difference]: Without dead ends: 39 [2022-12-14 11:52:34,019 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-12-14 11:52:34,020 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:34,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 46 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:52:34,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-12-14 11:52:34,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2022-12-14 11:52:34,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-12-14 11:52:34,025 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 6 [2022-12-14 11:52:34,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:34,025 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-12-14 11:52:34,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-12-14 11:52:34,025 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-12-14 11:52:34,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 11:52:34,025 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:34,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 11:52:34,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 11:52:34,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:34,228 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:52:34,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:34,231 INFO L85 PathProgramCache]: Analyzing trace with hash 889512745, now seen corresponding path program 1 times [2022-12-14 11:52:34,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:52:34,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653829392] [2022-12-14 11:52:34,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:34,233 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-12-14 11:52:34,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:52:34,237 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:34,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:34,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 11:52:34,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:34,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:34,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:34,329 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:52:34,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653829392] [2022-12-14 11:52:34,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653829392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:34,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:52:34,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 11:52:34,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837811954] [2022-12-14 11:52:34,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:34,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:52:34,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:52:34,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:52:34,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:52:34,331 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 3 states, 2 states have (on average 3.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-12-14 11:52:34,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:34,370 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-12-14 11:52:34,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:52:34,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.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-12-14 11:52:34,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:34,371 INFO L225 Difference]: With dead ends: 25 [2022-12-14 11:52:34,371 INFO L226 Difference]: Without dead ends: 24 [2022-12-14 11:52:34,372 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-12-14 11:52:34,372 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:34,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:52:34,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-12-14 11:52:34,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-12-14 11:52:34,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.5) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-12-14 11:52:34,375 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 6 [2022-12-14 11:52:34,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:34,375 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-12-14 11:52:34,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.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-12-14 11:52:34,375 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-12-14 11:52:34,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 11:52:34,376 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:34,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 11:52:34,386 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 11:52:34,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:34,578 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:52:34,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:34,579 INFO L85 PathProgramCache]: Analyzing trace with hash 889512782, now seen corresponding path program 1 times [2022-12-14 11:52:34,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:52:34,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419546525] [2022-12-14 11:52:34,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:34,581 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-12-14 11:52:34,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:52:34,584 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:34,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:34,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 11:52:34,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:34,749 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-12-14 11:52:34,749 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 1 case distinctions, treesize of input 10 treesize of output 16 [2022-12-14 11:52:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:34,773 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:34,773 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:52:34,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419546525] [2022-12-14 11:52:34,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419546525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:34,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:52:34,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:52:34,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112669776] [2022-12-14 11:52:34,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:34,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:52:34,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:52:34,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:52:34,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:52:34,775 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-12-14 11:52:34,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:34,907 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-12-14 11:52:34,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:52:34,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-12-14 11:52:34,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:34,909 INFO L225 Difference]: With dead ends: 40 [2022-12-14 11:52:34,909 INFO L226 Difference]: Without dead ends: 40 [2022-12-14 11:52:34,909 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-12-14 11:52:34,910 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 45 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:34,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 44 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:52:34,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-12-14 11:52:34,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 23. [2022-12-14 11:52:34,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-12-14 11:52:34,912 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 6 [2022-12-14 11:52:34,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:34,912 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-12-14 11:52:34,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-12-14 11:52:34,912 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-12-14 11:52:34,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 11:52:34,912 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:34,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 11:52:34,920 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 11:52:35,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:35,114 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:52:35,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:35,116 INFO L85 PathProgramCache]: Analyzing trace with hash 889572364, now seen corresponding path program 1 times [2022-12-14 11:52:35,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:52:35,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829371965] [2022-12-14 11:52:35,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:35,117 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-12-14 11:52:35,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:52:35,120 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:35,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:35,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 11:52:35,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:35,250 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-12-14 11:52:35,250 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 1 case distinctions, treesize of input 10 treesize of output 16 [2022-12-14 11:52:35,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:35,267 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:35,267 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:52:35,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829371965] [2022-12-14 11:52:35,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829371965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:35,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:52:35,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:52:35,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563626224] [2022-12-14 11:52:35,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:35,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:52:35,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:52:35,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:52:35,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:52:35,269 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-12-14 11:52:35,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:35,321 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-12-14 11:52:35,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:52:35,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-12-14 11:52:35,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:35,323 INFO L225 Difference]: With dead ends: 22 [2022-12-14 11:52:35,323 INFO L226 Difference]: Without dead ends: 22 [2022-12-14 11:52:35,323 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-12-14 11:52:35,324 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:35,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 20 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:52:35,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-12-14 11:52:35,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2022-12-14 11:52:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.5) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:35,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-12-14 11:52:35,326 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 6 [2022-12-14 11:52:35,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:35,326 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-12-14 11:52:35,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-12-14 11:52:35,326 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-12-14 11:52:35,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 11:52:35,327 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:35,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:52:35,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 11:52:35,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:35,529 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:52:35,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:35,530 INFO L85 PathProgramCache]: Analyzing trace with hash 121443375, now seen corresponding path program 1 times [2022-12-14 11:52:35,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:52:35,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658457399] [2022-12-14 11:52:35,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:35,532 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-12-14 11:52:35,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:52:35,535 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:35,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:35,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 11:52:35,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:35,655 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 11:52:35,655 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 1 case distinctions, treesize of input 9 treesize of output 19 [2022-12-14 11:52:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:35,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:35,671 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:52:35,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658457399] [2022-12-14 11:52:35,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658457399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:35,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:52:35,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:52:35,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556953895] [2022-12-14 11:52:35,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:35,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:52:35,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:52:35,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:52:35,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:52:35,672 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:35,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:35,743 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-12-14 11:52:35,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:52:35,744 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 11:52:35,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:35,744 INFO L225 Difference]: With dead ends: 18 [2022-12-14 11:52:35,744 INFO L226 Difference]: Without dead ends: 18 [2022-12-14 11:52:35,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-12-14 11:52:35,745 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:35,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 20 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:52:35,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-12-14 11:52:35,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-12-14 11:52:35,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-12-14 11:52:35,746 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 8 [2022-12-14 11:52:35,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:35,746 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-12-14 11:52:35,746 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), 0 states have call successors, (0), 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-12-14 11:52:35,747 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-12-14 11:52:35,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 11:52:35,747 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:35,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:52:35,754 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 11:52:35,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:35,949 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:52:35,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:35,950 INFO L85 PathProgramCache]: Analyzing trace with hash 121443376, now seen corresponding path program 1 times [2022-12-14 11:52:35,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:52:35,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94882806] [2022-12-14 11:52:35,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:35,952 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-12-14 11:52:35,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:52:35,954 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:35,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:36,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-14 11:52:36,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:36,113 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-12-14 11:52:36,113 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 1 case distinctions, treesize of input 10 treesize of output 16 [2022-12-14 11:52:36,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:36,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:36,155 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:52:36,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94882806] [2022-12-14 11:52:36,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94882806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:36,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:52:36,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:52:36,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028053561] [2022-12-14 11:52:36,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:36,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:52:36,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:52:36,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:52:36,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:52:36,157 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:36,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:36,334 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-12-14 11:52:36,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:52:36,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 11:52:36,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:36,336 INFO L225 Difference]: With dead ends: 42 [2022-12-14 11:52:36,336 INFO L226 Difference]: Without dead ends: 42 [2022-12-14 11:52:36,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-12-14 11:52:36,337 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 55 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:36,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 58 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:52:36,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-12-14 11:52:36,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 22. [2022-12-14 11:52:36,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:36,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-12-14 11:52:36,339 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 8 [2022-12-14 11:52:36,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:36,339 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-12-14 11:52:36,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-12-14 11:52:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 11:52:36,340 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:36,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:52:36,347 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:36,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:36,542 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:52:36,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:36,543 INFO L85 PathProgramCache]: Analyzing trace with hash 123290418, now seen corresponding path program 1 times [2022-12-14 11:52:36,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:52:36,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190565781] [2022-12-14 11:52:36,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:36,545 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-12-14 11:52:36,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:52:36,549 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:36,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:36,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-14 11:52:36,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:36,706 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-12-14 11:52:36,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 0 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 16 [2022-12-14 11:52:36,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:36,773 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:36,773 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:52:36,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190565781] [2022-12-14 11:52:36,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190565781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:36,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:52:36,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:52:36,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491971015] [2022-12-14 11:52:36,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:36,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:52:36,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:52:36,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:52:36,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:52:36,774 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:36,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:36,945 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-12-14 11:52:36,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:52:36,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 11:52:36,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:36,946 INFO L225 Difference]: With dead ends: 32 [2022-12-14 11:52:36,946 INFO L226 Difference]: Without dead ends: 32 [2022-12-14 11:52:36,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-12-14 11:52:36,947 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 55 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:36,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 32 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:52:36,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-12-14 11:52:36,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2022-12-14 11:52:36,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-12-14 11:52:36,948 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 8 [2022-12-14 11:52:36,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:36,948 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-12-14 11:52:36,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:36,948 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-12-14 11:52:36,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 11:52:36,949 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:36,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:52:36,956 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 11:52:37,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:37,151 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:52:37,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:37,151 INFO L85 PathProgramCache]: Analyzing trace with hash -530222670, now seen corresponding path program 1 times [2022-12-14 11:52:37,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:52:37,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962497515] [2022-12-14 11:52:37,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:37,152 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-12-14 11:52:37,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:52:37,153 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:37,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:37,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 11:52:37,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:37,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:52:37,254 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 10 treesize of output 12 [2022-12-14 11:52:37,261 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 10 treesize of output 8 [2022-12-14 11:52:37,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:37,302 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:37,302 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:52:37,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962497515] [2022-12-14 11:52:37,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962497515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:37,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:52:37,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:52:37,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296297828] [2022-12-14 11:52:37,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:37,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:52:37,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:52:37,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:52:37,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:52:37,304 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 4 states have (on average 2.25) 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-12-14 11:52:37,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:37,472 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-12-14 11:52:37,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:52:37,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) 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-12-14 11:52:37,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:37,473 INFO L225 Difference]: With dead ends: 43 [2022-12-14 11:52:37,473 INFO L226 Difference]: Without dead ends: 43 [2022-12-14 11:52:37,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-12-14 11:52:37,474 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 52 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:37,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 56 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:52:37,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-12-14 11:52:37,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2022-12-14 11:52:37,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:37,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-12-14 11:52:37,476 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 9 [2022-12-14 11:52:37,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:37,476 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-12-14 11:52:37,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) 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-12-14 11:52:37,476 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-12-14 11:52:37,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 11:52:37,476 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:37,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:52:37,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 11:52:37,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:37,679 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:52:37,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:37,681 INFO L85 PathProgramCache]: Analyzing trace with hash -530222671, now seen corresponding path program 1 times [2022-12-14 11:52:37,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:52:37,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734156080] [2022-12-14 11:52:37,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:37,682 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-12-14 11:52:37,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:52:37,685 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:37,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:37,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 11:52:37,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:37,842 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 11:52:37,843 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 19 treesize of output 22 [2022-12-14 11:52:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:37,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:37,860 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:52:37,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734156080] [2022-12-14 11:52:37,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734156080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:37,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:52:37,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:52:37,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536100586] [2022-12-14 11:52:37,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:37,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:52:37,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:52:37,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:52:37,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:52:37,861 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-12-14 11:52:37,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:37,923 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-12-14 11:52:37,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:52:37,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-12-14 11:52:37,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:37,924 INFO L225 Difference]: With dead ends: 24 [2022-12-14 11:52:37,924 INFO L226 Difference]: Without dead ends: 24 [2022-12-14 11:52:37,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-12-14 11:52:37,925 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:37,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 20 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:52:37,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-12-14 11:52:37,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-12-14 11:52:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:37,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-12-14 11:52:37,926 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 9 [2022-12-14 11:52:37,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:37,926 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-12-14 11:52:37,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-12-14 11:52:37,927 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-12-14 11:52:37,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 11:52:37,927 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:37,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:52:37,935 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 11:52:38,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:38,128 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:52:38,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:38,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1244784692, now seen corresponding path program 1 times [2022-12-14 11:52:38,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:52:38,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909611767] [2022-12-14 11:52:38,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:38,131 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-12-14 11:52:38,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:52:38,134 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:38,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:38,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 11:52:38,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:38,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:52:38,244 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 10 treesize of output 12 [2022-12-14 11:52:38,247 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 10 treesize of output 8 [2022-12-14 11:52:38,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:38,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:38,301 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:52:38,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [909611767] [2022-12-14 11:52:38,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [909611767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:38,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:52:38,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:52:38,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271911245] [2022-12-14 11:52:38,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:38,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:52:38,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:52:38,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:52:38,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:52:38,302 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.25) 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-12-14 11:52:38,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:38,434 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-12-14 11:52:38,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:52:38,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) 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-12-14 11:52:38,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:38,435 INFO L225 Difference]: With dead ends: 31 [2022-12-14 11:52:38,435 INFO L226 Difference]: Without dead ends: 31 [2022-12-14 11:52:38,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-12-14 11:52:38,436 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 47 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:38,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 28 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:52:38,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-12-14 11:52:38,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2022-12-14 11:52:38,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:38,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-12-14 11:52:38,437 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 9 [2022-12-14 11:52:38,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:38,437 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-12-14 11:52:38,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) 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-12-14 11:52:38,437 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-12-14 11:52:38,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 11:52:38,438 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:38,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:52:38,448 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 11:52:38,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:38,639 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:52:38,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:38,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1026129931, now seen corresponding path program 1 times [2022-12-14 11:52:38,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:52:38,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460903371] [2022-12-14 11:52:38,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:38,641 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-12-14 11:52:38,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:52:38,644 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:38,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:38,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 11:52:38,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:38,790 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-12-14 11:52:38,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:52:38,827 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:52:38,827 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 18 treesize of output 12 [2022-12-14 11:52:38,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:38,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:38,839 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:52:38,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460903371] [2022-12-14 11:52:38,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460903371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:38,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:52:38,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:52:38,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71791103] [2022-12-14 11:52:38,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:38,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:52:38,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:52:38,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:52:38,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:52:38,841 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:38,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:38,986 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-12-14 11:52:38,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:52:38,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 11:52:38,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:38,987 INFO L225 Difference]: With dead ends: 29 [2022-12-14 11:52:38,987 INFO L226 Difference]: Without dead ends: 29 [2022-12-14 11:52:38,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:52:38,988 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:38,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 77 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:52:38,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-12-14 11:52:38,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-12-14 11:52:38,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:38,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-12-14 11:52:38,990 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2022-12-14 11:52:38,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:38,990 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-12-14 11:52:38,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:38,994 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-12-14 11:52:38,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 11:52:38,994 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:38,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:52:39,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:39,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:39,195 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:52:39,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:39,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1706188301, now seen corresponding path program 1 times [2022-12-14 11:52:39,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:52:39,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031125910] [2022-12-14 11:52:39,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:39,199 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-12-14 11:52:39,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:52:39,201 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:39,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:39,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-14 11:52:39,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:39,315 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-12-14 11:52:39,315 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 1 case distinctions, treesize of input 10 treesize of output 16 [2022-12-14 11:52:39,337 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 17 treesize of output 13 [2022-12-14 11:52:39,428 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:52:39,428 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 22 treesize of output 20 [2022-12-14 11:52:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:39,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:52:41,058 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 18 treesize of output 16 [2022-12-14 11:52:41,084 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 29 treesize of output 27 [2022-12-14 11:52:41,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:41,551 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:52:41,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031125910] [2022-12-14 11:52:41,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031125910] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:52:41,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [643474942] [2022-12-14 11:52:41,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:41,552 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 11:52:41,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 11:52:41,553 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 11:52:41,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2022-12-14 11:52:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:41,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 11:52:41,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:41,911 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 17 treesize of output 13 [2022-12-14 11:52:42,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:52:42,109 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:52:42,109 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 20 treesize of output 12 [2022-12-14 11:52:42,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:42,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:42,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [643474942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:42,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 11:52:42,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 22 [2022-12-14 11:52:42,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153243633] [2022-12-14 11:52:42,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:42,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:52:42,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:52:42,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:52:42,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2022-12-14 11:52:42,195 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:42,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:42,582 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-12-14 11:52:42,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:52:42,583 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 11:52:42,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:42,583 INFO L225 Difference]: With dead ends: 42 [2022-12-14 11:52:42,584 INFO L226 Difference]: Without dead ends: 42 [2022-12-14 11:52:42,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2022-12-14 11:52:42,584 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 38 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:42,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 78 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:52:42,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-12-14 11:52:42,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2022-12-14 11:52:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:42,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-12-14 11:52:42,586 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 12 [2022-12-14 11:52:42,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:42,586 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-12-14 11:52:42,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:42,586 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-12-14 11:52:42,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 11:52:42,586 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:42,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:52:42,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2022-12-14 11:52:42,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 11:52:42,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:42,989 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:52:42,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:42,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1313161291, now seen corresponding path program 1 times [2022-12-14 11:52:42,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:52:42,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454631130] [2022-12-14 11:52:42,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:42,991 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-12-14 11:52:42,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:52:42,992 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:42,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:43,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-14 11:52:43,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:43,084 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-12-14 11:52:43,084 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 1 case distinctions, treesize of input 10 treesize of output 16 [2022-12-14 11:52:43,110 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 17 treesize of output 13 [2022-12-14 11:52:43,182 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:52:43,182 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 22 treesize of output 20 [2022-12-14 11:52:43,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:43,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:52:44,857 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 18 treesize of output 16 [2022-12-14 11:52:44,866 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 29 treesize of output 27 [2022-12-14 11:52:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:45,321 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:52:45,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454631130] [2022-12-14 11:52:45,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454631130] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:52:45,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1005626422] [2022-12-14 11:52:45,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:45,321 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 11:52:45,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 11:52:45,322 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 11:52:45,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2022-12-14 11:52:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:45,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 11:52:45,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:45,455 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-12-14 11:52:45,455 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 1 case distinctions, treesize of input 10 treesize of output 16 [2022-12-14 11:52:45,470 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 17 treesize of output 13 [2022-12-14 11:52:45,520 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:52:45,521 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 22 treesize of output 20 [2022-12-14 11:52:45,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:45,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:52:46,088 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 18 treesize of output 16 [2022-12-14 11:52:46,151 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 29 treesize of output 27 [2022-12-14 11:52:47,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:47,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1005626422] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:52:47,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880241186] [2022-12-14 11:52:47,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:47,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:52:47,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:52:47,004 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:52:47,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 11:52:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:47,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 11:52:47,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:47,087 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-12-14 11:52:47,088 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 1 case distinctions, treesize of input 10 treesize of output 16 [2022-12-14 11:52:47,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 17 treesize of output 13 [2022-12-14 11:52:47,167 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:52:47,167 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 22 treesize of output 20 [2022-12-14 11:52:47,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:47,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:52:47,766 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 18 treesize of output 16 [2022-12-14 11:52:47,801 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 29 treesize of output 27 [2022-12-14 11:52:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:47,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880241186] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:52:47,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 11:52:47,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 7, 8, 7] total 16 [2022-12-14 11:52:47,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995191669] [2022-12-14 11:52:47,951 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 11:52:47,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 11:52:47,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:52:47,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 11:52:47,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-12-14 11:52:47,952 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:49,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:49,762 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-12-14 11:52:49,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 11:52:49,763 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 11:52:49,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:49,763 INFO L225 Difference]: With dead ends: 42 [2022-12-14 11:52:49,763 INFO L226 Difference]: Without dead ends: 42 [2022-12-14 11:52:49,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2022-12-14 11:52:49,764 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 66 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:49,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 100 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 11:52:49,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-12-14 11:52:49,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 29. [2022-12-14 11:52:49,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-12-14 11:52:49,766 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 12 [2022-12-14 11:52:49,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:49,766 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-12-14 11:52:49,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:52:49,766 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-12-14 11:52:49,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 11:52:49,766 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:49,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:52:49,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 11:52:49,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2022-12-14 11:52:50,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-14 11:52:50,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:52:50,369 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:52:50,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:50,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1745201594, now seen corresponding path program 1 times [2022-12-14 11:52:50,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:52:50,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090653689] [2022-12-14 11:52:50,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:50,371 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-12-14 11:52:50,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:52:50,372 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:50,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:52:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:50,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 11:52:50,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:52,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:52:52,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:52,581 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:52:52,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090653689] [2022-12-14 11:52:52,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1090653689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:52,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:52:52,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:52:52,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186459554] [2022-12-14 11:52:52,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:52,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:52:52,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:52:52,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:52:52,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=11, Unknown=1, NotChecked=0, Total=20 [2022-12-14 11:52:52,583 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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-12-14 11:52:54,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 11:52:56,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 11:52:58,610 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 [0] [2022-12-14 11:53:00,614 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 [0] [2022-12-14 11:53:02,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 11:53:02,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:53:02,683 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-12-14 11:53:02,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:53:02,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-12-14 11:53:02,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:53:02,684 INFO L225 Difference]: With dead ends: 28 [2022-12-14 11:53:02,684 INFO L226 Difference]: Without dead ends: 18 [2022-12-14 11:53:02,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=8, Invalid=11, Unknown=1, NotChecked=0, Total=20 [2022-12-14 11:53:02,684 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:53:02,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 24 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 5 Unknown, 0 Unchecked, 10.1s Time] [2022-12-14 11:53:02,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-12-14 11:53:02,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-12-14 11:53:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:53:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-12-14 11:53:02,685 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 13 [2022-12-14 11:53:02,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:53:02,686 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-12-14 11:53:02,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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-12-14 11:53:02,686 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-12-14 11:53:02,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 11:53:02,686 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:53:02,686 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:53:02,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 11:53:02,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:53:02,887 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:53:02,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:53:02,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2053294327, now seen corresponding path program 1 times [2022-12-14 11:53:02,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:53:02,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418937137] [2022-12-14 11:53:02,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:53:02,890 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-12-14 11:53:02,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:53:02,893 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:53:02,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:53:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:53:03,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 11:53:03,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:53:03,049 INFO L321 Elim1Store]: treesize reduction 12, result has 45.5 percent of original size [2022-12-14 11:53:03,049 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 1 case distinctions, treesize of input 11 treesize of output 17 [2022-12-14 11:53:03,085 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 10 treesize of output 8 [2022-12-14 11:53:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:53:03,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:53:04,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:53:04,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:53:04,732 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:53:04,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418937137] [2022-12-14 11:53:04,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418937137] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:53:04,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [848454255] [2022-12-14 11:53:04,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:53:04,732 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 11:53:04,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 11:53:04,733 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 11:53:04,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2022-12-14 11:53:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:53:04,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 11:53:04,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:53:04,909 INFO L321 Elim1Store]: treesize reduction 12, result has 45.5 percent of original size [2022-12-14 11:53:04,909 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 1 case distinctions, treesize of input 11 treesize of output 17 [2022-12-14 11:53:04,938 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 10 treesize of output 8 [2022-12-14 11:53:05,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:53:05,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:53:05,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:53:05,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:53:05,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [848454255] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:53:05,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608827934] [2022-12-14 11:53:05,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:53:05,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:53:05,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:53:05,463 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:53:05,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-14 11:53:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:53:05,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-14 11:53:05,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:53:05,603 INFO L321 Elim1Store]: treesize reduction 12, result has 45.5 percent of original size [2022-12-14 11:53:05,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 1 case distinctions, treesize of input 11 treesize of output 17 [2022-12-14 11:53:05,636 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 10 treesize of output 8 [2022-12-14 11:53:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:53:05,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:53:06,153 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:53:06,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:53:06,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608827934] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:53:06,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 11:53:06,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7, 6, 6, 6] total 14 [2022-12-14 11:53:06,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46173942] [2022-12-14 11:53:06,244 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 11:53:06,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 11:53:06,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:53:06,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 11:53:06,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-12-14 11:53:06,245 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:53:08,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:53:08,098 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-12-14 11:53:08,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 11:53:08,099 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 11:53:08,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:53:08,100 INFO L225 Difference]: With dead ends: 29 [2022-12-14 11:53:08,100 INFO L226 Difference]: Without dead ends: 29 [2022-12-14 11:53:08,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2022-12-14 11:53:08,100 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 160 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 11:53:08,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 27 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 11:53:08,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-12-14 11:53:08,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-12-14 11:53:08,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:53:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-12-14 11:53:08,102 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 13 [2022-12-14 11:53:08,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:53:08,102 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-12-14 11:53:08,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:53:08,102 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-12-14 11:53:08,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:53:08,103 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:53:08,103 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:53:08,107 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 0 [2022-12-14 11:53:08,313 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-14 11:53:08,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 11:53:08,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:53:08,705 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:53:08,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:53:08,706 INFO L85 PathProgramCache]: Analyzing trace with hash 767043238, now seen corresponding path program 2 times [2022-12-14 11:53:08,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:53:08,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011580918] [2022-12-14 11:53:08,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 11:53:08,708 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-12-14 11:53:08,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:53:08,710 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:53:08,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:53:08,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 11:53:08,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:53:08,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-14 11:53:08,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:53:08,818 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 10 treesize of output 8 [2022-12-14 11:53:08,826 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 10 treesize of output 12 [2022-12-14 11:53:08,849 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 17 treesize of output 13 [2022-12-14 11:53:08,952 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 20 treesize of output 22 [2022-12-14 11:53:09,071 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:53:09,071 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 20 treesize of output 20 [2022-12-14 11:53:09,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:53:09,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:53:12,223 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:53:12,223 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-12-14 11:53:12,312 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:53:12,312 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 44 treesize of output 40 [2022-12-14 11:53:12,404 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 5 [2022-12-14 11:53:12,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:53:12,993 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:53:12,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011580918] [2022-12-14 11:53:12,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011580918] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:53:12,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [121874071] [2022-12-14 11:53:12,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 11:53:12,994 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 11:53:12,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 11:53:12,995 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 11:53:12,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-12-14 11:53:13,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 11:53:13,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:53:13,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 11:53:13,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:53:13,172 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-12-14 11:53:13,173 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 1 case distinctions, treesize of input 10 treesize of output 16 [2022-12-14 11:53:13,182 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 10 treesize of output 8 [2022-12-14 11:53:13,200 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 17 treesize of output 13 [2022-12-14 11:53:13,284 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 20 treesize of output 22 [2022-12-14 11:53:13,338 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:53:13,339 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 20 treesize of output 20 [2022-12-14 11:53:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:53:13,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:53:14,785 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:53:14,785 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-12-14 11:53:14,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:53:14,938 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 44 treesize of output 40 [2022-12-14 11:53:14,996 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 5 [2022-12-14 11:53:15,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:53:15,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [121874071] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:53:15,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084498538] [2022-12-14 11:53:15,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 11:53:15,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:53:15,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:53:15,901 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:53:15,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-14 11:53:15,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 11:53:15,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:53:15,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 11:53:15,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:53:16,013 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-12-14 11:53:16,013 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 1 case distinctions, treesize of input 10 treesize of output 16 [2022-12-14 11:53:16,026 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 10 treesize of output 8 [2022-12-14 11:53:16,049 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 17 treesize of output 13 [2022-12-14 11:53:16,133 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 20 treesize of output 22 [2022-12-14 11:53:16,224 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:53:16,224 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 20 treesize of output 20 [2022-12-14 11:53:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:53:16,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:53:17,689 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:53:17,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-12-14 11:53:17,804 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:53:17,804 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 44 treesize of output 40 [2022-12-14 11:53:17,882 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 5 [2022-12-14 11:53:18,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:18,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:53:18,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084498538] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:53:18,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 11:53:18,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10, 9, 10, 9] total 19 [2022-12-14 11:53:18,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208761478] [2022-12-14 11:53:18,007 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 11:53:18,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 11:53:18,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:53:18,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 11:53:18,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=317, Unknown=1, NotChecked=0, Total=380 [2022-12-14 11:53:18,009 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:53:21,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:53:21,456 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-12-14 11:53:21,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 11:53:21,458 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 11:53:21,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:53:21,458 INFO L225 Difference]: With dead ends: 27 [2022-12-14 11:53:21,458 INFO L226 Difference]: Without dead ends: 27 [2022-12-14 11:53:21,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 66 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=233, Invalid=822, Unknown=1, NotChecked=0, Total=1056 [2022-12-14 11:53:21,459 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 54 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 11:53:21,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 57 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 169 Invalid, 1 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 11:53:21,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-12-14 11:53:21,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-12-14 11:53:21,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:53:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-12-14 11:53:21,460 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 16 [2022-12-14 11:53:21,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:53:21,461 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-12-14 11:53:21,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:53:21,461 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-12-14 11:53:21,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:53:21,461 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:53:21,461 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:53:21,467 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-14 11:53:21,669 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2022-12-14 11:53:21,875 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 11:53:22,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:53:22,064 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:53:22,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:53:22,065 INFO L85 PathProgramCache]: Analyzing trace with hash 801817308, now seen corresponding path program 3 times [2022-12-14 11:53:22,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:53:22,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175976116] [2022-12-14 11:53:22,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:53:22,066 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-12-14 11:53:22,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:53:22,069 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:53:22,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:53:22,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-14 11:53:22,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:53:22,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-14 11:53:22,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:53:22,283 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-12-14 11:53:22,283 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 1 case distinctions, treesize of input 10 treesize of output 16 [2022-12-14 11:53:22,292 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 10 treesize of output 8 [2022-12-14 11:53:22,321 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 17 treesize of output 13 [2022-12-14 11:53:22,438 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 20 treesize of output 22 [2022-12-14 11:53:22,566 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 21 treesize of output 23 [2022-12-14 11:53:22,698 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-12-14 11:53:22,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:53:22,793 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 20 treesize of output 20 [2022-12-14 11:53:23,382 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:53:23,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:53:27,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:53:27,606 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-12-14 11:53:27,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:53:27,683 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 44 treesize of output 40 [2022-12-14 11:53:27,709 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 5 [2022-12-14 11:53:28,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:53:28,440 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:53:28,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175976116] [2022-12-14 11:53:28,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175976116] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:53:28,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [968290301] [2022-12-14 11:53:28,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:53:28,440 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 11:53:28,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 11:53:28,441 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 11:53:28,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-12-14 11:53:28,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-14 11:53:28,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:53:28,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 11:53:28,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:53:28,719 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 10 treesize of output 8 [2022-12-14 11:53:28,727 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 10 treesize of output 12 [2022-12-14 11:53:28,915 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 17 treesize of output 13 [2022-12-14 11:53:29,298 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 20 treesize of output 22 [2022-12-14 11:53:29,480 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-12-14 11:53:29,642 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-12-14 11:53:29,702 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:53:29,702 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 20 treesize of output 20 [2022-12-14 11:53:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:53:30,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:53:31,522 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:53:31,522 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-12-14 11:53:31,616 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:53:31,616 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 44 treesize of output 40 [2022-12-14 11:53:31,669 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 5 [2022-12-14 11:53:32,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:32,929 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:53:32,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [968290301] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:53:32,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162914323] [2022-12-14 11:53:32,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:53:32,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:53:32,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:53:32,930 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:53:32,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-14 11:53:33,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-14 11:53:33,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:53:33,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-14 11:53:33,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:53:33,139 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-12-14 11:53:33,140 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 1 case distinctions, treesize of input 10 treesize of output 16 [2022-12-14 11:53:33,151 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 10 treesize of output 8 [2022-12-14 11:53:33,172 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 17 treesize of output 13 [2022-12-14 11:53:33,255 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 20 treesize of output 22 [2022-12-14 11:53:33,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 18 treesize of output 20 [2022-12-14 11:53:33,658 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-12-14 11:53:34,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:53:34,017 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 20 treesize of output 20 [2022-12-14 11:53:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:53:34,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:53:41,536 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:53:41,536 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-12-14 11:53:41,625 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:53:41,626 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 44 treesize of output 40 [2022-12-14 11:53:41,782 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 5 [2022-12-14 11:53:42,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:53:42,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162914323] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:53:42,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 11:53:42,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11, 13, 11] total 36 [2022-12-14 11:53:42,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743566361] [2022-12-14 11:53:42,086 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 11:53:42,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 11:53:42,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:53:42,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 11:53:42,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1134, Unknown=4, NotChecked=0, Total=1332 [2022-12-14 11:53:42,087 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 37 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 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-12-14 11:54:00,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:54:00,908 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-12-14 11:54:00,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-14 11:54:00,909 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 11:54:00,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:54:00,909 INFO L225 Difference]: With dead ends: 45 [2022-12-14 11:54:00,909 INFO L226 Difference]: Without dead ends: 45 [2022-12-14 11:54:00,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 98 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=870, Invalid=3280, Unknown=10, NotChecked=0, Total=4160 [2022-12-14 11:54:00,910 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 188 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 18 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-12-14 11:54:00,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 74 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 336 Invalid, 11 Unknown, 0 Unchecked, 2.3s Time] [2022-12-14 11:54:00,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-12-14 11:54:00,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-12-14 11:54:00,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 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-12-14 11:54:00,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-12-14 11:54:00,912 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 24 [2022-12-14 11:54:00,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:54:00,912 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-12-14 11:54:00,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 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-12-14 11:54:00,912 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-12-14 11:54:00,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 11:54:00,912 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:54:00,912 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:54:00,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:54:01,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2022-12-14 11:54:01,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-12-14 11:54:01,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:54:01,514 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:54:01,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:54:01,515 INFO L85 PathProgramCache]: Analyzing trace with hash -913467258, now seen corresponding path program 2 times [2022-12-14 11:54:01,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:54:01,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610506660] [2022-12-14 11:54:01,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 11:54:01,517 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-12-14 11:54:01,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:54:01,520 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:54:01,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:54:01,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 11:54:01,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:54:01,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-14 11:54:01,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:54:01,730 INFO L321 Elim1Store]: treesize reduction 12, result has 45.5 percent of original size [2022-12-14 11:54:01,730 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 1 case distinctions, treesize of input 11 treesize of output 17 [2022-12-14 11:54:01,763 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 10 treesize of output 8 [2022-12-14 11:54:02,567 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:54:02,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:54:08,076 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:54:08,250 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:54:08,250 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:54:08,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610506660] [2022-12-14 11:54:08,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610506660] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:54:08,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1740830409] [2022-12-14 11:54:08,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 11:54:08,250 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 11:54:08,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 11:54:08,251 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 11:54:08,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2022-12-14 11:54:08,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 11:54:08,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:54:08,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 11:54:08,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:54:08,487 INFO L321 Elim1Store]: treesize reduction 12, result has 45.5 percent of original size [2022-12-14 11:54:08,488 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 1 case distinctions, treesize of input 11 treesize of output 17 [2022-12-14 11:54:08,528 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 10 treesize of output 8 [2022-12-14 11:54:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:54:09,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:54:20,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:54:21,263 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:54:21,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1740830409] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:54:21,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166250092] [2022-12-14 11:54:21,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 11:54:21,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:54:21,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:54:21,265 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:54:21,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-14 11:54:21,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 11:54:21,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:54:21,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 11:54:21,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:54:21,427 INFO L321 Elim1Store]: treesize reduction 12, result has 45.5 percent of original size [2022-12-14 11:54:21,427 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 1 case distinctions, treesize of input 11 treesize of output 17 [2022-12-14 11:54:21,463 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 10 treesize of output 8 [2022-12-14 11:54:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:54:22,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:54:29,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:54:29,078 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:54:29,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166250092] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:54:29,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 11:54:29,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11, 10, 11, 10] total 35 [2022-12-14 11:54:29,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875921762] [2022-12-14 11:54:29,078 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 11:54:29,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 11:54:29,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:54:29,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 11:54:29,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1027, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 11:54:29,079 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:54:40,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 11:54:47,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 11:54:55,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:54:55,212 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-12-14 11:54:55,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 11:54:55,213 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 11:54:55,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:54:55,214 INFO L225 Difference]: With dead ends: 53 [2022-12-14 11:54:55,214 INFO L226 Difference]: Without dead ends: 53 [2022-12-14 11:54:55,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 107 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 39.2s TimeCoverageRelationStatistics Valid=853, Invalid=2339, Unknown=0, NotChecked=0, Total=3192 [2022-12-14 11:54:55,214 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 229 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:54:55,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 108 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 222 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2022-12-14 11:54:55,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-14 11:54:55,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-12-14 11:54:55,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 50 states have internal predecessors, (53), 0 states have call successors, (0), 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-12-14 11:54:55,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2022-12-14 11:54:55,216 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 25 [2022-12-14 11:54:55,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:54:55,216 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2022-12-14 11:54:55,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:54:55,216 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-12-14 11:54:55,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 11:54:55,217 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:54:55,217 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:54:55,223 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-14 11:54:55,450 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 11:54:55,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2022-12-14 11:54:55,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 11:54:55,820 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:54:55,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:54:55,820 INFO L85 PathProgramCache]: Analyzing trace with hash 522205512, now seen corresponding path program 4 times [2022-12-14 11:54:55,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:54:55,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985095346] [2022-12-14 11:54:55,822 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 11:54:55,822 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-12-14 11:54:55,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:54:55,825 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:54:55,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:54:56,030 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 11:54:56,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:54:56,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-14 11:54:56,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:54:56,057 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 10 treesize of output 8 [2022-12-14 11:54:56,064 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 10 treesize of output 12 [2022-12-14 11:54:56,088 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 17 treesize of output 13 [2022-12-14 11:54:56,190 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 20 treesize of output 22 [2022-12-14 11:54:56,291 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-12-14 11:54:56,396 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-12-14 11:54:56,516 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-12-14 11:54:56,645 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-12-14 11:54:56,777 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-12-14 11:54:56,915 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-12-14 11:54:57,078 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:54:57,079 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 20 treesize of output 20 [2022-12-14 11:54:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:54:57,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:55:05,902 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:55:05,902 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-12-14 11:55:05,961 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:55:05,962 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 44 treesize of output 40 [2022-12-14 11:55:06,060 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 5 [2022-12-14 11:55:06,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:06,927 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:55:06,927 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:55:06,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985095346] [2022-12-14 11:55:06,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985095346] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:55:06,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1015641000] [2022-12-14 11:55:06,928 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 11:55:06,928 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 11:55:06,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 11:55:06,929 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 11:55:06,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2022-12-14 11:55:07,349 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 11:55:07,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:55:07,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 11:55:07,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:55:07,389 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-12-14 11:55:07,389 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 1 case distinctions, treesize of input 10 treesize of output 16 [2022-12-14 11:55:07,397 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 10 treesize of output 8 [2022-12-14 11:55:07,689 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 17 treesize of output 13 [2022-12-14 11:55:08,066 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 20 treesize of output 22 [2022-12-14 11:55:08,153 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-12-14 11:55:08,235 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-12-14 11:55:08,321 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-12-14 11:55:08,409 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-12-14 11:55:08,495 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-12-14 11:55:08,581 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-12-14 11:55:08,648 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:55:08,648 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 20 treesize of output 20 [2022-12-14 11:55:09,240 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:55:09,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:55:11,777 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:55:11,777 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-12-14 11:55:11,928 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:55:11,929 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 44 treesize of output 40 [2022-12-14 11:55:12,042 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 5 [2022-12-14 11:55:13,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:55:13,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1015641000] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:55:13,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412194287] [2022-12-14 11:55:13,619 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 11:55:13,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:55:13,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:55:13,620 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:55:13,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-14 11:55:13,739 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 11:55:13,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:55:13,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-14 11:55:13,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:55:13,763 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 10 treesize of output 8 [2022-12-14 11:55:13,773 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 10 treesize of output 12 [2022-12-14 11:55:13,799 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 17 treesize of output 13 [2022-12-14 11:55:13,894 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 20 treesize of output 22 [2022-12-14 11:55:13,969 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-12-14 11:55:14,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 18 treesize of output 20 [2022-12-14 11:55:14,108 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-12-14 11:55:14,178 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-12-14 11:55:14,245 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-12-14 11:55:14,455 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-12-14 11:55:14,862 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:55:14,862 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 20 treesize of output 20 [2022-12-14 11:55:15,323 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:55:15,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:55:32,087 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:55:32,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-12-14 11:55:32,207 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:55:32,207 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 44 treesize of output 40 [2022-12-14 11:55:32,262 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 5 [2022-12-14 11:55:32,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:55:32,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412194287] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:55:32,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 11:55:32,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16, 15, 17, 15] total 46 [2022-12-14 11:55:32,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460406098] [2022-12-14 11:55:32,561 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 11:55:32,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-12-14 11:55:32,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:55:32,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-12-14 11:55:32,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1863, Unknown=4, NotChecked=0, Total=2162 [2022-12-14 11:55:32,562 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 47 states, 46 states have (on average 2.5652173913043477) internal successors, (118), 47 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:56:46,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:56:46,161 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2022-12-14 11:56:46,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-12-14 11:56:46,161 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.5652173913043477) internal successors, (118), 47 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-12-14 11:56:46,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:56:46,161 INFO L225 Difference]: With dead ends: 79 [2022-12-14 11:56:46,161 INFO L226 Difference]: Without dead ends: 79 [2022-12-14 11:56:46,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 185 SyntacticMatches, 5 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2654 ImplicationChecksByTransitivity, 92.3s TimeCoverageRelationStatistics Valid=2220, Invalid=8237, Unknown=49, NotChecked=0, Total=10506 [2022-12-14 11:56:46,163 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 335 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 28 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-12-14 11:56:46,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 83 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 643 Invalid, 28 Unknown, 0 Unchecked, 5.5s Time] [2022-12-14 11:56:46,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-12-14 11:56:46,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2022-12-14 11:56:46,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 73 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:56:46,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2022-12-14 11:56:46,165 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 40 [2022-12-14 11:56:46,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:56:46,165 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2022-12-14 11:56:46,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.5652173913043477) internal successors, (118), 47 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:56:46,165 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-12-14 11:56:46,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-14 11:56:46,166 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:56:46,166 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:56:46,176 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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)] Ended with exit code 0 [2022-12-14 11:56:46,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-12-14 11:56:46,574 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2022-12-14 11:56:46,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 11:56:46,768 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 11:56:46,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:56:46,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1382851548, now seen corresponding path program 3 times [2022-12-14 11:56:46,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:56:46,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854918641] [2022-12-14 11:56:46,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:56:46,771 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-12-14 11:56:46,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:56:46,774 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:56:46,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 11:56:47,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-12-14 11:56:47,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:56:47,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-14 11:56:47,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:56:47,251 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 10 treesize of output 8 [2022-12-14 11:56:47,261 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 11 treesize of output 13 [2022-12-14 11:56:49,079 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:56:49,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:57:03,577 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:57:03,878 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:57:03,878 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:57:03,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854918641] [2022-12-14 11:57:03,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854918641] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:57:03,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1310843833] [2022-12-14 11:57:03,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:57:03,879 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 11:57:03,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 11:57:03,879 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 11:57:03,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2022-12-14 11:57:05,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-12-14 11:57:05,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:57:05,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 70 conjunts are in the unsatisfiable core [2022-12-14 11:57:05,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:57:05,925 INFO L321 Elim1Store]: treesize reduction 12, result has 45.5 percent of original size [2022-12-14 11:57:05,925 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 1 case distinctions, treesize of input 11 treesize of output 17 [2022-12-14 11:57:05,949 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 10 treesize of output 8 [2022-12-14 11:57:07,918 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:57:07,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:57:46,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:57:46,918 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:57:46,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1310843833] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:57:46,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916104055] [2022-12-14 11:57:46,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:57:46,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:57:46,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:57:46,920 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:57:46,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-14 11:57:47,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-12-14 11:57:47,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:57:47,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-14 11:57:47,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:57:47,723 INFO L321 Elim1Store]: treesize reduction 12, result has 45.5 percent of original size [2022-12-14 11:57:47,724 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 1 case distinctions, treesize of input 11 treesize of output 17 [2022-12-14 11:57:47,766 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 10 treesize of output 8 [2022-12-14 11:57:49,785 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:57:49,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:58:32,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:58:32,622 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:58:32,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916104055] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:58:32,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 11:58:32,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 18, 17, 18, 18] total 65 [2022-12-14 11:58:32,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757582597] [2022-12-14 11:58:32,623 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 11:58:32,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-12-14 11:58:32,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:58:32,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-12-14 11:58:32,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=809, Invalid=3481, Unknown=0, NotChecked=0, Total=4290 [2022-12-14 11:58:32,627 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 66 states, 65 states have (on average 3.0307692307692307) internal successors, (197), 66 states have internal predecessors, (197), 0 states have call successors, (0), 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-12-14 11:58:46,873 WARN L233 SmtUtils]: Spent 6.85s on a formula simplification that was a NOOP. DAG size: 142 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:58:52,874 WARN L233 SmtUtils]: Spent 5.27s on a formula simplification that was a NOOP. DAG size: 137 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:58:54,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 11:58:56,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 11:59:03,729 WARN L233 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 133 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:59:09,884 WARN L233 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:59:12,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 11:59:18,891 WARN L233 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 123 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:59:26,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 12:00:37,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:37,167 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2022-12-14 12:00:37,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-14 12:00:37,168 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 3.0307692307692307) internal successors, (197), 66 states have internal predecessors, (197), 0 states have call successors, (0), 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 49 [2022-12-14 12:00:37,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:37,169 INFO L225 Difference]: With dead ends: 105 [2022-12-14 12:00:37,169 INFO L226 Difference]: Without dead ends: 105 [2022-12-14 12:00:37,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 220 SyntacticMatches, 9 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3113 ImplicationChecksByTransitivity, 181.9s TimeCoverageRelationStatistics Valid=3236, Invalid=9196, Unknown=0, NotChecked=0, Total=12432 [2022-12-14 12:00:37,171 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 838 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 20 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:37,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 279 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 657 Invalid, 3 Unknown, 0 Unchecked, 15.8s Time] [2022-12-14 12:00:37,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-12-14 12:00:37,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2022-12-14 12:00:37,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 97 states have (on average 1.0824742268041236) internal successors, (105), 98 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:00:37,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2022-12-14 12:00:37,175 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 49 [2022-12-14 12:00:37,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:37,175 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2022-12-14 12:00:37,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 3.0307692307692307) internal successors, (197), 66 states have internal predecessors, (197), 0 states have call successors, (0), 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-12-14 12:00:37,176 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2022-12-14 12:00:37,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-14 12:00:37,176 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:37,176 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:37,186 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-12-14 12:00:37,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2022-12-14 12:00:37,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 12:00:37,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 12:00:37,779 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 12:00:37,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:37,780 INFO L85 PathProgramCache]: Analyzing trace with hash -76276192, now seen corresponding path program 5 times [2022-12-14 12:00:37,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 12:00:37,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354954992] [2022-12-14 12:00:37,781 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-14 12:00:37,781 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-12-14 12:00:37,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 12:00:37,784 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 12:00:37,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/mathsat -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-12-14 12:00:38,623 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2022-12-14 12:00:38,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:00:38,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 102 conjunts are in the unsatisfiable core [2022-12-14 12:00:38,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:00:38,686 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-12-14 12:00:38,686 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 1 case distinctions, treesize of input 10 treesize of output 16 [2022-12-14 12:00:38,698 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 10 treesize of output 8 [2022-12-14 12:00:38,731 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 17 treesize of output 13 [2022-12-14 12:00:38,871 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 20 treesize of output 22 [2022-12-14 12:00:39,016 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-12-14 12:00:39,165 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-12-14 12:00:39,324 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-12-14 12:00:39,482 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-12-14 12:00:39,642 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-12-14 12:00:39,805 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-12-14 12:00:39,960 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-12-14 12:00:40,116 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-12-14 12:00:40,283 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-12-14 12:00:40,456 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-12-14 12:00:40,627 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-12-14 12:00:40,802 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-12-14 12:00:40,990 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-12-14 12:00:41,168 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-12-14 12:00:41,407 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:00:41,407 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 20 treesize of output 20 [2022-12-14 12:00:42,386 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:00:42,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:01:03,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:01:03,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-12-14 12:01:03,385 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:01:03,385 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 44 treesize of output 40 [2022-12-14 12:01:03,412 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 5 [2022-12-14 12:01:04,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:04,919 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:01:04,920 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 12:01:04,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354954992] [2022-12-14 12:01:04,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354954992] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:01:04,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1352629406] [2022-12-14 12:01:04,920 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-14 12:01:04,920 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 12:01:04,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 12:01:04,921 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 12:01:04,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2022-12-14 12:02:50,062 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2022-12-14 12:02:50,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:02:50,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 104 conjunts are in the unsatisfiable core [2022-12-14 12:02:50,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:02:50,414 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 10 treesize of output 8 [2022-12-14 12:02:50,431 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 10 treesize of output 12 [2022-12-14 12:02:50,470 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 17 treesize of output 13 [2022-12-14 12:02:50,563 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 20 treesize of output 22 [2022-12-14 12:02:50,699 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-12-14 12:02:50,804 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-12-14 12:02:50,915 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-12-14 12:02:51,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 18 treesize of output 20 [2022-12-14 12:02:51,133 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-12-14 12:02:51,234 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-12-14 12:02:51,343 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-12-14 12:02:51,458 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-12-14 12:02:51,568 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-12-14 12:02:51,676 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-12-14 12:02:51,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 18 treesize of output 20 [2022-12-14 12:02:51,899 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-12-14 12:02:52,001 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-12-14 12:02:52,103 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-12-14 12:02:52,182 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:02:52,182 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 20 treesize of output 20 [2022-12-14 12:02:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:02:52,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:03:36,758 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:03:36,758 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-12-14 12:03:36,891 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:03:36,891 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 44 treesize of output 40 [2022-12-14 12:03:36,981 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 5 [2022-12-14 12:03:40,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:03:40,134 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:03:40,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1352629406] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:03:40,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236259640] [2022-12-14 12:03:40,135 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-14 12:03:40,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:03:40,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:03:40,136 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:03:40,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa4c340-2d7a-4cdc-b5e0-18b77cb37645/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process