./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/verifythis/lcp.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/verifythis/lcp.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 01:58:02,185 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:58:02,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:58:02,239 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:58:02,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:58:02,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:58:02,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:58:02,251 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:58:02,254 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:58:02,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:58:02,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:58:02,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:58:02,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:58:02,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:58:02,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:58:02,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:58:02,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:58:02,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:58:02,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:58:02,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:58:02,288 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:58:02,290 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:58:02,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:58:02,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:58:02,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:58:02,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:58:02,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:58:02,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:58:02,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:58:02,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:58:02,313 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:58:02,314 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:58:02,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:58:02,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:58:02,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:58:02,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:58:02,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:58:02,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:58:02,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:58:02,323 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:58:02,324 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:58:02,325 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 01:58:02,377 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:58:02,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:58:02,381 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:58:02,381 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:58:02,382 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:58:02,383 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:58:02,383 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:58:02,383 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:58:02,384 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:58:02,384 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:58:02,385 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:58:02,385 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:58:02,386 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:58:02,386 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:58:02,386 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:58:02,387 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:58:02,387 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:58:02,387 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:58:02,388 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:58:02,388 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:58:02,389 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:58:02,389 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:58:02,389 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:58:02,389 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:58:02,390 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:58:02,390 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:58:02,390 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:58:02,390 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:58:02,391 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:58:02,391 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:58:02,391 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:58:02,392 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:58:02,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:58:02,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:58:02,393 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:58:02,393 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:58:02,393 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:58:02,393 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:58:02,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:58:02,394 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:58:02,394 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:58:02,394 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_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/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_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a [2022-11-03 01:58:02,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:58:02,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:58:02,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:58:02,821 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:58:02,843 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:58:02,844 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/verifythis/lcp.c [2022-11-03 01:58:02,935 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/data/c6bfdead2/c0410930dc2c4950b51851ebc240d785/FLAGa2ef3b6a2 [2022-11-03 01:58:03,505 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:58:03,506 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/sv-benchmarks/c/verifythis/lcp.c [2022-11-03 01:58:03,514 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/data/c6bfdead2/c0410930dc2c4950b51851ebc240d785/FLAGa2ef3b6a2 [2022-11-03 01:58:03,859 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/data/c6bfdead2/c0410930dc2c4950b51851ebc240d785 [2022-11-03 01:58:03,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:58:03,865 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:58:03,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:58:03,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:58:03,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:58:03,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:58:03" (1/1) ... [2022-11-03 01:58:03,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ffe5a6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:03, skipping insertion in model container [2022-11-03 01:58:03,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:58:03" (1/1) ... [2022-11-03 01:58:03,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:58:03,903 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:58:04,101 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/sv-benchmarks/c/verifythis/lcp.c[515,528] [2022-11-03 01:58:04,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:58:04,154 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:58:04,178 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/sv-benchmarks/c/verifythis/lcp.c[515,528] [2022-11-03 01:58:04,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:58:04,228 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:58:04,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:04 WrapperNode [2022-11-03 01:58:04,229 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:58:04,230 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:58:04,231 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:58:04,231 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:58:04,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:04" (1/1) ... [2022-11-03 01:58:04,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:04" (1/1) ... [2022-11-03 01:58:04,305 INFO L138 Inliner]: procedures = 20, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 84 [2022-11-03 01:58:04,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:58:04,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:58:04,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:58:04,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:58:04,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:04" (1/1) ... [2022-11-03 01:58:04,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:04" (1/1) ... [2022-11-03 01:58:04,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:04" (1/1) ... [2022-11-03 01:58:04,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:04" (1/1) ... [2022-11-03 01:58:04,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:04" (1/1) ... [2022-11-03 01:58:04,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:04" (1/1) ... [2022-11-03 01:58:04,359 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:04" (1/1) ... [2022-11-03 01:58:04,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:04" (1/1) ... [2022-11-03 01:58:04,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:58:04,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:58:04,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:58:04,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:58:04,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:04" (1/1) ... [2022-11-03 01:58:04,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:58:04,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:58:04,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:58:04,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:58:04,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:58:04,475 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-03 01:58:04,476 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-03 01:58:04,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:58:04,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 01:58:04,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:58:04,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:58:04,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 01:58:04,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-03 01:58:04,477 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-03 01:58:04,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 01:58:04,604 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:58:04,607 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:58:04,921 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:58:05,011 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:58:05,015 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-03 01:58:05,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:58:05 BoogieIcfgContainer [2022-11-03 01:58:05,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:58:05,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:58:05,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:58:05,031 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:58:05,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:58:03" (1/3) ... [2022-11-03 01:58:05,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66bb938d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:58:05, skipping insertion in model container [2022-11-03 01:58:05,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:04" (2/3) ... [2022-11-03 01:58:05,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66bb938d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:58:05, skipping insertion in model container [2022-11-03 01:58:05,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:58:05" (3/3) ... [2022-11-03 01:58:05,038 INFO L112 eAbstractionObserver]: Analyzing ICFG lcp.c [2022-11-03 01:58:05,063 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:58:05,063 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 01:58:05,162 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:58:05,174 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@b6ecd01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:58:05,174 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 01:58:05,183 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-03 01:58:05,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 01:58:05,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:05,195 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:05,197 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:58:05,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:05,206 INFO L85 PathProgramCache]: Analyzing trace with hash 99151594, now seen corresponding path program 1 times [2022-11-03 01:58:05,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:05,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628709961] [2022-11-03 01:58:05,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:05,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:05,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:58:05,463 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:05,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628709961] [2022-11-03 01:58:05,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628709961] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:58:05,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:58:05,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:58:05,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929399164] [2022-11-03 01:58:05,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:58:05,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 01:58:05,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:05,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 01:58:05,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 01:58:05,514 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 01:58:05,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:05,598 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-11-03 01:58:05,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 01:58:05,601 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2022-11-03 01:58:05,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:05,610 INFO L225 Difference]: With dead ends: 43 [2022-11-03 01:58:05,613 INFO L226 Difference]: Without dead ends: 22 [2022-11-03 01:58:05,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 01:58:05,624 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:05,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:58:05,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-03 01:58:05,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-11-03 01:58:05,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 01:58:05,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-11-03 01:58:05,690 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 19 [2022-11-03 01:58:05,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:05,694 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-11-03 01:58:05,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 01:58:05,695 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-11-03 01:58:05,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 01:58:05,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:05,701 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:05,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:58:05,702 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:58:05,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:05,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1478693215, now seen corresponding path program 1 times [2022-11-03 01:58:05,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:05,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006480897] [2022-11-03 01:58:05,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:05,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:06,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:58:06,375 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:06,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006480897] [2022-11-03 01:58:06,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006480897] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:58:06,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:58:06,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 01:58:06,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066351242] [2022-11-03 01:58:06,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:58:06,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:58:06,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:06,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:58:06,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:58:06,389 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 01:58:06,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:06,590 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-11-03 01:58:06,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:58:06,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2022-11-03 01:58:06,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:06,594 INFO L225 Difference]: With dead ends: 28 [2022-11-03 01:58:06,595 INFO L226 Difference]: Without dead ends: 24 [2022-11-03 01:58:06,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-03 01:58:06,602 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:06,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 59 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:58:06,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-03 01:58:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-03 01:58:06,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 01:58:06,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-11-03 01:58:06,617 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2022-11-03 01:58:06,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:06,617 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-11-03 01:58:06,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 01:58:06,618 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-11-03 01:58:06,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 01:58:06,619 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:06,619 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:06,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:58:06,620 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:58:06,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:06,621 INFO L85 PathProgramCache]: Analyzing trace with hash 711000184, now seen corresponding path program 1 times [2022-11-03 01:58:06,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:06,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113006876] [2022-11-03 01:58:06,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:06,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:07,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:58:07,346 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:07,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113006876] [2022-11-03 01:58:07,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113006876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:58:07,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:58:07,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 01:58:07,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284109838] [2022-11-03 01:58:07,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:58:07,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:58:07,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:07,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:58:07,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:58:07,350 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 01:58:07,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:07,641 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-11-03 01:58:07,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:58:07,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2022-11-03 01:58:07,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:07,646 INFO L225 Difference]: With dead ends: 37 [2022-11-03 01:58:07,646 INFO L226 Difference]: Without dead ends: 26 [2022-11-03 01:58:07,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:58:07,652 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:07,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 75 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:58:07,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-03 01:58:07,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-03 01:58:07,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 01:58:07,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-11-03 01:58:07,669 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 27 [2022-11-03 01:58:07,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:07,669 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-11-03 01:58:07,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 01:58:07,670 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-11-03 01:58:07,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 01:58:07,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:07,671 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:07,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 01:58:07,672 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:58:07,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:07,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1986880223, now seen corresponding path program 1 times [2022-11-03 01:58:07,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:07,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776289034] [2022-11-03 01:58:07,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:07,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:08,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:58:08,325 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:08,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776289034] [2022-11-03 01:58:08,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776289034] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:58:08,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226343533] [2022-11-03 01:58:08,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:08,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:58:08,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:58:08,339 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:58:08,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 01:58:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:08,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 01:58:08,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:58:08,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-03 01:58:10,550 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_1| Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_1|))) is different from true [2022-11-03 01:58:10,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2022-11-03 01:58:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 2 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:58:11,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:58:13,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226343533] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:58:13,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1766452088] [2022-11-03 01:58:13,589 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-03 01:58:13,590 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:58:13,593 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:58:13,599 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:58:13,600 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:58:13,797 INFO L356 Elim1Store]: treesize reduction 22, result has 46.3 percent of original size [2022-11-03 01:58:13,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 65 [2022-11-03 01:58:13,900 INFO L356 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-03 01:58:13,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-03 01:58:13,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2022-11-03 01:58:15,383 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 112 for LOIs [2022-11-03 01:58:15,642 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2022-11-03 01:58:15,644 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:58:35,683 WARN L234 SmtUtils]: Spent 14.33s on a formula simplification. DAG size of input: 112 DAG size of output: 108 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:58:51,928 WARN L234 SmtUtils]: Spent 16.13s on a formula simplification. DAG size of input: 114 DAG size of output: 110 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:58:54,266 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '473#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 01:58:54,267 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:58:54,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:58:54,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-11-03 01:58:54,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762636449] [2022-11-03 01:58:54,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 01:58:54,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 01:58:54,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:54,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 01:58:54,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=691, Unknown=2, NotChecked=54, Total=870 [2022-11-03 01:58:54,270 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-03 01:58:54,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:54,475 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-11-03 01:58:54,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:58:54,475 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 29 [2022-11-03 01:58:54,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:54,476 INFO L225 Difference]: With dead ends: 28 [2022-11-03 01:58:54,476 INFO L226 Difference]: Without dead ends: 0 [2022-11-03 01:58:54,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 42.9s TimeCoverageRelationStatistics Valid=167, Invalid=891, Unknown=2, NotChecked=62, Total=1122 [2022-11-03 01:58:54,478 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:54,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 41 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 53 Invalid, 0 Unknown, 27 Unchecked, 0.1s Time] [2022-11-03 01:58:54,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-03 01:58:54,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-03 01:58:54,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:54,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-03 01:58:54,480 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2022-11-03 01:58:54,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:54,480 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-03 01:58:54,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-03 01:58:54,481 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-03 01:58:54,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-03 01:58:54,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 01:58:54,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 01:58:54,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:58:54,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-03 01:58:54,935 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-03 01:58:54,935 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2022-11-03 01:58:54,935 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |ULTIMATE.start_lcp_~a#1.base|)) (.cse1 (* |ULTIMATE.start_lcp_~l~0#1| 4)) (.cse2 (select |#memory_int| |ULTIMATE.start_check_~a#1.base|)) (.cse3 (* |ULTIMATE.start_check_~i~0#1| 4))) (and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_~y#1|) (= (select .cse0 (+ (* 4 |ULTIMATE.start_lcp_~x#1|) |ULTIMATE.start_lcp_~a#1.offset| .cse1)) 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (or (<= |ULTIMATE.start_check_~n#1| (+ |ULTIMATE.start_check_~l#1| |ULTIMATE.start_check_~x#1|)) (<= |ULTIMATE.start_check_~n#1| (+ |ULTIMATE.start_check_~l#1| |ULTIMATE.start_check_~y#1|))) (= (select .cse0 (+ |ULTIMATE.start_lcp_~a#1.offset| (* 4 |ULTIMATE.start_lcp_~y#1|) .cse1)) 0) (= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_lcp_~x#1|) (= (select .cse2 (+ |ULTIMATE.start_check_~a#1.offset| (* 4 |ULTIMATE.start_check_~x#1|) .cse3)) 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_lcp_~n#1|) (or (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_lcp_~l~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_lcp_~l~0#1| |ULTIMATE.start_main_~x~0#1|))) (= (select .cse2 (+ (* 4 |ULTIMATE.start_check_~y#1|) |ULTIMATE.start_check_~a#1.offset| .cse3)) 0))) [2022-11-03 01:58:54,936 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-11-03 01:58:54,936 INFO L902 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: true [2022-11-03 01:58:54,936 INFO L899 garLoopResultBuilder]: For program point L38-1(line 38) no Hoare annotation was computed. [2022-11-03 01:58:54,936 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: false [2022-11-03 01:58:54,936 INFO L899 garLoopResultBuilder]: For program point L32-1(line 32) no Hoare annotation was computed. [2022-11-03 01:58:54,936 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-03 01:58:54,936 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |ULTIMATE.start_lcp_~a#1.base|)) (.cse1 (* |ULTIMATE.start_lcp_~l~0#1| 4)) (.cse2 (select |#memory_int| |ULTIMATE.start_check_~a#1.base|)) (.cse3 (* |ULTIMATE.start_check_~i~0#1| 4))) (and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_~y#1|) (= (select .cse0 (+ (* 4 |ULTIMATE.start_lcp_~x#1|) |ULTIMATE.start_lcp_~a#1.offset| .cse1)) 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (or (<= |ULTIMATE.start_check_~n#1| (+ |ULTIMATE.start_check_~l#1| |ULTIMATE.start_check_~x#1|)) (<= |ULTIMATE.start_check_~n#1| (+ |ULTIMATE.start_check_~l#1| |ULTIMATE.start_check_~y#1|))) (= (select .cse0 (+ |ULTIMATE.start_lcp_~a#1.offset| (* 4 |ULTIMATE.start_lcp_~y#1|) .cse1)) 0) (= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_lcp_~x#1|) (= (select .cse2 (+ |ULTIMATE.start_check_~a#1.offset| (* 4 |ULTIMATE.start_check_~x#1|) .cse3)) 0) (= |ULTIMATE.start_check_#t~mem11#1| |ULTIMATE.start_check_#t~mem10#1|) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_lcp_~n#1|) (or (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_lcp_~l~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_lcp_~l~0#1| |ULTIMATE.start_main_~x~0#1|))) (= (select .cse2 (+ (* 4 |ULTIMATE.start_check_~y#1|) |ULTIMATE.start_check_~a#1.offset| .cse3)) 0))) [2022-11-03 01:58:54,937 INFO L899 garLoopResultBuilder]: For program point L28-1(line 28) no Hoare annotation was computed. [2022-11-03 01:58:54,937 INFO L902 garLoopResultBuilder]: At program point L24(lines 24 33) the Hoare annotation is: true [2022-11-03 01:58:54,937 INFO L899 garLoopResultBuilder]: For program point L18-3(lines 18 20) no Hoare annotation was computed. [2022-11-03 01:58:54,937 INFO L895 garLoopResultBuilder]: At program point L18-5(lines 18 20) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_~y#1|) (= .cse0 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (= .cse0 (select |#memory_int| |ULTIMATE.start_lcp_~a#1.base|)) (= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_lcp_~x#1|) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_lcp_~n#1|))) [2022-11-03 01:58:54,937 INFO L895 garLoopResultBuilder]: At program point L18-6(lines 18 20) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |ULTIMATE.start_lcp_~a#1.base|)) (.cse1 (* |ULTIMATE.start_lcp_~l~0#1| 4))) (and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_lcp_~y#1|) (= (select .cse0 (+ (* 4 |ULTIMATE.start_lcp_~x#1|) |ULTIMATE.start_lcp_~a#1.offset| .cse1)) 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 (+ |ULTIMATE.start_lcp_~a#1.offset| (* 4 |ULTIMATE.start_lcp_~y#1|) .cse1)) 0) (= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_lcp_~x#1|) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_lcp_~n#1|) (or (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_lcp_~l~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~n~0#1| (+ |ULTIMATE.start_lcp_~l~0#1| |ULTIMATE.start_main_~x~0#1|))))) [2022-11-03 01:58:54,937 INFO L895 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) [2022-11-03 01:58:54,937 INFO L899 garLoopResultBuilder]: For program point L43-1(line 43) no Hoare annotation was computed. [2022-11-03 01:58:54,937 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2022-11-03 01:58:54,937 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-11-03 01:58:54,938 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 12 14) the Hoare annotation is: true [2022-11-03 01:58:54,938 INFO L899 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2022-11-03 01:58:54,938 INFO L899 garLoopResultBuilder]: For program point L13-1(line 13) no Hoare annotation was computed. [2022-11-03 01:58:54,938 INFO L899 garLoopResultBuilder]: For program point L13-3(lines 12 14) no Hoare annotation was computed. [2022-11-03 01:58:54,938 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 12 14) no Hoare annotation was computed. [2022-11-03 01:58:54,938 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2022-11-03 01:58:54,941 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-11-03 01:58:54,944 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 01:58:54,949 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:263) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:455) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:191) 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) [2022-11-03 01:58:54,953 INFO L158 Benchmark]: Toolchain (without parser) took 51087.88ms. Allocated memory was 111.1MB in the beginning and 205.5MB in the end (delta: 94.4MB). Free memory was 76.9MB in the beginning and 107.4MB in the end (delta: -30.6MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. [2022-11-03 01:58:54,953 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 111.1MB. Free memory was 85.9MB in the beginning and 85.8MB in the end (delta: 25.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 01:58:54,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.78ms. Allocated memory is still 111.1MB. Free memory was 76.9MB in the beginning and 85.8MB in the end (delta: -8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 01:58:54,954 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.16ms. Allocated memory is still 111.1MB. Free memory was 85.4MB in the beginning and 83.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 01:58:54,954 INFO L158 Benchmark]: Boogie Preprocessor took 59.63ms. Allocated memory is still 111.1MB. Free memory was 83.7MB in the beginning and 82.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 01:58:54,954 INFO L158 Benchmark]: RCFGBuilder took 654.72ms. Allocated memory is still 111.1MB. Free memory was 82.2MB in the beginning and 66.5MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-03 01:58:54,955 INFO L158 Benchmark]: TraceAbstraction took 49926.92ms. Allocated memory was 111.1MB in the beginning and 205.5MB in the end (delta: 94.4MB). Free memory was 65.8MB in the beginning and 107.4MB in the end (delta: -41.6MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. [2022-11-03 01:58:54,956 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.42ms. Allocated memory is still 111.1MB. Free memory was 85.9MB in the beginning and 85.8MB in the end (delta: 25.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.78ms. Allocated memory is still 111.1MB. Free memory was 76.9MB in the beginning and 85.8MB in the end (delta: -8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.16ms. Allocated memory is still 111.1MB. Free memory was 85.4MB in the beginning and 83.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.63ms. Allocated memory is still 111.1MB. Free memory was 83.7MB in the beginning and 82.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 654.72ms. Allocated memory is still 111.1MB. Free memory was 82.2MB in the beginning and 66.5MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 49926.92ms. Allocated memory was 111.1MB in the beginning and 205.5MB in the end (delta: 94.4MB). Free memory was 65.8MB in the beginning and 107.4MB in the end (delta: -41.6MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.8s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 198 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 27 IncrementalHoareTripleChecker+Unchecked, 158 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 198 IncrementalHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 66 mSDtfsCounter, 198 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 43.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=3, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 19 PreInvPairs, 27 NumberOfFragments, 279 HoareAnnotationTreeSize, 19 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 249 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 119 ConstructedInterpolants, 2 QuantifiedInterpolants, 612 SizeOfPredicates, 25 NumberOfNonLiveVariables, 190 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 35/40 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:263) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-03 01:58:55,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/verifythis/lcp.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 01:58:57,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:58:57,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:58:57,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:58:57,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:58:57,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:58:57,476 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:58:57,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:58:57,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:58:57,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:58:57,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:58:57,499 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:58:57,500 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:58:57,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:58:57,504 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:58:57,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:58:57,508 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:58:57,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:58:57,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:58:57,518 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:58:57,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:58:57,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:58:57,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:58:57,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:58:57,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:58:57,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:58:57,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:58:57,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:58:57,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:58:57,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:58:57,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:58:57,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:58:57,546 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:58:57,547 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:58:57,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:58:57,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:58:57,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:58:57,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:58:57,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:58:57,552 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:58:57,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:58:57,554 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-03 01:58:57,599 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:58:57,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:58:57,601 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:58:57,601 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:58:57,602 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:58:57,602 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:58:57,603 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:58:57,603 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:58:57,603 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:58:57,603 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:58:57,605 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:58:57,605 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:58:57,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:58:57,607 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:58:57,607 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:58:57,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:58:57,607 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:58:57,608 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:58:57,608 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:58:57,608 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 01:58:57,608 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 01:58:57,609 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 01:58:57,609 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:58:57,609 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:58:57,609 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:58:57,610 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:58:57,610 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:58:57,610 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 01:58:57,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:58:57,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:58:57,611 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:58:57,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:58:57,612 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:58:57,612 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 01:58:57,612 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 01:58:57,613 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:58:57,613 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:58:57,613 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 01:58:57,614 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_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/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_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a [2022-11-03 01:58:58,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:58:58,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:58:58,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:58:58,109 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:58:58,114 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:58:58,116 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/verifythis/lcp.c [2022-11-03 01:58:58,190 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/data/912ae4e0c/1ab3797059ce431b981925be24eaf26a/FLAG0c839a965 [2022-11-03 01:58:58,814 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:58:58,817 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/sv-benchmarks/c/verifythis/lcp.c [2022-11-03 01:58:58,828 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/data/912ae4e0c/1ab3797059ce431b981925be24eaf26a/FLAG0c839a965 [2022-11-03 01:58:59,131 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/data/912ae4e0c/1ab3797059ce431b981925be24eaf26a [2022-11-03 01:58:59,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:58:59,137 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:58:59,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:58:59,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:58:59,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:58:59,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:58:59" (1/1) ... [2022-11-03 01:58:59,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7686a575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:59, skipping insertion in model container [2022-11-03 01:58:59,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:58:59" (1/1) ... [2022-11-03 01:58:59,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:58:59,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:58:59,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/sv-benchmarks/c/verifythis/lcp.c[515,528] [2022-11-03 01:58:59,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:58:59,474 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:58:59,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/sv-benchmarks/c/verifythis/lcp.c[515,528] [2022-11-03 01:58:59,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:58:59,554 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:58:59,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:59 WrapperNode [2022-11-03 01:58:59,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:58:59,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:58:59,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:58:59,556 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:58:59,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:59" (1/1) ... [2022-11-03 01:58:59,575 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:59" (1/1) ... [2022-11-03 01:58:59,616 INFO L138 Inliner]: procedures = 22, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 79 [2022-11-03 01:58:59,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:58:59,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:58:59,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:58:59,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:58:59,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:59" (1/1) ... [2022-11-03 01:58:59,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:59" (1/1) ... [2022-11-03 01:58:59,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:59" (1/1) ... [2022-11-03 01:58:59,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:59" (1/1) ... [2022-11-03 01:58:59,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:59" (1/1) ... [2022-11-03 01:58:59,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:59" (1/1) ... [2022-11-03 01:58:59,676 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:59" (1/1) ... [2022-11-03 01:58:59,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:59" (1/1) ... [2022-11-03 01:58:59,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:58:59,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:58:59,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:58:59,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:58:59,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:59" (1/1) ... [2022-11-03 01:58:59,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:58:59,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:58:59,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:58:59,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:58:59,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:58:59,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 01:58:59,782 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-03 01:58:59,782 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-03 01:58:59,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 01:58:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-03 01:58:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:58:59,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:58:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-03 01:58:59,783 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-03 01:58:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 01:58:59,882 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:58:59,885 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:59:00,187 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:59:00,211 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:59:00,211 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-03 01:59:00,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:59:00 BoogieIcfgContainer [2022-11-03 01:59:00,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:59:00,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:59:00,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:59:00,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:59:00,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:58:59" (1/3) ... [2022-11-03 01:59:00,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fee975b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:59:00, skipping insertion in model container [2022-11-03 01:59:00,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:58:59" (2/3) ... [2022-11-03 01:59:00,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fee975b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:59:00, skipping insertion in model container [2022-11-03 01:59:00,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:59:00" (3/3) ... [2022-11-03 01:59:00,224 INFO L112 eAbstractionObserver]: Analyzing ICFG lcp.c [2022-11-03 01:59:00,268 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:59:00,269 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 01:59:00,357 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:59:00,369 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@4706d7de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:59:00,369 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 01:59:00,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-03 01:59:00,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 01:59:00,385 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:59:00,385 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:59:00,386 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:59:00,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:59:00,396 INFO L85 PathProgramCache]: Analyzing trace with hash 867982546, now seen corresponding path program 1 times [2022-11-03 01:59:00,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:59:00,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239694824] [2022-11-03 01:59:00,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:59:00,415 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:59:00,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:59:00,423 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:59:00,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 01:59:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:59:00,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-03 01:59:00,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:59:00,615 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 01:59:00,616 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:59:00,616 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:59:00,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239694824] [2022-11-03 01:59:00,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239694824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:59:00,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:59:00,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:59:00,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273437032] [2022-11-03 01:59:00,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:59:00,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 01:59:00,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:59:00,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 01:59:00,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 01:59:00,668 INFO L87 Difference]: Start difference. First operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 01:59:00,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:59:00,725 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2022-11-03 01:59:00,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 01:59:00,728 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-11-03 01:59:00,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:59:00,735 INFO L225 Difference]: With dead ends: 63 [2022-11-03 01:59:00,736 INFO L226 Difference]: Without dead ends: 28 [2022-11-03 01:59:00,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 01:59:00,750 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:59:00,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:59:00,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-03 01:59:00,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-03 01:59:00,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 01:59:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-11-03 01:59:00,805 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 28 [2022-11-03 01:59:00,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:59:00,806 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-11-03 01:59:00,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 01:59:00,806 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-11-03 01:59:00,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 01:59:00,808 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:59:00,809 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:59:00,825 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-03 01:59:01,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:59:01,023 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:59:01,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:59:01,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1785702985, now seen corresponding path program 1 times [2022-11-03 01:59:01,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:59:01,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766748208] [2022-11-03 01:59:01,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:59:01,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:59:01,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:59:01,027 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:59:01,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 01:59:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:59:01,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 01:59:01,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:59:01,303 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:59:01,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:59:01,303 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:59:01,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766748208] [2022-11-03 01:59:01,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766748208] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:59:01,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:59:01,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 01:59:01,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147315233] [2022-11-03 01:59:01,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:59:01,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:59:01,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:59:01,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:59:01,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:59:01,308 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 01:59:01,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:59:01,479 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-11-03 01:59:01,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:59:01,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-11-03 01:59:01,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:59:01,482 INFO L225 Difference]: With dead ends: 45 [2022-11-03 01:59:01,482 INFO L226 Difference]: Without dead ends: 31 [2022-11-03 01:59:01,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-03 01:59:01,485 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:59:01,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:59:01,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-03 01:59:01,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-11-03 01:59:01,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 01:59:01,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-11-03 01:59:01,507 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 30 [2022-11-03 01:59:01,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:59:01,508 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-11-03 01:59:01,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 01:59:01,509 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-11-03 01:59:01,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 01:59:01,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:59:01,511 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:59:01,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-03 01:59:01,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:59:01,724 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:59:01,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:59:01,724 INFO L85 PathProgramCache]: Analyzing trace with hash -964575686, now seen corresponding path program 1 times [2022-11-03 01:59:01,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:59:01,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232219713] [2022-11-03 01:59:01,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:59:01,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:59:01,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:59:01,729 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:59:01,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 01:59:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:59:01,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 01:59:01,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:59:02,800 INFO L356 Elim1Store]: treesize reduction 70, result has 9.1 percent of original size [2022-11-03 01:59:02,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 16 [2022-11-03 01:59:02,921 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:59:02,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:59:07,571 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:59:07,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232219713] [2022-11-03 01:59:07,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232219713] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:59:07,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1399815916] [2022-11-03 01:59:07,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:59:07,572 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:59:07,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:59:07,595 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:59:07,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2022-11-03 01:59:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:59:07,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 01:59:07,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:59:07,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-03 01:59:09,981 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_1|))) is different from true [2022-11-03 01:59:10,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2022-11-03 01:59:10,321 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 01:59:10,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:59:20,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1399815916] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:59:20,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025721851] [2022-11-03 01:59:20,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:59:20,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:59:20,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:59:20,936 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:59:20,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 01:59:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:59:21,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 01:59:21,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:59:21,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-03 01:59:23,080 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_2|))) is different from true [2022-11-03 01:59:23,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2022-11-03 01:59:23,247 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 01:59:23,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:59:23,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025721851] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:59:23,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:59:23,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 7] total 21 [2022-11-03 01:59:23,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352313508] [2022-11-03 01:59:23,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:59:23,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 01:59:23,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:59:23,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 01:59:23,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=540, Unknown=9, NotChecked=94, Total=702 [2022-11-03 01:59:23,373 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 21 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 6 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-03 01:59:25,830 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (= .cse0 (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_2|))) (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (= .cse0 (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_1|))))) is different from true [2022-11-03 01:59:44,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:59:44,765 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2022-11-03 01:59:44,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 01:59:44,767 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 6 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 33 [2022-11-03 01:59:44,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:59:44,769 INFO L225 Difference]: With dead ends: 71 [2022-11-03 01:59:44,770 INFO L226 Difference]: Without dead ends: 53 [2022-11-03 01:59:44,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 40.2s TimeCoverageRelationStatistics Valid=223, Invalid=1496, Unknown=15, NotChecked=246, Total=1980 [2022-11-03 01:59:44,773 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 74 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:59:44,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 300 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 410 Invalid, 0 Unknown, 103 Unchecked, 1.1s Time] [2022-11-03 01:59:44,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-03 01:59:44,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2022-11-03 01:59:44,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 38 states have internal predecessors, (42), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 01:59:44,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-11-03 01:59:44,787 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 33 [2022-11-03 01:59:44,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:59:44,788 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-11-03 01:59:44,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 6 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-03 01:59:44,789 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-11-03 01:59:44,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 01:59:44,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:59:44,790 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:59:44,834 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-03 01:59:45,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2022-11-03 01:59:45,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-03 01:59:45,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:59:45,404 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:59:45,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:59:45,405 INFO L85 PathProgramCache]: Analyzing trace with hash -436474905, now seen corresponding path program 1 times [2022-11-03 01:59:45,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:59:45,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371567989] [2022-11-03 01:59:45,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:59:45,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:59:45,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:59:45,407 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:59:45,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-03 01:59:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:59:45,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-03 01:59:45,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:59:52,401 INFO L356 Elim1Store]: treesize reduction 84, result has 51.4 percent of original size [2022-11-03 01:59:52,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 61 treesize of output 101 [2022-11-03 01:59:52,979 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 01:59:52,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:59:57,926 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:59:57,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371567989] [2022-11-03 01:59:57,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371567989] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:59:57,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [935649682] [2022-11-03 01:59:57,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:59:57,928 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:59:57,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:59:57,935 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:59:57,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2022-11-03 01:59:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:59:58,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 01:59:58,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:59:58,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-03 02:00:00,378 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_3|))) is different from true [2022-11-03 02:00:02,741 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_3|))) is different from true [2022-11-03 02:00:02,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-11-03 02:00:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 4 not checked. [2022-11-03 02:00:03,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:00:11,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [935649682] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:00:11,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200626905] [2022-11-03 02:00:11,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:00:11,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:00:11,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:00:11,461 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:00:11,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:00:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:00:11,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 02:00:11,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:00:11,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-03 02:00:13,608 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_4|))) is different from true [2022-11-03 02:00:15,827 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_4|))) is different from true [2022-11-03 02:00:16,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-11-03 02:00:16,058 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 10 not checked. [2022-11-03 02:00:16,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:00:16,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200626905] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:00:16,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:00:16,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10, 12] total 29 [2022-11-03 02:00:16,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251169222] [2022-11-03 02:00:16,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:00:16,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 02:00:16,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:00:16,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 02:00:16,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=799, Unknown=10, NotChecked=236, Total=1122 [2022-11-03 02:00:16,099 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 29 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 7 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-11-03 02:00:18,594 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= .cse0 (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_3|))) (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= .cse0 (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_4|))))) is different from true [2022-11-03 02:00:30,378 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_3| (_ BitVec 32))) (= .cse0 (select |c_#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_3|))) (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_4| (_ BitVec 32))) (= .cse0 (select |c_#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_4|))))) is different from true [2022-11-03 02:00:35,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:00:35,477 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2022-11-03 02:00:35,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-03 02:00:35,478 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 7 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 36 [2022-11-03 02:00:35,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:00:35,481 INFO L225 Difference]: With dead ends: 68 [2022-11-03 02:00:35,481 INFO L226 Difference]: Without dead ends: 66 [2022-11-03 02:00:35,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 87 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 45.9s TimeCoverageRelationStatistics Valid=199, Invalid=2068, Unknown=13, NotChecked=582, Total=2862 [2022-11-03 02:00:35,484 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 24 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 373 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:00:35,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 379 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 195 Invalid, 0 Unknown, 373 Unchecked, 0.6s Time] [2022-11-03 02:00:35,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-03 02:00:35,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2022-11-03 02:00:35,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 02:00:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-11-03 02:00:35,499 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 36 [2022-11-03 02:00:35,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:00:35,499 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-11-03 02:00:35,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 7 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-11-03 02:00:35,500 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-11-03 02:00:35,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:00:35,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:00:35,501 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:00:35,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:00:35,709 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:00:35,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:00:36,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:00:36,108 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:00:36,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:00:36,109 INFO L85 PathProgramCache]: Analyzing trace with hash -2024822807, now seen corresponding path program 2 times [2022-11-03 02:00:36,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:00:36,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374380827] [2022-11-03 02:00:36,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:00:36,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:00:36,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:00:36,111 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:00:36,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-03 02:00:36,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:00:36,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:00:36,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:00:36,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:00:36,206 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:00:36,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:00:36,207 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:00:36,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374380827] [2022-11-03 02:00:36,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374380827] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:00:36,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:00:36,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:00:36,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932354852] [2022-11-03 02:00:36,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:00:36,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:00:36,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:00:36,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:00:36,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:00:36,210 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 02:00:36,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:00:36,247 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2022-11-03 02:00:36,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:00:36,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-11-03 02:00:36,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:00:36,254 INFO L225 Difference]: With dead ends: 93 [2022-11-03 02:00:36,255 INFO L226 Difference]: Without dead ends: 55 [2022-11-03 02:00:36,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:00:36,259 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:00:36,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:00:36,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-03 02:00:36,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-03 02:00:36,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 44 states have internal predecessors, (46), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 02:00:36,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-11-03 02:00:36,284 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 36 [2022-11-03 02:00:36,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:00:36,287 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-11-03 02:00:36,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 02:00:36,287 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-11-03 02:00:36,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-03 02:00:36,292 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:00:36,293 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:00:36,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-11-03 02:00:36,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:00:36,506 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:00:36,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:00:36,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1337034520, now seen corresponding path program 3 times [2022-11-03 02:00:36,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:00:36,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868511718] [2022-11-03 02:00:36,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:00:36,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:00:36,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:00:36,509 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:00:36,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-03 02:00:36,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:00:36,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:00:36,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 02:00:36,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:00:36,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-03 02:00:38,672 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5|))) is different from true [2022-11-03 02:00:40,764 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5|))) is different from true [2022-11-03 02:00:40,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-11-03 02:00:40,870 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 4 not checked. [2022-11-03 02:00:40,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:00:43,037 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:00:43,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868511718] [2022-11-03 02:00:43,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868511718] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:00:43,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [911153957] [2022-11-03 02:00:43,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:00:43,037 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:00:43,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:00:43,039 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:00:43,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-11-03 02:00:43,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:00:43,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:00:43,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 02:00:43,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:00:43,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-03 02:00:45,233 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6|))) is different from true [2022-11-03 02:00:47,302 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6|))) is different from true [2022-11-03 02:00:47,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-11-03 02:00:47,355 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 4 not checked. [2022-11-03 02:00:47,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:00:47,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [911153957] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:00:47,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296091753] [2022-11-03 02:00:47,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:00:47,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:00:47,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:00:47,395 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:00:47,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 02:00:47,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:00:47,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:00:47,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 02:00:47,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:00:47,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-03 02:00:49,557 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7|))) is different from true [2022-11-03 02:00:51,629 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7|))) is different from true [2022-11-03 02:00:51,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-11-03 02:00:51,682 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 10 not checked. [2022-11-03 02:00:51,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:00:51,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296091753] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:00:51,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:00:51,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 16 [2022-11-03 02:00:51,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783108490] [2022-11-03 02:00:51,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:00:51,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 02:00:51,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:00:51,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 02:00:51,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=158, Unknown=7, NotChecked=174, Total=380 [2022-11-03 02:00:51,715 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 4 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-03 02:00:53,829 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= .cse0 (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6|))) (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= .cse0 (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7|))) (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= .cse0 (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5|))))) is different from true [2022-11-03 02:01:02,542 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= .cse0 (select |c_#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5|))) (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= .cse0 (select |c_#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7|))) (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= .cse0 (select |c_#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6|))))) is different from true [2022-11-03 02:01:04,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:04,724 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-11-03 02:01:04,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:01:04,725 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 4 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 39 [2022-11-03 02:01:04,725 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2022-11-03 02:01:04,725 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 4 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 39 [2022-11-03 02:01:04,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:04,726 FATAL L583 BasicCegarLoop]: -- [2022-11-03 02:01:04,726 FATAL L584 BasicCegarLoop]: enhanced interpolant automaton broken: counterexample not accepted [2022-11-03 02:01:04,726 FATAL L585 BasicCegarLoop]: word: [2022-11-03 02:01:04,729 FATAL L587 BasicCegarLoop]: assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(6bv32, 2bv32);call write~init~intINTTYPE1(108bv8, 2bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(99bv8, 2bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(112bv8, 2bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(46bv8, 2bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(99bv8, 2bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 2bv32, 5bv32, 1bv32);call #Ultimate.allocInit(12bv32, 3bv32); [2022-11-03 02:01:04,730 FATAL L587 BasicCegarLoop]: assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~ret18#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~x~0#1, main_~y~0#1, main_~l~1#1;main_~n~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; [2022-11-03 02:01:04,730 FATAL L587 BasicCegarLoop]: call assume_abort_if_not((if ~bvsge32(main_~n~0#1, 0bv32) && ~bvslt32(main_~n~0#1, 1073741824bv32) then 1bv32 else 0bv32)); [2022-11-03 02:01:04,730 FATAL L587 BasicCegarLoop]: ~cond := #in~cond; [2022-11-03 02:01:04,730 FATAL L587 BasicCegarLoop]: assume !(0bv32 == ~cond); [2022-11-03 02:01:04,730 FATAL L587 BasicCegarLoop]: assume true; [2022-11-03 02:01:04,730 FATAL L587 BasicCegarLoop]: #66#return; [2022-11-03 02:01:04,730 FATAL L587 BasicCegarLoop]: call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(~bvmul32(4bv32, main_~n~0#1));assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4bv32, ~bvmul32(4bv32, main_~n~0#1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); [2022-11-03 02:01:04,731 FATAL L587 BasicCegarLoop]: assume { :end_inline_#Ultimate.meminit } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~x~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;main_~y~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; [2022-11-03 02:01:04,731 FATAL L587 BasicCegarLoop]: call assume_abort_if_not((if ~bvsge32(main_~x~0#1, 0bv32) && ~bvsge32(main_~y~0#1, 0bv32) then 1bv32 else 0bv32)); [2022-11-03 02:01:04,731 FATAL L587 BasicCegarLoop]: ~cond := #in~cond; [2022-11-03 02:01:04,731 FATAL L587 BasicCegarLoop]: assume !(0bv32 == ~cond); [2022-11-03 02:01:04,731 FATAL L587 BasicCegarLoop]: assume true; [2022-11-03 02:01:04,731 FATAL L587 BasicCegarLoop]: #68#return; [2022-11-03 02:01:04,731 FATAL L587 BasicCegarLoop]: assume { :begin_inline_lcp } true;lcp_#in~a#1.base, lcp_#in~a#1.offset, lcp_#in~n#1, lcp_#in~x#1, lcp_#in~y#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~x~0#1, main_~y~0#1;havoc lcp_#res#1;havoc lcp_#t~post8#1, lcp_#t~mem5#1, lcp_#t~mem6#1, lcp_#t~short7#1, lcp_~a#1.base, lcp_~a#1.offset, lcp_~n#1, lcp_~x#1, lcp_~y#1, lcp_~l~0#1;lcp_~a#1.base, lcp_~a#1.offset := lcp_#in~a#1.base, lcp_#in~a#1.offset;lcp_~n#1 := lcp_#in~n#1;lcp_~x#1 := lcp_#in~x#1;lcp_~y#1 := lcp_#in~y#1;lcp_~l~0#1 := 0bv32; [2022-11-03 02:01:04,731 FATAL L587 BasicCegarLoop]: lcp_#t~short7#1 := ~bvslt32(~bvadd32(lcp_~x#1, lcp_~l~0#1), lcp_~n#1) && ~bvslt32(~bvadd32(lcp_~y#1, lcp_~l~0#1), lcp_~n#1); [2022-11-03 02:01:04,731 FATAL L587 BasicCegarLoop]: assume lcp_#t~short7#1;call lcp_#t~mem5#1 := read~intINTTYPE4(lcp_~a#1.base, ~bvadd32(lcp_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(lcp_~x#1, lcp_~l~0#1))), 4bv32);call lcp_#t~mem6#1 := read~intINTTYPE4(lcp_~a#1.base, ~bvadd32(lcp_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(lcp_~y#1, lcp_~l~0#1))), 4bv32);lcp_#t~short7#1 := lcp_#t~mem5#1 == lcp_#t~mem6#1; [2022-11-03 02:01:04,732 FATAL L587 BasicCegarLoop]: assume !!lcp_#t~short7#1;havoc lcp_#t~mem5#1;havoc lcp_#t~mem6#1;havoc lcp_#t~short7#1;lcp_#t~post8#1 := lcp_~l~0#1;lcp_~l~0#1 := ~bvadd32(1bv32, lcp_#t~post8#1);havoc lcp_#t~post8#1; [2022-11-03 02:01:04,732 FATAL L587 BasicCegarLoop]: lcp_#t~short7#1 := ~bvslt32(~bvadd32(lcp_~x#1, lcp_~l~0#1), lcp_~n#1) && ~bvslt32(~bvadd32(lcp_~y#1, lcp_~l~0#1), lcp_~n#1); [2022-11-03 02:01:04,732 FATAL L587 BasicCegarLoop]: assume lcp_#t~short7#1;call lcp_#t~mem5#1 := read~intINTTYPE4(lcp_~a#1.base, ~bvadd32(lcp_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(lcp_~x#1, lcp_~l~0#1))), 4bv32);call lcp_#t~mem6#1 := read~intINTTYPE4(lcp_~a#1.base, ~bvadd32(lcp_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(lcp_~y#1, lcp_~l~0#1))), 4bv32);lcp_#t~short7#1 := lcp_#t~mem5#1 == lcp_#t~mem6#1; [2022-11-03 02:01:04,732 FATAL L587 BasicCegarLoop]: assume !!lcp_#t~short7#1;havoc lcp_#t~mem5#1;havoc lcp_#t~mem6#1;havoc lcp_#t~short7#1;lcp_#t~post8#1 := lcp_~l~0#1;lcp_~l~0#1 := ~bvadd32(1bv32, lcp_#t~post8#1);havoc lcp_#t~post8#1; [2022-11-03 02:01:04,732 FATAL L587 BasicCegarLoop]: lcp_#t~short7#1 := ~bvslt32(~bvadd32(lcp_~x#1, lcp_~l~0#1), lcp_~n#1) && ~bvslt32(~bvadd32(lcp_~y#1, lcp_~l~0#1), lcp_~n#1); [2022-11-03 02:01:04,732 FATAL L587 BasicCegarLoop]: assume lcp_#t~short7#1;call lcp_#t~mem5#1 := read~intINTTYPE4(lcp_~a#1.base, ~bvadd32(lcp_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(lcp_~x#1, lcp_~l~0#1))), 4bv32);call lcp_#t~mem6#1 := read~intINTTYPE4(lcp_~a#1.base, ~bvadd32(lcp_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(lcp_~y#1, lcp_~l~0#1))), 4bv32);lcp_#t~short7#1 := lcp_#t~mem5#1 == lcp_#t~mem6#1; [2022-11-03 02:01:04,732 FATAL L587 BasicCegarLoop]: assume !!lcp_#t~short7#1;havoc lcp_#t~mem5#1;havoc lcp_#t~mem6#1;havoc lcp_#t~short7#1;lcp_#t~post8#1 := lcp_~l~0#1;lcp_~l~0#1 := ~bvadd32(1bv32, lcp_#t~post8#1);havoc lcp_#t~post8#1; [2022-11-03 02:01:04,732 FATAL L587 BasicCegarLoop]: lcp_#t~short7#1 := ~bvslt32(~bvadd32(lcp_~x#1, lcp_~l~0#1), lcp_~n#1) && ~bvslt32(~bvadd32(lcp_~y#1, lcp_~l~0#1), lcp_~n#1); [2022-11-03 02:01:04,732 FATAL L587 BasicCegarLoop]: assume !lcp_#t~short7#1; [2022-11-03 02:01:04,733 FATAL L587 BasicCegarLoop]: assume !lcp_#t~short7#1;havoc lcp_#t~mem5#1;havoc lcp_#t~mem6#1;havoc lcp_#t~short7#1; [2022-11-03 02:01:04,733 FATAL L587 BasicCegarLoop]: lcp_#res#1 := lcp_~l~0#1; [2022-11-03 02:01:04,733 FATAL L587 BasicCegarLoop]: main_#t~ret18#1 := lcp_#res#1;assume { :end_inline_lcp } true;main_~l~1#1 := main_#t~ret18#1;havoc main_#t~ret18#1;assume { :begin_inline_check } true;check_#in~a#1.base, check_#in~a#1.offset, check_#in~n#1, check_#in~x#1, check_#in~y#1, check_#in~l#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~l~1#1;havoc check_#t~nondet9#1, check_#t~mem10#1, check_#t~mem11#1, check_#t~mem12#1, check_#t~mem13#1, check_~a#1.base, check_~a#1.offset, check_~n#1, check_~x#1, check_~y#1, check_~l#1, check_~i~0#1;check_~a#1.base, check_~a#1.offset := check_#in~a#1.base, check_#in~a#1.offset;check_~n#1 := check_#in~n#1;check_~x#1 := check_#in~x#1;check_~y#1 := check_#in~y#1;check_~l#1 := check_#in~l#1;check_~i~0#1 := check_#t~nondet9#1;havoc check_#t~nondet9#1; [2022-11-03 02:01:04,733 FATAL L587 BasicCegarLoop]: call assume_abort_if_not((if ~bvsle32(0bv32, check_~i~0#1) && ~bvslt32(check_~i~0#1, check_~l#1) then 1bv32 else 0bv32)); [2022-11-03 02:01:04,733 FATAL L587 BasicCegarLoop]: ~cond := #in~cond; [2022-11-03 02:01:04,733 FATAL L587 BasicCegarLoop]: assume !(0bv32 == ~cond); [2022-11-03 02:01:04,733 FATAL L587 BasicCegarLoop]: assume true; [2022-11-03 02:01:04,733 FATAL L587 BasicCegarLoop]: #70#return; [2022-11-03 02:01:04,734 FATAL L587 BasicCegarLoop]: call check_#t~mem10#1 := read~intINTTYPE4(check_~a#1.base, ~bvadd32(check_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(check_~x#1, check_~i~0#1))), 4bv32);call check_#t~mem11#1 := read~intINTTYPE4(check_~a#1.base, ~bvadd32(check_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(check_~y#1, check_~i~0#1))), 4bv32); [2022-11-03 02:01:04,734 FATAL L587 BasicCegarLoop]: call __VERIFIER_assert((if check_#t~mem10#1 == check_#t~mem11#1 then 1bv32 else 0bv32)); [2022-11-03 02:01:04,734 FATAL L587 BasicCegarLoop]: ~cond := #in~cond; [2022-11-03 02:01:04,734 FATAL L587 BasicCegarLoop]: assume 0bv32 == ~cond; [2022-11-03 02:01:04,734 FATAL L587 BasicCegarLoop]: assume !false; [2022-11-03 02:01:04,734 FATAL L589 BasicCegarLoop]: original automaton: [2022-11-03 02:01:04,753 FATAL L590 BasicCegarLoop]: NestedWordAutomaton nwa = ( callAlphabet = {"call assume_abort_if_not((if ~bvsge32(main_~n~0#1, 0bv32) && ~bvslt32(main_~n~0#1, 1073741824bv32) then 1bv32 else 0bv32));" "call assume_abort_if_not((if ~bvsge32(main_~x~0#1, 0bv32) && ~bvsge32(main_~y~0#1, 0bv32) then 1bv32 else 0bv32));" "call assume_abort_if_not((if ~bvsle32(0bv32, check_~i~0#1) && ~bvslt32(check_~i~0#1, check_~l#1) then 1bv32 else 0bv32));" "call __VERIFIER_assert((if check_#t~mem10#1 == check_#t~mem11#1 then 1bv32 else 0bv32));" "call __VERIFIER_assert((if check_#t~mem12#1 != check_#t~mem13#1 then 1bv32 else 0bv32));" }, internalAlphabet = {"assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(6bv32, 2bv32);call write~init~intINTTYPE1(108bv8, 2bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(99bv8, 2bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(112bv8, 2bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(46bv8, 2bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(99bv8, 2bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 2bv32, 5bv32, 1bv32);call #Ultimate.allocInit(12bv32, 3bv32);" "assume true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~ret18#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~x~0#1, main_~y~0#1, main_~l~1#1;main_~n~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "SUMMARY for call assume_abort_if_not((if ~bvsge32(main_~n~0#1, 0bv32) && ~bvslt32(main_~n~0#1, 1073741824bv32) then 1bv32 else 0bv32)); srcloc: L38" "call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(~bvmul32(4bv32, main_~n~0#1));assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4bv32, ~bvmul32(4bv32, main_~n~0#1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base);" "assume { :end_inline_#Ultimate.meminit } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~x~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;main_~y~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;" "SUMMARY for call assume_abort_if_not((if ~bvsge32(main_~x~0#1, 0bv32) && ~bvsge32(main_~y~0#1, 0bv32) then 1bv32 else 0bv32)); srcloc: L43" "assume { :begin_inline_lcp } true;lcp_#in~a#1.base, lcp_#in~a#1.offset, lcp_#in~n#1, lcp_#in~x#1, lcp_#in~y#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~x~0#1, main_~y~0#1;havoc lcp_#res#1;havoc lcp_#t~post8#1, lcp_#t~mem5#1, lcp_#t~mem6#1, lcp_#t~short7#1, lcp_~a#1.base, lcp_~a#1.offset, lcp_~n#1, lcp_~x#1, lcp_~y#1, lcp_~l~0#1;lcp_~a#1.base, lcp_~a#1.offset := lcp_#in~a#1.base, lcp_#in~a#1.offset;lcp_~n#1 := lcp_#in~n#1;lcp_~x#1 := lcp_#in~x#1;lcp_~y#1 := lcp_#in~y#1;lcp_~l~0#1 := 0bv32;" "lcp_#t~short7#1 := ~bvslt32(~bvadd32(lcp_~x#1, lcp_~l~0#1), lcp_~n#1) && ~bvslt32(~bvadd32(lcp_~y#1, lcp_~l~0#1), lcp_~n#1);" "assume lcp_#t~short7#1;call lcp_#t~mem5#1 := read~intINTTYPE4(lcp_~a#1.base, ~bvadd32(lcp_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(lcp_~x#1, lcp_~l~0#1))), 4bv32);call lcp_#t~mem6#1 := read~intINTTYPE4(lcp_~a#1.base, ~bvadd32(lcp_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(lcp_~y#1, lcp_~l~0#1))), 4bv32);lcp_#t~short7#1 := lcp_#t~mem5#1 == lcp_#t~mem6#1;" "assume !lcp_#t~short7#1;" "assume !lcp_#t~short7#1;havoc lcp_#t~mem5#1;havoc lcp_#t~mem6#1;havoc lcp_#t~short7#1;" "assume !!lcp_#t~short7#1;havoc lcp_#t~mem5#1;havoc lcp_#t~mem6#1;havoc lcp_#t~short7#1;lcp_#t~post8#1 := lcp_~l~0#1;lcp_~l~0#1 := ~bvadd32(1bv32, lcp_#t~post8#1);havoc lcp_#t~post8#1;" "assume !true;" "lcp_#res#1 := lcp_~l~0#1;" "main_#t~ret18#1 := lcp_#res#1;assume { :end_inline_lcp } true;main_~l~1#1 := main_#t~ret18#1;havoc main_#t~ret18#1;assume { :begin_inline_check } true;check_#in~a#1.base, check_#in~a#1.offset, check_#in~n#1, check_#in~x#1, check_#in~y#1, check_#in~l#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~l~1#1;havoc check_#t~nondet9#1, check_#t~mem10#1, check_#t~mem11#1, check_#t~mem12#1, check_#t~mem13#1, check_~a#1.base, check_~a#1.offset, check_~n#1, check_~x#1, check_~y#1, check_~l#1, check_~i~0#1;check_~a#1.base, check_~a#1.offset := check_#in~a#1.base, check_#in~a#1.offset;check_~n#1 := check_#in~n#1;check_~x#1 := check_#in~x#1;check_~y#1 := check_#in~y#1;check_~l#1 := check_#in~l#1;check_~i~0#1 := check_#t~nondet9#1;havoc check_#t~nondet9#1;" "SUMMARY for call assume_abort_if_not((if ~bvsle32(0bv32, check_~i~0#1) && ~bvslt32(check_~i~0#1, check_~l#1) then 1bv32 else 0bv32)); srcloc: L27" "call check_#t~mem10#1 := read~intINTTYPE4(check_~a#1.base, ~bvadd32(check_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(check_~x#1, check_~i~0#1))), 4bv32);call check_#t~mem11#1 := read~intINTTYPE4(check_~a#1.base, ~bvadd32(check_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(check_~y#1, check_~i~0#1))), 4bv32);" "SUMMARY for call __VERIFIER_assert((if check_#t~mem10#1 == check_#t~mem11#1 then 1bv32 else 0bv32)); srcloc: L28" "havoc check_#t~mem10#1;havoc check_#t~mem11#1;" "assume ~bvslt32(~bvadd32(check_~x#1, check_~l#1), check_~n#1) && ~bvslt32(~bvadd32(check_~y#1, check_~l#1), check_~n#1);call check_#t~mem12#1 := read~intINTTYPE4(check_~a#1.base, ~bvadd32(check_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(check_~x#1, check_~l#1))), 4bv32);call check_#t~mem13#1 := read~intINTTYPE4(check_~a#1.base, ~bvadd32(check_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(check_~y#1, check_~l#1))), 4bv32);" "SUMMARY for call __VERIFIER_assert((if check_#t~mem12#1 != check_#t~mem13#1 then 1bv32 else 0bv32)); srcloc: L32" "havoc check_#t~mem12#1;havoc check_#t~mem13#1;" "assume !(~bvslt32(~bvadd32(check_~x#1, check_~l#1), check_~n#1) && ~bvslt32(~bvadd32(check_~y#1, check_~l#1), check_~n#1));" "assume { :end_inline_check } true;call ULTIMATE.dealloc(main_~a~0#1.base, main_~a~0#1.offset);main_#res#1 := 0bv32;" "#t~ret19#1 := main_#res#1;assume { :end_inline_main } true;" "assume true;" "~cond := #in~cond;" "assume 0bv32 == ~cond;assume false;" "assume !(0bv32 == ~cond);" "assume true;" "~cond := #in~cond;" "assume 0bv32 == ~cond;" "assume !false;" "assume false;assume false;" "assume !(0bv32 == ~cond);" }, returnAlphabet = {"#66#return;" "#68#return;" "#70#return;" "#72#return;" "#74#return;" }, states = {"2311#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7|)))" "2236#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6|)))" "2095#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5|)))" "2111#(exists ((|ULTIMATE.start_check_~i~0#1| (_ BitVec 32)) (|ULTIMATE.start_check_~x#1| (_ BitVec 32)) (|ULTIMATE.start_check_~a#1.offset| (_ BitVec 32)) (|ULTIMATE.start_check_~y#1| (_ BitVec 32))) (and (= (select ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (bvadd |ULTIMATE.start_check_~a#1.offset| (bvmul |ULTIMATE.start_check_~i~0#1| (_ bv4 32)) (bvmul (_ bv4 32) |ULTIMATE.start_check_~x#1|))) |ULTIMATE.start_check_#t~mem10#1|) (= (select ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (bvadd |ULTIMATE.start_check_~a#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_check_~y#1|) (bvmul |ULTIMATE.start_check_~i~0#1| (_ bv4 32)))) |ULTIMATE.start_check_#t~mem11#1|)))" "2175#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6|)))" "2291#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)" "2372#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7|)))" "2025#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|))" "2119#(= __VERIFIER_assert_~cond (_ bv1 32))" "2000#false" "2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))" "2091#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_check_~a#1.base|))" "2033#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5|)))" "1999#true" "2115#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)" "2295#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))" }, initialStates = {"1999#true" }, finalStates = {"2000#false" }, callTransitions = { ("2111#(exists ((|ULTIMATE.start_check_~i~0#1| (_ BitVec 32)) (|ULTIMATE.start_check_~x#1| (_ BitVec 32)) (|ULTIMATE.start_check_~a#1.offset| (_ BitVec 32)) (|ULTIMATE.start_check_~y#1| (_ BitVec 32))) (and (= (select ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (bvadd |ULTIMATE.start_check_~a#1.offset| (bvmul |ULTIMATE.start_check_~i~0#1| (_ bv4 32)) (bvmul (_ bv4 32) |ULTIMATE.start_check_~x#1|))) |ULTIMATE.start_check_#t~mem10#1|) (= (select ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (bvadd |ULTIMATE.start_check_~a#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_check_~y#1|) (bvmul |ULTIMATE.start_check_~i~0#1| (_ bv4 32)))) |ULTIMATE.start_check_#t~mem11#1|)))" "call __VERIFIER_assert((if check_#t~mem10#1 == check_#t~mem11#1 then 1bv32 else 0bv32));" "2115#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)") ("2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))" "call assume_abort_if_not((if ~bvsge32(main_~x~0#1, 0bv32) && ~bvsge32(main_~y~0#1, 0bv32) then 1bv32 else 0bv32));" "2311#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7|)))") ("2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))" "call assume_abort_if_not((if ~bvsge32(main_~x~0#1, 0bv32) && ~bvsge32(main_~y~0#1, 0bv32) then 1bv32 else 0bv32));" "2033#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5|)))") ("2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))" "call assume_abort_if_not((if ~bvsge32(main_~x~0#1, 0bv32) && ~bvsge32(main_~y~0#1, 0bv32) then 1bv32 else 0bv32));" "2175#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6|)))") ("2091#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_check_~a#1.base|))" "call assume_abort_if_not((if ~bvsle32(0bv32, check_~i~0#1) && ~bvslt32(check_~i~0#1, check_~l#1) then 1bv32 else 0bv32));" "2372#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7|)))") ("2091#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_check_~a#1.base|))" "call assume_abort_if_not((if ~bvsle32(0bv32, check_~i~0#1) && ~bvslt32(check_~i~0#1, check_~l#1) then 1bv32 else 0bv32));" "2236#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6|)))") ("2091#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_check_~a#1.base|))" "call assume_abort_if_not((if ~bvsle32(0bv32, check_~i~0#1) && ~bvslt32(check_~i~0#1, check_~l#1) then 1bv32 else 0bv32));" "2095#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5|)))") ("1999#true" "call assume_abort_if_not((if ~bvsge32(main_~n~0#1, 0bv32) && ~bvslt32(main_~n~0#1, 1073741824bv32) then 1bv32 else 0bv32));" "1999#true") }, internalTransitions = { ("2311#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7|)))" "assume !(0bv32 == ~cond);" "2311#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7|)))") ("2311#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7|)))" "assume true;" "2311#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7|)))") ("2311#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7|)))" "~cond := #in~cond;" "2311#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7|)))") ("2236#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6|)))" "assume !(0bv32 == ~cond);" "2236#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6|)))") ("2236#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6|)))" "assume true;" "2236#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6|)))") ("2236#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6|)))" "~cond := #in~cond;" "2236#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6|)))") ("2095#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5|)))" "assume !(0bv32 == ~cond);" "2095#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5|)))") ("2095#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5|)))" "assume true;" "2095#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5|)))") ("2095#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5|)))" "~cond := #in~cond;" "2095#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5|)))") ("2175#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6|)))" "assume !(0bv32 == ~cond);" "2175#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6|)))") ("2175#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6|)))" "assume true;" "2175#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6|)))") ("2175#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6|)))" "~cond := #in~cond;" "2175#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6|)))") ("2291#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)" "assume !(0bv32 == ~cond);" "2295#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))") ("2372#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7|)))" "assume !(0bv32 == ~cond);" "2372#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7|)))") ("2372#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7|)))" "assume true;" "2372#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7|)))") ("2372#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7|)))" "~cond := #in~cond;" "2372#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7|)))") ("2025#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|))" "assume { :end_inline_#Ultimate.meminit } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~x~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;main_~y~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;" "2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))") ("2119#(= __VERIFIER_assert_~cond (_ bv1 32))" "assume 0bv32 == ~cond;" "2000#false") ("2000#false" "assume !false;" "2000#false") ("2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))" "assume lcp_#t~short7#1;call lcp_#t~mem5#1 := read~intINTTYPE4(lcp_~a#1.base, ~bvadd32(lcp_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(lcp_~x#1, lcp_~l~0#1))), 4bv32);call lcp_#t~mem6#1 := read~intINTTYPE4(lcp_~a#1.base, ~bvadd32(lcp_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(lcp_~y#1, lcp_~l~0#1))), 4bv32);lcp_#t~short7#1 := lcp_#t~mem5#1 == lcp_#t~mem6#1;" "2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))") ("2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))" "assume !lcp_#t~short7#1;" "2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))") ("2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))" "assume !lcp_#t~short7#1;havoc lcp_#t~mem5#1;havoc lcp_#t~mem6#1;havoc lcp_#t~short7#1;" "2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))") ("2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))" "assume { :begin_inline_lcp } true;lcp_#in~a#1.base, lcp_#in~a#1.offset, lcp_#in~n#1, lcp_#in~x#1, lcp_#in~y#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~x~0#1, main_~y~0#1;havoc lcp_#res#1;havoc lcp_#t~post8#1, lcp_#t~mem5#1, lcp_#t~mem6#1, lcp_#t~short7#1, lcp_~a#1.base, lcp_~a#1.offset, lcp_~n#1, lcp_~x#1, lcp_~y#1, lcp_~l~0#1;lcp_~a#1.base, lcp_~a#1.offset := lcp_#in~a#1.base, lcp_#in~a#1.offset;lcp_~n#1 := lcp_#in~n#1;lcp_~x#1 := lcp_#in~x#1;lcp_~y#1 := lcp_#in~y#1;lcp_~l~0#1 := 0bv32;" "2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))") ("2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))" "assume !!lcp_#t~short7#1;havoc lcp_#t~mem5#1;havoc lcp_#t~mem6#1;havoc lcp_#t~short7#1;lcp_#t~post8#1 := lcp_~l~0#1;lcp_~l~0#1 := ~bvadd32(1bv32, lcp_#t~post8#1);havoc lcp_#t~post8#1;" "2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))") ("2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))" "lcp_#res#1 := lcp_~l~0#1;" "2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))") ("2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))" "lcp_#t~short7#1 := ~bvslt32(~bvadd32(lcp_~x#1, lcp_~l~0#1), lcp_~n#1) && ~bvslt32(~bvadd32(lcp_~y#1, lcp_~l~0#1), lcp_~n#1);" "2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))") ("2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))" "main_#t~ret18#1 := lcp_#res#1;assume { :end_inline_lcp } true;main_~l~1#1 := main_#t~ret18#1;havoc main_#t~ret18#1;assume { :begin_inline_check } true;check_#in~a#1.base, check_#in~a#1.offset, check_#in~n#1, check_#in~x#1, check_#in~y#1, check_#in~l#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~l~1#1;havoc check_#t~nondet9#1, check_#t~mem10#1, check_#t~mem11#1, check_#t~mem12#1, check_#t~mem13#1, check_~a#1.base, check_~a#1.offset, check_~n#1, check_~x#1, check_~y#1, check_~l#1, check_~i~0#1;check_~a#1.base, check_~a#1.offset := check_#in~a#1.base, check_#in~a#1.offset;check_~n#1 := check_#in~n#1;check_~x#1 := check_#in~x#1;check_~y#1 := check_#in~y#1;check_~l#1 := check_#in~l#1;check_~i~0#1 := check_#t~nondet9#1;havoc check_#t~nondet9#1;" "2091#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_check_~a#1.base|))") ("2091#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_check_~a#1.base|))" "call check_#t~mem10#1 := read~intINTTYPE4(check_~a#1.base, ~bvadd32(check_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(check_~x#1, check_~i~0#1))), 4bv32);call check_#t~mem11#1 := read~intINTTYPE4(check_~a#1.base, ~bvadd32(check_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(check_~y#1, check_~i~0#1))), 4bv32);" "2111#(exists ((|ULTIMATE.start_check_~i~0#1| (_ BitVec 32)) (|ULTIMATE.start_check_~x#1| (_ BitVec 32)) (|ULTIMATE.start_check_~a#1.offset| (_ BitVec 32)) (|ULTIMATE.start_check_~y#1| (_ BitVec 32))) (and (= (select ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (bvadd |ULTIMATE.start_check_~a#1.offset| (bvmul |ULTIMATE.start_check_~i~0#1| (_ bv4 32)) (bvmul (_ bv4 32) |ULTIMATE.start_check_~x#1|))) |ULTIMATE.start_check_#t~mem10#1|) (= (select ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (bvadd |ULTIMATE.start_check_~a#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_check_~y#1|) (bvmul |ULTIMATE.start_check_~i~0#1| (_ bv4 32)))) |ULTIMATE.start_check_#t~mem11#1|)))") ("2033#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5|)))" "assume !(0bv32 == ~cond);" "2033#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5|)))") ("2033#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5|)))" "assume true;" "2033#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5|)))") ("2033#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5|)))" "~cond := #in~cond;" "2033#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5|)))") ("1999#true" "assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(6bv32, 2bv32);call write~init~intINTTYPE1(108bv8, 2bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(99bv8, 2bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(112bv8, 2bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(46bv8, 2bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(99bv8, 2bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 2bv32, 5bv32, 1bv32);call #Ultimate.allocInit(12bv32, 3bv32);" "1999#true") ("1999#true" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~ret18#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~x~0#1, main_~y~0#1, main_~l~1#1;main_~n~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "1999#true") ("1999#true" "assume !(0bv32 == ~cond);" "1999#true") ("1999#true" "call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(~bvmul32(4bv32, main_~n~0#1));assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4bv32, ~bvmul32(4bv32, main_~n~0#1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base);" "2025#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|))") ("1999#true" "assume true;" "1999#true") ("1999#true" "~cond := #in~cond;" "2291#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)") ("1999#true" "~cond := #in~cond;" "1999#true") ("2115#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)" "~cond := #in~cond;" "2119#(= __VERIFIER_assert_~cond (_ bv1 32))") ("2295#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))" "assume true;" "2295#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))") }, returnTransitions = { ("2311#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7|)))" "2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))" "#68#return;" "2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))") ("2236#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6|)))" "2091#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_check_~a#1.base|))" "#70#return;" "2091#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_check_~a#1.base|))") ("2095#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5|)))" "2091#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_check_~a#1.base|))" "#70#return;" "2091#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_check_~a#1.base|))") ("2175#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6|)))" "2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))" "#68#return;" "2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))") ("2372#(exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7|)))" "2091#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_check_~a#1.base|))" "#70#return;" "2091#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_check_~a#1.base|))") ("2033#(exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5|)))" "2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))" "#68#return;" "2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))") ("1999#true" "1999#true" "#66#return;" "1999#true") ("2295#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))" "1999#true" "#66#return;" "1999#true") } ); [2022-11-03 02:01:04,754 FATAL L591 BasicCegarLoop]: enhanced automaton: [2022-11-03 02:01:04,757 FATAL L592 BasicCegarLoop]: NestedWordAutomaton nwa = ( callAlphabet = {"call assume_abort_if_not((if ~bvsge32(main_~n~0#1, 0bv32) && ~bvslt32(main_~n~0#1, 1073741824bv32) then 1bv32 else 0bv32));" "call assume_abort_if_not((if ~bvsge32(main_~x~0#1, 0bv32) && ~bvsge32(main_~y~0#1, 0bv32) then 1bv32 else 0bv32));" "call assume_abort_if_not((if ~bvsle32(0bv32, check_~i~0#1) && ~bvslt32(check_~i~0#1, check_~l#1) then 1bv32 else 0bv32));" "call __VERIFIER_assert((if check_#t~mem10#1 == check_#t~mem11#1 then 1bv32 else 0bv32));" "call __VERIFIER_assert((if check_#t~mem12#1 != check_#t~mem13#1 then 1bv32 else 0bv32));" }, internalAlphabet = {"assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(6bv32, 2bv32);call write~init~intINTTYPE1(108bv8, 2bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(99bv8, 2bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(112bv8, 2bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(46bv8, 2bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(99bv8, 2bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 2bv32, 5bv32, 1bv32);call #Ultimate.allocInit(12bv32, 3bv32);" "assume true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~ret18#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~x~0#1, main_~y~0#1, main_~l~1#1;main_~n~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "SUMMARY for call assume_abort_if_not((if ~bvsge32(main_~n~0#1, 0bv32) && ~bvslt32(main_~n~0#1, 1073741824bv32) then 1bv32 else 0bv32)); srcloc: L38" "call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(~bvmul32(4bv32, main_~n~0#1));assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4bv32, ~bvmul32(4bv32, main_~n~0#1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base);" "assume { :end_inline_#Ultimate.meminit } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~x~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;main_~y~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;" "SUMMARY for call assume_abort_if_not((if ~bvsge32(main_~x~0#1, 0bv32) && ~bvsge32(main_~y~0#1, 0bv32) then 1bv32 else 0bv32)); srcloc: L43" "assume { :begin_inline_lcp } true;lcp_#in~a#1.base, lcp_#in~a#1.offset, lcp_#in~n#1, lcp_#in~x#1, lcp_#in~y#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~x~0#1, main_~y~0#1;havoc lcp_#res#1;havoc lcp_#t~post8#1, lcp_#t~mem5#1, lcp_#t~mem6#1, lcp_#t~short7#1, lcp_~a#1.base, lcp_~a#1.offset, lcp_~n#1, lcp_~x#1, lcp_~y#1, lcp_~l~0#1;lcp_~a#1.base, lcp_~a#1.offset := lcp_#in~a#1.base, lcp_#in~a#1.offset;lcp_~n#1 := lcp_#in~n#1;lcp_~x#1 := lcp_#in~x#1;lcp_~y#1 := lcp_#in~y#1;lcp_~l~0#1 := 0bv32;" "lcp_#t~short7#1 := ~bvslt32(~bvadd32(lcp_~x#1, lcp_~l~0#1), lcp_~n#1) && ~bvslt32(~bvadd32(lcp_~y#1, lcp_~l~0#1), lcp_~n#1);" "assume lcp_#t~short7#1;call lcp_#t~mem5#1 := read~intINTTYPE4(lcp_~a#1.base, ~bvadd32(lcp_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(lcp_~x#1, lcp_~l~0#1))), 4bv32);call lcp_#t~mem6#1 := read~intINTTYPE4(lcp_~a#1.base, ~bvadd32(lcp_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(lcp_~y#1, lcp_~l~0#1))), 4bv32);lcp_#t~short7#1 := lcp_#t~mem5#1 == lcp_#t~mem6#1;" "assume !lcp_#t~short7#1;" "assume !lcp_#t~short7#1;havoc lcp_#t~mem5#1;havoc lcp_#t~mem6#1;havoc lcp_#t~short7#1;" "assume !!lcp_#t~short7#1;havoc lcp_#t~mem5#1;havoc lcp_#t~mem6#1;havoc lcp_#t~short7#1;lcp_#t~post8#1 := lcp_~l~0#1;lcp_~l~0#1 := ~bvadd32(1bv32, lcp_#t~post8#1);havoc lcp_#t~post8#1;" "assume !true;" "lcp_#res#1 := lcp_~l~0#1;" "main_#t~ret18#1 := lcp_#res#1;assume { :end_inline_lcp } true;main_~l~1#1 := main_#t~ret18#1;havoc main_#t~ret18#1;assume { :begin_inline_check } true;check_#in~a#1.base, check_#in~a#1.offset, check_#in~n#1, check_#in~x#1, check_#in~y#1, check_#in~l#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~l~1#1;havoc check_#t~nondet9#1, check_#t~mem10#1, check_#t~mem11#1, check_#t~mem12#1, check_#t~mem13#1, check_~a#1.base, check_~a#1.offset, check_~n#1, check_~x#1, check_~y#1, check_~l#1, check_~i~0#1;check_~a#1.base, check_~a#1.offset := check_#in~a#1.base, check_#in~a#1.offset;check_~n#1 := check_#in~n#1;check_~x#1 := check_#in~x#1;check_~y#1 := check_#in~y#1;check_~l#1 := check_#in~l#1;check_~i~0#1 := check_#t~nondet9#1;havoc check_#t~nondet9#1;" "SUMMARY for call assume_abort_if_not((if ~bvsle32(0bv32, check_~i~0#1) && ~bvslt32(check_~i~0#1, check_~l#1) then 1bv32 else 0bv32)); srcloc: L27" "call check_#t~mem10#1 := read~intINTTYPE4(check_~a#1.base, ~bvadd32(check_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(check_~x#1, check_~i~0#1))), 4bv32);call check_#t~mem11#1 := read~intINTTYPE4(check_~a#1.base, ~bvadd32(check_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(check_~y#1, check_~i~0#1))), 4bv32);" "SUMMARY for call __VERIFIER_assert((if check_#t~mem10#1 == check_#t~mem11#1 then 1bv32 else 0bv32)); srcloc: L28" "havoc check_#t~mem10#1;havoc check_#t~mem11#1;" "assume ~bvslt32(~bvadd32(check_~x#1, check_~l#1), check_~n#1) && ~bvslt32(~bvadd32(check_~y#1, check_~l#1), check_~n#1);call check_#t~mem12#1 := read~intINTTYPE4(check_~a#1.base, ~bvadd32(check_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(check_~x#1, check_~l#1))), 4bv32);call check_#t~mem13#1 := read~intINTTYPE4(check_~a#1.base, ~bvadd32(check_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(check_~y#1, check_~l#1))), 4bv32);" "SUMMARY for call __VERIFIER_assert((if check_#t~mem12#1 != check_#t~mem13#1 then 1bv32 else 0bv32)); srcloc: L32" "havoc check_#t~mem12#1;havoc check_#t~mem13#1;" "assume !(~bvslt32(~bvadd32(check_~x#1, check_~l#1), check_~n#1) && ~bvslt32(~bvadd32(check_~y#1, check_~l#1), check_~n#1));" "assume { :end_inline_check } true;call ULTIMATE.dealloc(main_~a~0#1.base, main_~a~0#1.offset);main_#res#1 := 0bv32;" "#t~ret19#1 := main_#res#1;assume { :end_inline_main } true;" "assume true;" "~cond := #in~cond;" "assume 0bv32 == ~cond;assume false;" "assume !(0bv32 == ~cond);" "assume true;" "~cond := #in~cond;" "assume 0bv32 == ~cond;" "assume !false;" "assume false;assume false;" "assume !(0bv32 == ~cond);" }, returnAlphabet = {"#66#return;" "#68#return;" "#70#return;" "#72#return;" "#74#return;" }, states = {"2291#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)" "2437#(and (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5|))) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond))" "2025#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|))" "2467#(and (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6|))) (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5|))) (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7|))))" "2461#(and (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_check_~a#1.base|)))" "2440#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5|))) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond))" "2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))" "2433#(and (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7|))) (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6|))) (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5|))))" "1999#true" "2423#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond))" "2429#(and (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|)))" }, initialStates = {"1999#true" }, finalStates = {}, callTransitions = { ("2461#(and (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_check_~a#1.base|)))" "call assume_abort_if_not((if ~bvsle32(0bv32, check_~i~0#1) && ~bvslt32(check_~i~0#1, check_~l#1) then 1bv32 else 0bv32));" "2467#(and (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6|))) (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5|))) (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7|))))") ("1999#true" "call assume_abort_if_not((if ~bvsge32(main_~n~0#1, 0bv32) && ~bvslt32(main_~n~0#1, 1073741824bv32) then 1bv32 else 0bv32));" "1999#true") ("1999#true" "call __VERIFIER_assert((if check_#t~mem10#1 == check_#t~mem11#1 then 1bv32 else 0bv32));" "1999#true") ("1999#true" "call __VERIFIER_assert((if check_#t~mem12#1 != check_#t~mem13#1 then 1bv32 else 0bv32));" "1999#true") ("2429#(and (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|)))" "call assume_abort_if_not((if ~bvsge32(main_~x~0#1, 0bv32) && ~bvsge32(main_~y~0#1, 0bv32) then 1bv32 else 0bv32));" "2433#(and (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7|))) (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6|))) (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5|))))") }, internalTransitions = { ("2291#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)" "assume !(0bv32 == ~cond);" "2423#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond))") ("2437#(and (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5|))) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond))" "assume !(0bv32 == ~cond);" "2440#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5|))) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond))") ("2025#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|))" "assume { :end_inline_#Ultimate.meminit } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~x~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;main_~y~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;" "2429#(and (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|)))") ("2467#(and (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_6|))) (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_5|))) (exists ((|v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_check_~a#1.base_BEFORE_CALL_7|))))" "~cond := #in~cond;" "2437#(and (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5|))) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond))") ("2440#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5|))) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond))" "assume true;" "2440#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5|))) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond))") ("2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))" "assume lcp_#t~short7#1;call lcp_#t~mem5#1 := read~intINTTYPE4(lcp_~a#1.base, ~bvadd32(lcp_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(lcp_~x#1, lcp_~l~0#1))), 4bv32);call lcp_#t~mem6#1 := read~intINTTYPE4(lcp_~a#1.base, ~bvadd32(lcp_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(lcp_~y#1, lcp_~l~0#1))), 4bv32);lcp_#t~short7#1 := lcp_#t~mem5#1 == lcp_#t~mem6#1;" "2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))") ("2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))" "assume !lcp_#t~short7#1;" "2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))") ("2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))" "assume !lcp_#t~short7#1;havoc lcp_#t~mem5#1;havoc lcp_#t~mem6#1;havoc lcp_#t~short7#1;" "2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))") ("2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))" "assume { :begin_inline_lcp } true;lcp_#in~a#1.base, lcp_#in~a#1.offset, lcp_#in~n#1, lcp_#in~x#1, lcp_#in~y#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~x~0#1, main_~y~0#1;havoc lcp_#res#1;havoc lcp_#t~post8#1, lcp_#t~mem5#1, lcp_#t~mem6#1, lcp_#t~short7#1, lcp_~a#1.base, lcp_~a#1.offset, lcp_~n#1, lcp_~x#1, lcp_~y#1, lcp_~l~0#1;lcp_~a#1.base, lcp_~a#1.offset := lcp_#in~a#1.base, lcp_#in~a#1.offset;lcp_~n#1 := lcp_#in~n#1;lcp_~x#1 := lcp_#in~x#1;lcp_~y#1 := lcp_#in~y#1;lcp_~l~0#1 := 0bv32;" "2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))") ("2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))" "assume !!lcp_#t~short7#1;havoc lcp_#t~mem5#1;havoc lcp_#t~mem6#1;havoc lcp_#t~short7#1;lcp_#t~post8#1 := lcp_~l~0#1;lcp_~l~0#1 := ~bvadd32(1bv32, lcp_#t~post8#1);havoc lcp_#t~post8#1;" "2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))") ("2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))" "lcp_#res#1 := lcp_~l~0#1;" "2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))") ("2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))" "lcp_#t~short7#1 := ~bvslt32(~bvadd32(lcp_~x#1, lcp_~l~0#1), lcp_~n#1) && ~bvslt32(~bvadd32(lcp_~y#1, lcp_~l~0#1), lcp_~n#1);" "2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))") ("2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))" "main_#t~ret18#1 := lcp_#res#1;assume { :end_inline_lcp } true;main_~l~1#1 := main_#t~ret18#1;havoc main_#t~ret18#1;assume { :begin_inline_check } true;check_#in~a#1.base, check_#in~a#1.offset, check_#in~n#1, check_#in~x#1, check_#in~y#1, check_#in~l#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~l~1#1;havoc check_#t~nondet9#1, check_#t~mem10#1, check_#t~mem11#1, check_#t~mem12#1, check_#t~mem13#1, check_~a#1.base, check_~a#1.offset, check_~n#1, check_~x#1, check_~y#1, check_~l#1, check_~i~0#1;check_~a#1.base, check_~a#1.offset := check_#in~a#1.base, check_#in~a#1.offset;check_~n#1 := check_#in~n#1;check_~x#1 := check_#in~x#1;check_~y#1 := check_#in~y#1;check_~l#1 := check_#in~l#1;check_~i~0#1 := check_#t~nondet9#1;havoc check_#t~nondet9#1;" "2461#(and (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_check_~a#1.base|)))") ("2433#(and (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_7|))) (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6|))) (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5|))))" "~cond := #in~cond;" "2437#(and (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5|))) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond))") ("1999#true" "assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(6bv32, 2bv32);call write~init~intINTTYPE1(108bv8, 2bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(99bv8, 2bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(112bv8, 2bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(46bv8, 2bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(99bv8, 2bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 2bv32, 5bv32, 1bv32);call #Ultimate.allocInit(12bv32, 3bv32);" "1999#true") ("1999#true" "call check_#t~mem10#1 := read~intINTTYPE4(check_~a#1.base, ~bvadd32(check_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(check_~x#1, check_~i~0#1))), 4bv32);call check_#t~mem11#1 := read~intINTTYPE4(check_~a#1.base, ~bvadd32(check_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(check_~y#1, check_~i~0#1))), 4bv32);" "1999#true") ("1999#true" "assume true;" "1999#true") ("1999#true" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~ret18#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~x~0#1, main_~y~0#1, main_~l~1#1;main_~n~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "1999#true") ("1999#true" "havoc check_#t~mem10#1;havoc check_#t~mem11#1;" "1999#true") ("1999#true" "call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(~bvmul32(4bv32, main_~n~0#1));assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4bv32, ~bvmul32(4bv32, main_~n~0#1);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base);" "2025#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|))") ("1999#true" "assume ~bvslt32(~bvadd32(check_~x#1, check_~l#1), check_~n#1) && ~bvslt32(~bvadd32(check_~y#1, check_~l#1), check_~n#1);call check_#t~mem12#1 := read~intINTTYPE4(check_~a#1.base, ~bvadd32(check_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(check_~x#1, check_~l#1))), 4bv32);call check_#t~mem13#1 := read~intINTTYPE4(check_~a#1.base, ~bvadd32(check_~a#1.offset, ~bvmul32(4bv32, ~bvadd32(check_~y#1, check_~l#1))), 4bv32);" "1999#true") ("1999#true" "~cond := #in~cond;" "1999#true") ("1999#true" "assume 0bv32 == ~cond;" "1999#true") ("1999#true" "assume !false;" "1999#true") ("1999#true" "assume !(0bv32 == ~cond);" "1999#true") ("1999#true" "~cond := #in~cond;" "2291#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)") ("2423#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond))" "assume true;" "2423#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond))") }, returnTransitions = { ("2440#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5|))) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond))" "2461#(and (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_check_~a#1.base|)))" "#70#return;" "1999#true") ("2440#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_5|))) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond))" "2429#(and (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|)))" "#68#return;" "2029#(= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))") ("1999#true" "1999#true" "#72#return;" "1999#true") ("2423#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond))" "1999#true" "#66#return;" "1999#true") } ); [2022-11-03 02:01:04,758 FATAL L593 BasicCegarLoop]: -- [2022-11-03 02:01:04,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 108 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=67, Invalid=298, Unknown=9, NotChecked=328, Total=702 [2022-11-03 02:01:04,760 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 203 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:04,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 181 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 203 Unchecked, 0.1s Time] [2022-11-03 02:01:04,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-03 02:01:05,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 02:01:05,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2022-11-03 02:01:05,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:01:05,398 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: enhanced interpolant automaton in iteration 6 broken: counterexample of length 40 not accepted (original is ok) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.checkEnhancement(BasicCegarLoop.java:568) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:391) 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) [2022-11-03 02:01:05,401 INFO L158 Benchmark]: Toolchain (without parser) took 126263.82ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 35.6MB in the beginning and 20.4MB in the end (delta: 15.2MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2022-11-03 02:01:05,401 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 58.7MB. Free memory was 39.0MB in the beginning and 38.9MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:01:05,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.02ms. Allocated memory is still 58.7MB. Free memory was 35.4MB in the beginning and 40.0MB in the end (delta: -4.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-03 02:01:05,402 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.93ms. Allocated memory is still 58.7MB. Free memory was 40.0MB in the beginning and 38.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:01:05,402 INFO L158 Benchmark]: Boogie Preprocessor took 68.86ms. Allocated memory is still 58.7MB. Free memory was 38.2MB in the beginning and 36.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:01:05,402 INFO L158 Benchmark]: RCFGBuilder took 526.74ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 36.6MB in the beginning and 54.9MB in the end (delta: -18.3MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2022-11-03 02:01:05,403 INFO L158 Benchmark]: TraceAbstraction took 125183.59ms. Allocated memory is still 75.5MB. Free memory was 54.1MB in the beginning and 20.4MB in the end (delta: 33.7MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2022-11-03 02:01:05,405 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.23ms. Allocated memory is still 58.7MB. Free memory was 39.0MB in the beginning and 38.9MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.02ms. Allocated memory is still 58.7MB. Free memory was 35.4MB in the beginning and 40.0MB in the end (delta: -4.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.93ms. Allocated memory is still 58.7MB. Free memory was 40.0MB in the beginning and 38.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.86ms. Allocated memory is still 58.7MB. Free memory was 38.2MB in the beginning and 36.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 526.74ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 36.6MB in the beginning and 54.9MB in the end (delta: -18.3MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * TraceAbstraction took 125183.59ms. Allocated memory is still 75.5MB. Free memory was 54.1MB in the beginning and 20.4MB in the end (delta: 33.7MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: enhanced interpolant automaton in iteration 6 broken: counterexample of length 40 not accepted (original is ok) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: enhanced interpolant automaton in iteration 6 broken: counterexample of length 40 not accepted (original is ok): de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.checkEnhancement(BasicCegarLoop.java:568) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-03 02:01:05,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a722cc2-0389-4ea5-b489-a7d1cdccd23c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: enhanced interpolant automaton in iteration 6 broken: counterexample of length 40 not accepted (original is ok)