./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/condm.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/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_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-fpi/condm.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/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_1055433a-fff0-475d-99aa-b7ae8aa349c7/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 6f961be2104ef3ac444088284f7936b105cc31dfbd8617bc6896bf1b51a5f23d --- 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:41:37,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:41:37,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:41:37,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:41:37,477 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:41:37,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:41:37,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:41:37,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:41:37,483 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:41:37,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:41:37,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:41:37,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:41:37,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:41:37,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:41:37,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:41:37,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:41:37,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:41:37,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:41:37,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:41:37,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:41:37,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:41:37,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:41:37,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:41:37,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:41:37,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:41:37,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:41:37,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:41:37,513 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:41:37,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:41:37,514 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:41:37,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:41:37,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:41:37,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:41:37,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:41:37,527 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:41:37,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:41:37,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:41:37,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:41:37,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:41:37,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:41:37,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:41:37,534 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 01:41:37,585 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:41:37,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:41:37,586 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:41:37,586 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:41:37,587 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:41:37,587 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:41:37,587 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:41:37,587 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:41:37,587 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:41:37,588 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:41:37,588 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:41:37,588 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:41:37,590 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:41:37,591 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:41:37,591 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:41:37,591 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:41:37,591 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:41:37,591 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:41:37,592 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:41:37,592 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:41:37,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:41:37,593 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:41:37,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:41:37,594 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:41:37,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:41:37,594 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:41:37,594 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:41:37,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:41:37,595 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:41:37,595 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:41:37,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:41:37,596 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:41:37,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:41:37,596 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:41:37,597 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:41:37,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:41:37,598 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:41:37,598 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:41:37,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:41:37,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:41:37,599 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:41:37,599 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_1055433a-fff0-475d-99aa-b7ae8aa349c7/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_1055433a-fff0-475d-99aa-b7ae8aa349c7/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 -> 6f961be2104ef3ac444088284f7936b105cc31dfbd8617bc6896bf1b51a5f23d [2022-11-03 01:41:37,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:41:37,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:41:37,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:41:37,931 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:41:37,932 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:41:37,933 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/array-fpi/condm.c [2022-11-03 01:41:38,007 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/data/f80f078ff/14c7aa5d537146c5b34d95f338accddd/FLAG93b5f67d0 [2022-11-03 01:41:38,463 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:41:38,464 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/sv-benchmarks/c/array-fpi/condm.c [2022-11-03 01:41:38,472 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/data/f80f078ff/14c7aa5d537146c5b34d95f338accddd/FLAG93b5f67d0 [2022-11-03 01:41:38,829 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/data/f80f078ff/14c7aa5d537146c5b34d95f338accddd [2022-11-03 01:41:38,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:41:38,834 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:41:38,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:41:38,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:41:38,842 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:41:38,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:41:38" (1/1) ... [2022-11-03 01:41:38,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1157b06b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:38, skipping insertion in model container [2022-11-03 01:41:38,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:41:38" (1/1) ... [2022-11-03 01:41:38,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:41:38,873 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:41:39,069 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_1055433a-fff0-475d-99aa-b7ae8aa349c7/sv-benchmarks/c/array-fpi/condm.c[588,601] [2022-11-03 01:41:39,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:41:39,096 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:41:39,106 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_1055433a-fff0-475d-99aa-b7ae8aa349c7/sv-benchmarks/c/array-fpi/condm.c[588,601] [2022-11-03 01:41:39,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:41:39,127 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:41:39,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:39 WrapperNode [2022-11-03 01:41:39,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:41:39,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:41:39,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:41:39,130 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:41:39,138 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:41:39" (1/1) ... [2022-11-03 01:41:39,146 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:41:39" (1/1) ... [2022-11-03 01:41:39,166 INFO L138 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2022-11-03 01:41:39,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:41:39,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:41:39,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:41:39,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:41:39,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:39" (1/1) ... [2022-11-03 01:41:39,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:39" (1/1) ... [2022-11-03 01:41:39,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:39" (1/1) ... [2022-11-03 01:41:39,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:39" (1/1) ... [2022-11-03 01:41:39,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:39" (1/1) ... [2022-11-03 01:41:39,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:39" (1/1) ... [2022-11-03 01:41:39,192 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:39" (1/1) ... [2022-11-03 01:41:39,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:39" (1/1) ... [2022-11-03 01:41:39,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:41:39,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:41:39,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:41:39,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:41:39,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:39" (1/1) ... [2022-11-03 01:41:39,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:41:39,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:41:39,236 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:41:39,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:41:39,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:41:39,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:41:39,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 01:41:39,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 01:41:39,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:41:39,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:41:39,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 01:41:39,366 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:41:39,369 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:41:39,612 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:41:39,689 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:41:39,690 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-03 01:41:39,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:41:39 BoogieIcfgContainer [2022-11-03 01:41:39,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:41:39,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:41:39,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:41:39,706 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:41:39,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:41:38" (1/3) ... [2022-11-03 01:41:39,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2753e266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:41:39, skipping insertion in model container [2022-11-03 01:41:39,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:41:39" (2/3) ... [2022-11-03 01:41:39,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2753e266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:41:39, skipping insertion in model container [2022-11-03 01:41:39,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:41:39" (3/3) ... [2022-11-03 01:41:39,710 INFO L112 eAbstractionObserver]: Analyzing ICFG condm.c [2022-11-03 01:41:39,731 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:41:39,732 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 01:41:39,812 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:41:39,827 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;@2fa2892, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:41:39,827 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 01:41:39,834 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:41:39,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 01:41:39,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:39,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:41:39,845 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:39,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:39,855 INFO L85 PathProgramCache]: Analyzing trace with hash -529185191, now seen corresponding path program 1 times [2022-11-03 01:41:39,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:39,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670172777] [2022-11-03 01:41:39,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:39,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:40,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:41:40,269 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:40,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670172777] [2022-11-03 01:41:40,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670172777] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:41:40,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:41:40,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:41:40,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382650304] [2022-11-03 01:41:40,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:41:40,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:41:40,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:40,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:41:40,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:41:40,363 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:41:40,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:41:40,464 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-11-03 01:41:40,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:41:40,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-03 01:41:40,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:41:40,482 INFO L225 Difference]: With dead ends: 20 [2022-11-03 01:41:40,482 INFO L226 Difference]: Without dead ends: 10 [2022-11-03 01:41:40,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:41:40,488 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:41:40,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:41:40,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-11-03 01:41:40,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-11-03 01:41:40,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:41:40,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2022-11-03 01:41:40,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2022-11-03 01:41:40,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:41:40,523 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2022-11-03 01:41:40,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:41:40,523 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2022-11-03 01:41:40,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 01:41:40,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:40,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:41:40,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:41:40,524 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:40,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:40,525 INFO L85 PathProgramCache]: Analyzing trace with hash 351199448, now seen corresponding path program 1 times [2022-11-03 01:41:40,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:40,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237357896] [2022-11-03 01:41:40,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:40,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:41:40,706 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:40,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237357896] [2022-11-03 01:41:40,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237357896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:41:40,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:41:40,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:41:40,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411488464] [2022-11-03 01:41:40,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:41:40,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:41:40,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:40,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:41:40,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:41:40,711 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:41:40,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:41:40,765 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-11-03 01:41:40,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:41:40,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 01:41:40,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:41:40,769 INFO L225 Difference]: With dead ends: 21 [2022-11-03 01:41:40,769 INFO L226 Difference]: Without dead ends: 16 [2022-11-03 01:41:40,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:41:40,775 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:41:40,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 6 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:41:40,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-11-03 01:41:40,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2022-11-03 01:41:40,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:41:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2022-11-03 01:41:40,784 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2022-11-03 01:41:40,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:41:40,784 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2022-11-03 01:41:40,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:41:40,785 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2022-11-03 01:41:40,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 01:41:40,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:40,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:41:40,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:41:40,787 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:40,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:40,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1994057592, now seen corresponding path program 1 times [2022-11-03 01:41:40,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:40,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271834178] [2022-11-03 01:41:40,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:40,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:42,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:41:42,404 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:42,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271834178] [2022-11-03 01:41:42,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271834178] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:41:42,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884006287] [2022-11-03 01:41:42,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:42,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:42,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:41:42,413 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:41:42,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 01:41:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:42,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-03 01:41:42,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:41:42,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 01:41:42,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 57 [2022-11-03 01:41:42,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-11-03 01:41:42,938 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 40 treesize of output 28 [2022-11-03 01:41:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:41:42,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:41:43,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-03 01:41:43,592 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 61 treesize of output 55 [2022-11-03 01:41:43,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2022-11-03 01:41:43,634 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 17 treesize of output 15 [2022-11-03 01:41:43,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-11-03 01:41:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:41:43,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884006287] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:41:43,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [37835748] [2022-11-03 01:41:43,700 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-03 01:41:43,700 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:41:43,704 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:41:43,710 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:41:43,711 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:41:43,815 INFO L356 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-03 01:41:43,815 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:41:43,832 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 26 treesize of output 34 [2022-11-03 01:41:43,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 01:41:43,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:41:44,000 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:41:44,033 INFO L356 Elim1Store]: treesize reduction 54, result has 28.0 percent of original size [2022-11-03 01:41:44,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 261 treesize of output 264 [2022-11-03 01:41:44,166 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 16 treesize of output 12 [2022-11-03 01:41:44,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-03 01:41:44,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-03 01:41:44,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:41:44,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:41:44,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:41:44,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:41:44,294 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:41:44,690 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '173#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem11#1|) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (= (ite (= (ite (and (< |ULTIMATE.start_main_#t~mem11#1| 0) (not (= (mod |ULTIMATE.start_main_#t~mem11#1| 2) 0))) (+ (mod |ULTIMATE.start_main_#t~mem11#1| 2) (- 2)) (mod |ULTIMATE.start_main_#t~mem11#1| 2)) (ite (and (not (= (mod ~N~0 2) 0)) (< ~N~0 0)) (+ (- 2) (mod ~N~0 2)) (mod ~N~0 2))) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-03 01:41:44,690 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:41:44,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:41:44,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-11-03 01:41:44,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001717796] [2022-11-03 01:41:44,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:41:44,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 01:41:44,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:44,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 01:41:44,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-11-03 01:41:44,693 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:41:45,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:41:45,744 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-11-03 01:41:45,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 01:41:45,745 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 01:41:45,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:41:45,746 INFO L225 Difference]: With dead ends: 41 [2022-11-03 01:41:45,746 INFO L226 Difference]: Without dead ends: 36 [2022-11-03 01:41:45,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=193, Invalid=929, Unknown=0, NotChecked=0, Total=1122 [2022-11-03 01:41:45,748 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:41:45,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 76 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:41:45,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-03 01:41:45,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 16. [2022-11-03 01:41:45,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:41:45,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2022-11-03 01:41:45,758 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 9 [2022-11-03 01:41:45,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:41:45,759 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-11-03 01:41:45,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:41:45,759 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2022-11-03 01:41:45,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 01:41:45,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:45,760 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:41:45,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 01:41:45,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:45,961 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:45,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:45,961 INFO L85 PathProgramCache]: Analyzing trace with hash -2052976825, now seen corresponding path program 2 times [2022-11-03 01:41:45,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:45,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843882086] [2022-11-03 01:41:45,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:45,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:46,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:41:46,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:46,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843882086] [2022-11-03 01:41:46,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843882086] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:41:46,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270081470] [2022-11-03 01:41:46,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:41:46,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:46,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:41:46,060 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:41:46,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 01:41:46,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:41:46,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:41:46,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 01:41:46,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:41:46,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:41:46,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:41:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:41:46,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270081470] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:41:46,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1441264215] [2022-11-03 01:41:46,252 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-03 01:41:46,252 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:41:46,252 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:41:46,253 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:41:46,253 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:41:46,329 INFO L356 Elim1Store]: treesize reduction 42, result has 40.0 percent of original size [2022-11-03 01:41:46,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2022-11-03 01:41:46,407 INFO L356 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-03 01:41:46,408 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:41:46,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 01:41:46,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:41:46,511 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:41:46,547 INFO L356 Elim1Store]: treesize reduction 54, result has 28.0 percent of original size [2022-11-03 01:41:46,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 261 treesize of output 264 [2022-11-03 01:41:46,664 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 16 treesize of output 12 [2022-11-03 01:41:46,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-03 01:41:46,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-03 01:41:46,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:41:46,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:41:46,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:41:46,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:41:46,884 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:41:47,188 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '348#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem11#1|) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (= (ite (= (ite (and (< |ULTIMATE.start_main_#t~mem11#1| 0) (not (= (mod |ULTIMATE.start_main_#t~mem11#1| 2) 0))) (+ (mod |ULTIMATE.start_main_#t~mem11#1| 2) (- 2)) (mod |ULTIMATE.start_main_#t~mem11#1| 2)) (ite (and (not (= (mod ~N~0 2) 0)) (< ~N~0 0)) (+ (- 2) (mod ~N~0 2)) (mod ~N~0 2))) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-03 01:41:47,188 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:41:47,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:41:47,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-03 01:41:47,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605758625] [2022-11-03 01:41:47,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:41:47,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 01:41:47,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:47,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 01:41:47,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-11-03 01:41:47,190 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:41:47,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:41:47,395 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-11-03 01:41:47,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:41:47,396 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-03 01:41:47,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:41:47,397 INFO L225 Difference]: With dead ends: 35 [2022-11-03 01:41:47,397 INFO L226 Difference]: Without dead ends: 30 [2022-11-03 01:41:47,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2022-11-03 01:41:47,399 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:41:47,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 35 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:41:47,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-03 01:41:47,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 17. [2022-11-03 01:41:47,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:41:47,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-11-03 01:41:47,408 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2022-11-03 01:41:47,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:41:47,408 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-11-03 01:41:47,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:41:47,409 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-11-03 01:41:47,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:41:47,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:47,410 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:41:47,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 01:41:47,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:47,610 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:47,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:47,611 INFO L85 PathProgramCache]: Analyzing trace with hash -616766840, now seen corresponding path program 3 times [2022-11-03 01:41:47,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:47,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752991477] [2022-11-03 01:41:47,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:47,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:47,724 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:41:47,724 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:47,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752991477] [2022-11-03 01:41:47,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752991477] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:41:47,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31338123] [2022-11-03 01:41:47,725 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:41:47,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:47,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:41:47,727 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:41:47,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 01:41:47,800 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:41:47,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:41:47,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 01:41:47,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:41:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:41:47,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:41:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:41:47,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31338123] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:41:47,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1430326716] [2022-11-03 01:41:47,944 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-03 01:41:47,944 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:41:47,944 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:41:47,945 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:41:47,945 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:41:48,063 INFO L356 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-03 01:41:48,064 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:41:48,076 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 26 treesize of output 34 [2022-11-03 01:41:48,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 01:41:48,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:41:48,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:41:48,225 INFO L356 Elim1Store]: treesize reduction 54, result has 28.0 percent of original size [2022-11-03 01:41:48,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 261 treesize of output 264 [2022-11-03 01:41:48,365 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 16 treesize of output 12 [2022-11-03 01:41:48,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-03 01:41:48,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-03 01:41:48,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:41:48,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:41:48,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:41:48,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:41:48,506 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:41:48,884 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '512#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem11#1|) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (= (ite (= (ite (and (< |ULTIMATE.start_main_#t~mem11#1| 0) (not (= (mod |ULTIMATE.start_main_#t~mem11#1| 2) 0))) (+ (mod |ULTIMATE.start_main_#t~mem11#1| 2) (- 2)) (mod |ULTIMATE.start_main_#t~mem11#1| 2)) (ite (and (not (= (mod ~N~0 2) 0)) (< ~N~0 0)) (+ (- 2) (mod ~N~0 2)) (mod ~N~0 2))) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-03 01:41:48,885 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:41:48,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:41:48,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-11-03 01:41:48,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326174825] [2022-11-03 01:41:48,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:41:48,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:41:48,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:41:48,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:41:48,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2022-11-03 01:41:48,887 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 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:41:49,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:41:49,055 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2022-11-03 01:41:49,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 01:41:49,056 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 01:41:49,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:41:49,058 INFO L225 Difference]: With dead ends: 57 [2022-11-03 01:41:49,059 INFO L226 Difference]: Without dead ends: 42 [2022-11-03 01:41:49,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2022-11-03 01:41:49,061 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 42 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:41:49,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 34 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:41:49,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-03 01:41:49,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 23. [2022-11-03 01:41:49,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:41:49,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-11-03 01:41:49,079 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 11 [2022-11-03 01:41:49,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:41:49,080 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-11-03 01:41:49,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 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:41:49,080 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-11-03 01:41:49,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:41:49,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:49,084 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:41:49,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 01:41:49,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:49,297 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:41:49,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:49,298 INFO L85 PathProgramCache]: Analyzing trace with hash 785889273, now seen corresponding path program 4 times [2022-11-03 01:41:49,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:41:49,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693739649] [2022-11-03 01:41:49,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:49,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:41:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:50,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:41:50,647 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:41:50,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693739649] [2022-11-03 01:41:50,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693739649] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:41:50,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763108247] [2022-11-03 01:41:50,648 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:41:50,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:41:50,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:41:50,649 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:41:50,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 01:41:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:50,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 01:41:50,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:41:50,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:41:50,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:41:50,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 01:41:50,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2022-11-03 01:41:50,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-11-03 01:41:50,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-03 01:41:50,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-03 01:41:51,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:41:51,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 91 [2022-11-03 01:41:51,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-03 01:41:51,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34 [2022-11-03 01:41:51,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-11-03 01:41:51,226 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 131 treesize of output 91 [2022-11-03 01:41:51,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:41:51,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:43:13,452 WARN L234 SmtUtils]: Spent 54.17s on a formula simplification. DAG size of input: 70 DAG size of output: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:43:14,050 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 306 treesize of output 286 [2022-11-03 01:43:14,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 816 treesize of output 796 [2022-11-03 01:43:14,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:14,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763108247] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:43:14,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [44355346] [2022-11-03 01:43:14,430 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-03 01:43:14,431 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:43:14,431 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:43:14,431 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:43:14,431 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:43:14,507 INFO L356 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-03 01:43:14,508 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:43:14,524 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 26 treesize of output 34 [2022-11-03 01:43:14,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-11-03 01:43:14,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:14,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:14,636 INFO L356 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2022-11-03 01:43:14,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 266 treesize of output 263 [2022-11-03 01:43:14,696 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 16 treesize of output 12 [2022-11-03 01:43:14,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:14,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:14,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:14,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:14,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:14,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:14,832 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:43:15,302 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '729#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem11#1|) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (= (ite (= (ite (and (< |ULTIMATE.start_main_#t~mem11#1| 0) (not (= (mod |ULTIMATE.start_main_#t~mem11#1| 2) 0))) (+ (mod |ULTIMATE.start_main_#t~mem11#1| 2) (- 2)) (mod |ULTIMATE.start_main_#t~mem11#1| 2)) (ite (and (not (= (mod ~N~0 2) 0)) (< ~N~0 0)) (+ (- 2) (mod ~N~0 2)) (mod ~N~0 2))) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-03 01:43:15,302 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:43:15,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:43:15,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-11-03 01:43:15,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737300401] [2022-11-03 01:43:15,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:43:15,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 01:43:15,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:15,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 01:43:15,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=735, Unknown=7, NotChecked=0, Total=870 [2022-11-03 01:43:15,305 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:15,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:15,656 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-11-03 01:43:15,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 01:43:15,656 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 01:43:15,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:15,657 INFO L225 Difference]: With dead ends: 30 [2022-11-03 01:43:15,657 INFO L226 Difference]: Without dead ends: 28 [2022-11-03 01:43:15,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 83.1s TimeCoverageRelationStatistics Valid=161, Invalid=888, Unknown=7, NotChecked=0, Total=1056 [2022-11-03 01:43:15,659 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:15,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 42 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 133 Invalid, 0 Unknown, 36 Unchecked, 0.1s Time] [2022-11-03 01:43:15,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-03 01:43:15,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-11-03 01:43:15,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-11-03 01:43:15,669 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 11 [2022-11-03 01:43:15,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:15,670 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-11-03 01:43:15,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:15,670 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-11-03 01:43:15,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:43:15,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:15,671 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:15,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 01:43:15,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:43:15,881 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:43:15,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:15,881 INFO L85 PathProgramCache]: Analyzing trace with hash -918792, now seen corresponding path program 5 times [2022-11-03 01:43:15,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:15,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087263429] [2022-11-03 01:43:15,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:15,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:15,997 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:15,997 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:15,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087263429] [2022-11-03 01:43:15,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087263429] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:43:15,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762033343] [2022-11-03 01:43:15,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:43:15,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:43:15,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:43:15,999 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:43:16,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 01:43:16,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 01:43:16,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:43:16,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 01:43:16,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:43:16,150 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:16,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:43:16,209 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:16,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762033343] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:43:16,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2043853632] [2022-11-03 01:43:16,211 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-03 01:43:16,211 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:43:16,212 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:43:16,212 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:43:16,212 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:43:16,276 INFO L356 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-03 01:43:16,277 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:43:16,289 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 26 treesize of output 34 [2022-11-03 01:43:16,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-11-03 01:43:16,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:16,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:16,391 INFO L356 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2022-11-03 01:43:16,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 266 treesize of output 263 [2022-11-03 01:43:16,443 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 16 treesize of output 12 [2022-11-03 01:43:16,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:16,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:16,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:16,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:16,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:16,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:16,560 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:43:16,858 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '908#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem11#1|) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (= (ite (= (ite (and (< |ULTIMATE.start_main_#t~mem11#1| 0) (not (= (mod |ULTIMATE.start_main_#t~mem11#1| 2) 0))) (+ (mod |ULTIMATE.start_main_#t~mem11#1| 2) (- 2)) (mod |ULTIMATE.start_main_#t~mem11#1| 2)) (ite (and (not (= (mod ~N~0 2) 0)) (< ~N~0 0)) (+ (- 2) (mod ~N~0 2)) (mod ~N~0 2))) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-03 01:43:16,858 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:43:16,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:43:16,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-03 01:43:16,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970461765] [2022-11-03 01:43:16,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:43:16,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:43:16,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:16,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:43:16,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-11-03 01:43:16,860 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:17,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:17,046 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-11-03 01:43:17,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 01:43:17,046 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 01:43:17,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:17,047 INFO L225 Difference]: With dead ends: 47 [2022-11-03 01:43:17,047 INFO L226 Difference]: Without dead ends: 40 [2022-11-03 01:43:17,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2022-11-03 01:43:17,048 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 61 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:17,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 51 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:43:17,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-03 01:43:17,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 23. [2022-11-03 01:43:17,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:17,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-11-03 01:43:17,057 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 12 [2022-11-03 01:43:17,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:17,057 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-11-03 01:43:17,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:17,058 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-11-03 01:43:17,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 01:43:17,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:17,059 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:17,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 01:43:17,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-03 01:43:17,273 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:43:17,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:17,274 INFO L85 PathProgramCache]: Analyzing trace with hash -24821144, now seen corresponding path program 6 times [2022-11-03 01:43:17,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:17,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675737829] [2022-11-03 01:43:17,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:17,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:19,212 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:19,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:19,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675737829] [2022-11-03 01:43:19,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675737829] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:43:19,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889524480] [2022-11-03 01:43:19,213 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:43:19,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:43:19,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:43:19,214 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:43:19,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 01:43:19,278 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:43:19,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:43:19,280 WARN L261 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-03 01:43:19,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:43:19,293 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 16 treesize of output 12 [2022-11-03 01:43:19,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-11-03 01:43:19,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-03 01:43:19,498 INFO L356 Elim1Store]: treesize reduction 42, result has 52.8 percent of original size [2022-11-03 01:43:19,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 102 [2022-11-03 01:43:19,559 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:43:19,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-03 01:43:19,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2022-11-03 01:43:19,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:19,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2022-11-03 01:43:19,847 INFO L356 Elim1Store]: treesize reduction 96, result has 38.1 percent of original size [2022-11-03 01:43:19,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 95 treesize of output 146 [2022-11-03 01:43:19,987 INFO L356 Elim1Store]: treesize reduction 10, result has 71.4 percent of original size [2022-11-03 01:43:19,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 102 [2022-11-03 01:43:20,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 103 [2022-11-03 01:43:20,128 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:43:20,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 102 [2022-11-03 01:43:20,407 INFO L356 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2022-11-03 01:43:20,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 136 [2022-11-03 01:43:20,526 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:43:20,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 70 [2022-11-03 01:43:20,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 82 [2022-11-03 01:43:20,598 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:43:20,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 83 [2022-11-03 01:43:20,959 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 40 treesize of output 28 [2022-11-03 01:43:20,998 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:20,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:43:22,613 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:22,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889524480] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:43:22,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1093152272] [2022-11-03 01:43:22,616 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-03 01:43:22,616 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:43:22,616 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:43:22,616 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:43:22,617 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:43:22,695 INFO L356 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-03 01:43:22,696 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:43:22,711 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 26 treesize of output 34 [2022-11-03 01:43:22,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-11-03 01:43:22,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:22,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:22,817 INFO L356 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2022-11-03 01:43:22,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 266 treesize of output 263 [2022-11-03 01:43:22,875 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 16 treesize of output 12 [2022-11-03 01:43:22,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:22,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:22,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:22,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:22,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:22,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:22,979 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:43:23,487 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1129#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem11#1|) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (= (ite (= (ite (and (< |ULTIMATE.start_main_#t~mem11#1| 0) (not (= (mod |ULTIMATE.start_main_#t~mem11#1| 2) 0))) (+ (mod |ULTIMATE.start_main_#t~mem11#1| 2) (- 2)) (mod |ULTIMATE.start_main_#t~mem11#1| 2)) (ite (and (not (= (mod ~N~0 2) 0)) (< ~N~0 0)) (+ (- 2) (mod ~N~0 2)) (mod ~N~0 2))) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-03 01:43:23,487 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:43:23,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:43:23,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2022-11-03 01:43:23,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45546648] [2022-11-03 01:43:23,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:43:23,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 01:43:23,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:23,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 01:43:23,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=978, Unknown=0, NotChecked=0, Total=1122 [2022-11-03 01:43:23,490 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:24,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:24,915 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2022-11-03 01:43:24,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-03 01:43:24,916 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 01:43:24,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:24,917 INFO L225 Difference]: With dead ends: 42 [2022-11-03 01:43:24,918 INFO L226 Difference]: Without dead ends: 40 [2022-11-03 01:43:24,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=281, Invalid=1975, Unknown=0, NotChecked=0, Total=2256 [2022-11-03 01:43:24,919 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 14 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:24,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 43 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 51 Unchecked, 0.1s Time] [2022-11-03 01:43:24,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-03 01:43:24,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2022-11-03 01:43:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 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:43:24,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-11-03 01:43:24,934 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 13 [2022-11-03 01:43:24,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:24,935 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-11-03 01:43:24,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:24,935 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-11-03 01:43:24,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:43:24,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:24,936 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:24,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 01:43:25,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-03 01:43:25,146 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:43:25,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:25,146 INFO L85 PathProgramCache]: Analyzing trace with hash 565750421, now seen corresponding path program 1 times [2022-11-03 01:43:25,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:25,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084279028] [2022-11-03 01:43:25,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:25,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:27,039 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:27,039 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:27,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084279028] [2022-11-03 01:43:27,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084279028] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:43:27,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845613379] [2022-11-03 01:43:27,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:27,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:43:27,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:43:27,042 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:43:27,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 01:43:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:27,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-03 01:43:27,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:43:27,156 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 16 treesize of output 12 [2022-11-03 01:43:27,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:27,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:43:27,315 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:27,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:27,322 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:43:27,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 108 [2022-11-03 01:43:27,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2022-11-03 01:43:27,358 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:27,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:27,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2022-11-03 01:43:27,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:27,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:27,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2022-11-03 01:43:27,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:27,493 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:43:27,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 97 [2022-11-03 01:43:27,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 67 [2022-11-03 01:43:27,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:27,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 57 [2022-11-03 01:43:27,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:27,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 53 [2022-11-03 01:43:28,023 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:43:28,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 97 [2022-11-03 01:43:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:28,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:43:29,893 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 179 treesize of output 167 [2022-11-03 01:43:29,902 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:43:29,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 265 treesize of output 247 [2022-11-03 01:43:29,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-11-03 01:43:29,973 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:43:29,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 140 [2022-11-03 01:43:30,052 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:30,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845613379] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:43:30,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [359550750] [2022-11-03 01:43:30,055 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-03 01:43:30,055 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:43:30,055 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:43:30,056 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:43:30,056 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:43:30,124 INFO L356 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-03 01:43:30,125 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:43:30,136 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 26 treesize of output 34 [2022-11-03 01:43:30,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 01:43:30,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:30,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:30,258 INFO L356 Elim1Store]: treesize reduction 54, result has 28.0 percent of original size [2022-11-03 01:43:30,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 261 treesize of output 264 [2022-11-03 01:43:30,342 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 16 treesize of output 12 [2022-11-03 01:43:30,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:30,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:30,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:30,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:30,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:30,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:30,581 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:43:31,218 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1392#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 1) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-03 01:43:31,218 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:43:31,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:43:31,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 31 [2022-11-03 01:43:31,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045632801] [2022-11-03 01:43:31,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:43:31,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 01:43:31,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:31,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 01:43:31,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1161, Unknown=0, NotChecked=0, Total=1332 [2022-11-03 01:43:31,221 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:42,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:42,024 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2022-11-03 01:43:42,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-03 01:43:42,025 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 01:43:42,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:42,025 INFO L225 Difference]: With dead ends: 67 [2022-11-03 01:43:42,026 INFO L226 Difference]: Without dead ends: 57 [2022-11-03 01:43:42,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=589, Invalid=3833, Unknown=0, NotChecked=0, Total=4422 [2022-11-03 01:43:42,028 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 81 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:42,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 49 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 01:43:42,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-03 01:43:42,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 31. [2022-11-03 01:43:42,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:42,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2022-11-03 01:43:42,047 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 14 [2022-11-03 01:43:42,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:42,047 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2022-11-03 01:43:42,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:42,048 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-11-03 01:43:42,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:43:42,048 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:42,048 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:42,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 01:43:42,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:43:42,249 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:43:42,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:42,250 INFO L85 PathProgramCache]: Analyzing trace with hash 2033849448, now seen corresponding path program 7 times [2022-11-03 01:43:42,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:42,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779856853] [2022-11-03 01:43:42,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:42,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:42,426 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:42,426 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:42,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779856853] [2022-11-03 01:43:42,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779856853] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:43:42,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909318624] [2022-11-03 01:43:42,427 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:43:42,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:43:42,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:43:42,429 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:43:42,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 01:43:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:42,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 01:43:42,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:43:42,603 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:43:42,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:43:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:43:42,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909318624] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:43:42,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [197608895] [2022-11-03 01:43:42,680 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-03 01:43:42,681 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:43:42,681 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:43:42,681 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:43:42,681 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:43:42,754 INFO L356 Elim1Store]: treesize reduction 42, result has 40.0 percent of original size [2022-11-03 01:43:42,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2022-11-03 01:43:42,817 INFO L356 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-03 01:43:42,817 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:43:42,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 01:43:42,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:42,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:42,932 INFO L356 Elim1Store]: treesize reduction 54, result has 28.0 percent of original size [2022-11-03 01:43:42,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 261 treesize of output 264 [2022-11-03 01:43:43,031 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 16 treesize of output 12 [2022-11-03 01:43:43,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:43,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:43,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:43,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:43,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:43,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:43:43,137 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:43:43,471 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1711#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem11#1|) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (= (ite (= (ite (and (< |ULTIMATE.start_main_#t~mem11#1| 0) (not (= (mod |ULTIMATE.start_main_#t~mem11#1| 2) 0))) (+ (mod |ULTIMATE.start_main_#t~mem11#1| 2) (- 2)) (mod |ULTIMATE.start_main_#t~mem11#1| 2)) (ite (and (not (= (mod ~N~0 2) 0)) (< ~N~0 0)) (+ (- 2) (mod ~N~0 2)) (mod ~N~0 2))) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-03 01:43:43,471 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:43:43,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:43:43,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 17 [2022-11-03 01:43:43,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525725052] [2022-11-03 01:43:43,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:43:43,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 01:43:43,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:43,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 01:43:43,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2022-11-03 01:43:43,474 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:43,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:43,658 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2022-11-03 01:43:43,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 01:43:43,658 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:43:43,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:43,659 INFO L225 Difference]: With dead ends: 75 [2022-11-03 01:43:43,659 INFO L226 Difference]: Without dead ends: 58 [2022-11-03 01:43:43,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2022-11-03 01:43:43,661 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 60 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:43,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 63 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:43:43,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-03 01:43:43,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 36. [2022-11-03 01:43:43,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:43,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-11-03 01:43:43,678 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 15 [2022-11-03 01:43:43,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:43,678 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-11-03 01:43:43,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:43,679 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-11-03 01:43:43,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:43:43,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:43,679 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:43,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 01:43:43,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 01:43:43,881 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:43:43,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:43,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1366643097, now seen corresponding path program 8 times [2022-11-03 01:43:43,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:43,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578564861] [2022-11-03 01:43:43,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:43,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:45,827 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:45,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578564861] [2022-11-03 01:43:45,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578564861] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:43:45,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975311843] [2022-11-03 01:43:45,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:43:45,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:43:45,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:43:45,842 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:43:45,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 01:43:45,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 01:43:45,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:43:45,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-03 01:43:45,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:43:45,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:43:46,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:46,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 01:43:46,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:46,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 01:43:46,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:46,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 01:43:46,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2022-11-03 01:43:46,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-11-03 01:43:46,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-03 01:43:46,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-03 01:43:46,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:46,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 91 [2022-11-03 01:43:46,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-03 01:43:46,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-03 01:43:46,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-11-03 01:43:46,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:46,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 91 [2022-11-03 01:43:46,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-03 01:43:46,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34 [2022-11-03 01:43:46,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-11-03 01:43:46,594 INFO L356 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-11-03 01:43:46,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 103 [2022-11-03 01:43:46,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2022-11-03 01:43:46,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-11-03 01:43:46,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-03 01:43:46,874 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 131 treesize of output 91 [2022-11-03 01:43:46,914 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:46,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:43:48,152 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~N~0 2))) (let ((.cse0 (= .cse1 0))) (let ((.cse3 (< c_~N~0 0)) (.cse5 (not .cse0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (or .cse0 (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_378 Int)) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (= .cse1 (mod (select (store .cse2 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))))) (or (not .cse3) .cse0 (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_378 Int)) (or (< (select (store .cse2 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)))) (or (and (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_378 Int)) (let ((.cse4 (select (store .cse2 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (mod .cse4 2) 0) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (not (< .cse4 0))))) .cse0) (or .cse5 (forall ((v_ArrVal_379 Int) (|ULTIMATE.start_main_~i~0#1| Int)) (let ((.cse6 (select (store .cse2 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_379) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse6 0)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (= (mod .cse6 2) 0)))))) .cse3) (or .cse5 (forall ((v_ArrVal_379 Int) (|ULTIMATE.start_main_~i~0#1| Int)) (or (= .cse1 (mod (select (store .cse2 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_379) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)))))))) is different from false [2022-11-03 01:43:49,258 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (mod c_~N~0 2))) (let ((.cse4 (< c_~N~0 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (= .cse5 0))) (and (or (not .cse0) (and (or (forall ((v_ArrVal_379 Int) (v_ArrVal_375 Int) (v_subst_2 Int)) (let ((.cse1 (select (store (store .cse2 .cse3 v_ArrVal_375) (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_379) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse1 0)) (< (+ v_subst_2 1) c_~N~0) (= (mod .cse1 2) 0)))) .cse4) (forall ((v_ArrVal_379 Int) (v_ArrVal_375 Int) (v_subst_5 Int)) (or (< (+ v_subst_5 1) c_~N~0) (= .cse5 (mod (select (store (store .cse2 .cse3 v_ArrVal_375) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) v_ArrVal_379) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))))) (or (and (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_subst_4 Int)) (or (< (+ v_subst_4 1) c_~N~0) (= .cse5 (mod (select (store (store .cse2 .cse3 v_ArrVal_374) (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))) (or (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_subst_3 Int)) (let ((.cse6 (select (store (store .cse2 .cse3 v_ArrVal_374) (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse6 0)) (= (mod .cse6 2) 0) (< (+ v_subst_3 1) c_~N~0)))) .cse4) (or (<= 0 c_~N~0) (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_subst_1 Int)) (or (< (+ v_subst_1 1) c_~N~0) (< (select (store (store .cse2 .cse3 v_ArrVal_374) (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) .cse0)))) is different from false [2022-11-03 01:43:51,506 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (mod c_~N~0 2))) (let ((.cse0 (= .cse4 0)) (.cse6 (< c_~N~0 0)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or .cse0 (and (or (<= 0 c_~N~0) (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_ArrVal_373 Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (v_subst_1 Int)) (or (< (select (store (store (store .cse1 .cse2 v_ArrVal_373) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_374) (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< (+ v_subst_1 1) c_~N~0) (not (<= .cse3 |v_ULTIMATE.start_main_~i~0#1_221|))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_221| Int)) (or (not (<= .cse3 |v_ULTIMATE.start_main_~i~0#1_221|)) (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_ArrVal_373 Int) (v_subst_4 Int)) (or (< (+ v_subst_4 1) c_~N~0) (= .cse4 (mod (select (store (store (store .cse1 .cse2 v_ArrVal_373) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_374) (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))))) (or (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_ArrVal_373 Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (v_subst_3 Int)) (let ((.cse5 (select (store (store (store .cse1 .cse2 v_ArrVal_373) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_374) (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse5 0)) (= (mod .cse5 2) 0) (not (<= .cse3 |v_ULTIMATE.start_main_~i~0#1_221|)) (< (+ v_subst_3 1) c_~N~0)))) .cse6))) (or (not .cse0) (and (or (forall ((v_ArrVal_379 Int) (v_ArrVal_375 Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (v_ArrVal_370 Int) (v_subst_2 Int)) (let ((.cse7 (select (store (store (store .cse1 .cse2 v_ArrVal_370) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_375) (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_379) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ v_subst_2 1) c_~N~0) (not (< .cse7 0)) (= (mod .cse7 2) 0) (not (<= .cse3 |v_ULTIMATE.start_main_~i~0#1_221|))))) .cse6) (forall ((|v_ULTIMATE.start_main_~i~0#1_221| Int)) (or (not (<= .cse3 |v_ULTIMATE.start_main_~i~0#1_221|)) (forall ((v_ArrVal_379 Int) (v_ArrVal_375 Int) (v_ArrVal_370 Int) (v_subst_5 Int)) (or (< (+ v_subst_5 1) c_~N~0) (= .cse4 (mod (select (store (store (store .cse1 .cse2 v_ArrVal_370) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_375) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) v_ArrVal_379) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))))))))))) is different from false [2022-11-03 01:43:53,858 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (mod c_~N~0 2))) (let ((.cse8 (= .cse4 0)) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse3 (< c_~N~0 0)) (.cse7 (select .cse5 .cse6))) (and (or (let ((.cse0 (store .cse5 .cse6 (+ .cse7 1)))) (and (or (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (|v_ULTIMATE.start_main_~i~0#1_222| Int) (v_ArrVal_373 Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (v_subst_1 Int)) (or (< (select (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_222| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_373) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_374) (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_222|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_222| 1) |v_ULTIMATE.start_main_~i~0#1_221|)) (< (+ v_subst_1 1) c_~N~0))) (<= 0 c_~N~0)) (or (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (|v_ULTIMATE.start_main_~i~0#1_222| Int) (v_ArrVal_373 Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (v_subst_3 Int)) (let ((.cse2 (select (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_222| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_373) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_374) (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse2 0)) (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_222|)) (= (mod .cse2 2) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_222| 1) |v_ULTIMATE.start_main_~i~0#1_221|)) (< (+ v_subst_3 1) c_~N~0)))) .cse3) (forall ((|v_ULTIMATE.start_main_~i~0#1_222| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_221| Int)) (or (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_ArrVal_373 Int) (v_subst_4 Int)) (or (< (+ v_subst_4 1) c_~N~0) (= .cse4 (mod (select (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_222| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_373) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_374) (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_222| 1) |v_ULTIMATE.start_main_~i~0#1_221|)))) (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_222|)))))) .cse8) (or (not .cse8) (let ((.cse9 (store .cse5 .cse6 (+ 2 .cse7)))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_222| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_222|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_221| Int)) (or (forall ((v_ArrVal_379 Int) (v_ArrVal_375 Int) (v_ArrVal_370 Int) (v_subst_5 Int)) (or (< (+ v_subst_5 1) c_~N~0) (= (mod (select (store (store (store .cse9 (+ (* |v_ULTIMATE.start_main_~i~0#1_222| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_370) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_375) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) v_ArrVal_379) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) .cse4))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_222| 1) |v_ULTIMATE.start_main_~i~0#1_221|)))))) (or (forall ((v_ArrVal_379 Int) (v_ArrVal_375 Int) (|v_ULTIMATE.start_main_~i~0#1_222| Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (v_ArrVal_370 Int) (v_subst_2 Int)) (let ((.cse10 (select (store (store (store .cse9 (+ (* |v_ULTIMATE.start_main_~i~0#1_222| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_370) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_375) (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_379) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ v_subst_2 1) c_~N~0) (not (< .cse10 0)) (not (<= .cse1 |v_ULTIMATE.start_main_~i~0#1_222|)) (= (mod .cse10 2) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_222| 1) |v_ULTIMATE.start_main_~i~0#1_221|))))) .cse3))))))) is different from false [2022-11-03 01:44:50,105 WARN L234 SmtUtils]: Spent 46.52s on a formula simplification. DAG size of input: 114 DAG size of output: 101 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:45:14,793 WARN L234 SmtUtils]: Spent 22.17s on a formula simplification that was a NOOP. DAG size: 109 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:45:31,533 WARN L234 SmtUtils]: Spent 16.10s on a formula simplification that was a NOOP. DAG size: 122 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:45:50,710 WARN L234 SmtUtils]: Spent 16.11s on a formula simplification that was a NOOP. DAG size: 136 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:45:51,108 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 719 treesize of output 695 [2022-11-03 01:45:51,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52287 treesize of output 51983 [2022-11-03 01:45:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-03 01:45:58,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975311843] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:45:58,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1777636240] [2022-11-03 01:45:58,668 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-03 01:45:58,669 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:45:58,669 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:45:58,669 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:45:58,669 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:45:58,740 INFO L356 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-03 01:45:58,741 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:45:58,759 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 26 treesize of output 34 [2022-11-03 01:45:58,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-11-03 01:45:58,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:58,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:58,868 INFO L356 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2022-11-03 01:45:58,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 266 treesize of output 263 [2022-11-03 01:45:58,921 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 16 treesize of output 12 [2022-11-03 01:45:58,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-03 01:45:58,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-03 01:45:58,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:45:58,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:45:59,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:45:59,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:45:59,032 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:45:59,707 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2009#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem11#1|) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (= (ite (= (ite (and (< |ULTIMATE.start_main_#t~mem11#1| 0) (not (= (mod |ULTIMATE.start_main_#t~mem11#1| 2) 0))) (+ (mod |ULTIMATE.start_main_#t~mem11#1| 2) (- 2)) (mod |ULTIMATE.start_main_#t~mem11#1| 2)) (ite (and (not (= (mod ~N~0 2) 0)) (< ~N~0 0)) (+ (- 2) (mod ~N~0 2)) (mod ~N~0 2))) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-03 01:45:59,707 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:45:59,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:45:59,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 36 [2022-11-03 01:45:59,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920481672] [2022-11-03 01:45:59,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:45:59,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 01:45:59,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:45:59,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 01:45:59,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1156, Unknown=7, NotChecked=292, Total=1640 [2022-11-03 01:45:59,710 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:46:06,569 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (mod c_~N~0 2))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (= .cse5 0))) (let ((.cse9 (not .cse1)) (.cse7 (< c_~N~0 0)) (.cse4 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (select .cse2 0))) (and (<= .cse0 2) (<= c_~N~0 (* 2 (div c_~N~0 2))) (or .cse1 (and (or (<= 0 c_~N~0) (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_ArrVal_373 Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (v_subst_1 Int)) (or (< (select (store (store (store .cse2 .cse3 v_ArrVal_373) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_374) (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< (+ v_subst_1 1) c_~N~0) (not (<= .cse4 |v_ULTIMATE.start_main_~i~0#1_221|))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_221| Int)) (or (not (<= .cse4 |v_ULTIMATE.start_main_~i~0#1_221|)) (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_ArrVal_373 Int) (v_subst_4 Int)) (or (< (+ v_subst_4 1) c_~N~0) (= .cse5 (mod (select (store (store (store .cse2 .cse3 v_ArrVal_373) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_374) (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))))) (or (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_ArrVal_373 Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (v_subst_3 Int)) (let ((.cse6 (select (store (store (store .cse2 .cse3 v_ArrVal_373) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_374) (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse6 0)) (= (mod .cse6 2) 0) (not (<= .cse4 |v_ULTIMATE.start_main_~i~0#1_221|)) (< (+ v_subst_3 1) c_~N~0)))) .cse7))) (not (= .cse3 0)) (let ((.cse8 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (and .cse1 (= 2 .cse8)) (and .cse9 (= .cse8 1)))) (or .cse9 (and (or (forall ((v_ArrVal_379 Int) (v_ArrVal_375 Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (v_ArrVal_370 Int) (v_subst_2 Int)) (let ((.cse10 (select (store (store (store .cse2 .cse3 v_ArrVal_370) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_375) (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_379) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ v_subst_2 1) c_~N~0) (not (< .cse10 0)) (= (mod .cse10 2) 0) (not (<= .cse4 |v_ULTIMATE.start_main_~i~0#1_221|))))) .cse7) (forall ((|v_ULTIMATE.start_main_~i~0#1_221| Int)) (or (not (<= .cse4 |v_ULTIMATE.start_main_~i~0#1_221|)) (forall ((v_ArrVal_379 Int) (v_ArrVal_375 Int) (v_ArrVal_370 Int) (v_subst_5 Int)) (or (< (+ v_subst_5 1) c_~N~0) (= .cse5 (mod (select (store (store (store .cse2 .cse3 v_ArrVal_370) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_375) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) v_ArrVal_379) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))))))) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= 2 .cse0) (<= 4 c_~N~0) (<= (+ (div (- |c_ULTIMATE.start_main_~a~0#1.offset|) 4) 4) c_~N~0))))) is different from false [2022-11-03 01:46:08,135 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (mod c_~N~0 2))) (let ((.cse2 (= .cse8 0))) (let ((.cse4 (not .cse2)) (.cse7 (< c_~N~0 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or (<= (+ |c_ULTIMATE.start_main_~i~0#1| 4) c_~N~0) (let ((.cse0 (select .cse1 0))) (and (<= .cse0 2) (<= c_~N~0 (* 2 (div c_~N~0 2))) (<= 2 .cse0) (<= (+ (div (- |c_ULTIMATE.start_main_~a~0#1.offset|) 4) 4) c_~N~0)))) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (and .cse2 (= 2 .cse3)) (and .cse4 (= .cse3 1)))) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (or .cse4 (and (or (forall ((v_ArrVal_379 Int) (v_ArrVal_375 Int) (v_subst_2 Int)) (let ((.cse5 (select (store (store .cse1 .cse6 v_ArrVal_375) (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_379) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse5 0)) (< (+ v_subst_2 1) c_~N~0) (= (mod .cse5 2) 0)))) .cse7) (forall ((v_ArrVal_379 Int) (v_ArrVal_375 Int) (v_subst_5 Int)) (or (< (+ v_subst_5 1) c_~N~0) (= .cse8 (mod (select (store (store .cse1 .cse6 v_ArrVal_375) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) v_ArrVal_379) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))))) (or (and (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_subst_4 Int)) (or (< (+ v_subst_4 1) c_~N~0) (= .cse8 (mod (select (store (store .cse1 .cse6 v_ArrVal_374) (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))) (or (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_subst_3 Int)) (let ((.cse9 (select (store (store .cse1 .cse6 v_ArrVal_374) (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse9 0)) (= (mod .cse9 2) 0) (< (+ v_subst_3 1) c_~N~0)))) .cse7) (or (<= 0 c_~N~0) (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_subst_1 Int)) (or (< (+ v_subst_1 1) c_~N~0) (< (select (store (store .cse1 .cse6 v_ArrVal_374) (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) .cse2) (< 0 (+ c_~N~0 1)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= 4 c_~N~0))))) is different from false [2022-11-03 01:46:10,153 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (mod c_~N~0 2))) (let ((.cse0 (= .cse4 0))) (let ((.cse9 (not .cse0)) (.cse6 (< c_~N~0 0)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or .cse0 (and (or (<= 0 c_~N~0) (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_ArrVal_373 Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (v_subst_1 Int)) (or (< (select (store (store (store .cse1 .cse2 v_ArrVal_373) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_374) (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< (+ v_subst_1 1) c_~N~0) (not (<= .cse3 |v_ULTIMATE.start_main_~i~0#1_221|))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_221| Int)) (or (not (<= .cse3 |v_ULTIMATE.start_main_~i~0#1_221|)) (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_ArrVal_373 Int) (v_subst_4 Int)) (or (< (+ v_subst_4 1) c_~N~0) (= .cse4 (mod (select (store (store (store .cse1 .cse2 v_ArrVal_373) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_374) (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))))) (or (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_ArrVal_373 Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (v_subst_3 Int)) (let ((.cse5 (select (store (store (store .cse1 .cse2 v_ArrVal_373) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_374) (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse5 0)) (= (mod .cse5 2) 0) (not (<= .cse3 |v_ULTIMATE.start_main_~i~0#1_221|)) (< (+ v_subst_3 1) c_~N~0)))) .cse6))) (or (<= (+ |c_ULTIMATE.start_main_~i~0#1| 4) c_~N~0) (let ((.cse7 (select .cse1 0))) (and (<= .cse7 2) (<= c_~N~0 (* 2 (div c_~N~0 2))) (<= 2 .cse7) (<= (+ (div (- |c_ULTIMATE.start_main_~a~0#1.offset|) 4) 4) c_~N~0)))) (let ((.cse8 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (and .cse0 (= 2 .cse8)) (and .cse9 (= .cse8 1)))) (or .cse9 (and (or (forall ((v_ArrVal_379 Int) (v_ArrVal_375 Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (v_ArrVal_370 Int) (v_subst_2 Int)) (let ((.cse10 (select (store (store (store .cse1 .cse2 v_ArrVal_370) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_375) (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_379) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ v_subst_2 1) c_~N~0) (not (< .cse10 0)) (= (mod .cse10 2) 0) (not (<= .cse3 |v_ULTIMATE.start_main_~i~0#1_221|))))) .cse6) (forall ((|v_ULTIMATE.start_main_~i~0#1_221| Int)) (or (not (<= .cse3 |v_ULTIMATE.start_main_~i~0#1_221|)) (forall ((v_ArrVal_379 Int) (v_ArrVal_375 Int) (v_ArrVal_370 Int) (v_subst_5 Int)) (or (< (+ v_subst_5 1) c_~N~0) (= .cse4 (mod (select (store (store (store .cse1 .cse2 v_ArrVal_370) (+ (* |v_ULTIMATE.start_main_~i~0#1_221| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_375) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) v_ArrVal_379) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))))))) (< 0 (+ c_~N~0 1)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= 4 c_~N~0))))) is different from false [2022-11-03 01:46:11,793 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~N~0 2))) (let ((.cse0 (= .cse1 0))) (let ((.cse4 (< c_~N~0 0)) (.cse6 (not .cse0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (or .cse0 (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_378 Int)) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (= .cse1 (mod (select (store .cse2 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))))) (or (<= (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (let ((.cse3 (select .cse2 0))) (and (<= .cse3 2) (not (= (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (* 2 (div c_~N~0 2)) c_~N~0) (<= 2 .cse3)))) (or (not .cse4) .cse0 (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_378 Int)) (or (< (select (store .cse2 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)))) (let ((.cse5 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (and .cse0 (= 2 .cse5)) (and .cse6 (= .cse5 1)))) (or (and (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_378 Int)) (let ((.cse7 (select (store .cse2 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (mod .cse7 2) 0) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (not (< .cse7 0))))) .cse0) (or .cse6 (forall ((v_ArrVal_379 Int) (|ULTIMATE.start_main_~i~0#1| Int)) (let ((.cse8 (select (store .cse2 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_379) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse8 0)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (= (mod .cse8 2) 0)))))) .cse4) (or .cse6 (forall ((v_ArrVal_379 Int) (|ULTIMATE.start_main_~i~0#1| Int)) (or (= .cse1 (mod (select (store .cse2 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_379) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)))) (< 0 (+ c_~N~0 1)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= 4 c_~N~0))))) is different from false [2022-11-03 01:46:13,108 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (mod c_~N~0 2))) (let ((.cse3 (= .cse8 0))) (let ((.cse5 (not .cse3)) (.cse7 (< c_~N~0 0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or (<= (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (let ((.cse0 (select .cse2 0))) (and (<= .cse0 2) (not (= .cse1 0)) (= (* 2 (div c_~N~0 2)) c_~N~0) (<= 2 .cse0)))) (let ((.cse4 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (and .cse3 (= 2 .cse4)) (and .cse5 (= .cse4 1)))) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (or .cse5 (and (or (forall ((v_ArrVal_379 Int) (v_ArrVal_375 Int) (v_subst_2 Int)) (let ((.cse6 (select (store (store .cse2 .cse1 v_ArrVal_375) (+ (* 4 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_379) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse6 0)) (< (+ v_subst_2 1) c_~N~0) (= (mod .cse6 2) 0)))) .cse7) (forall ((v_ArrVal_379 Int) (v_ArrVal_375 Int) (v_subst_5 Int)) (or (< (+ v_subst_5 1) c_~N~0) (= .cse8 (mod (select (store (store .cse2 .cse1 v_ArrVal_375) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5)) v_ArrVal_379) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))))) (or (and (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_subst_4 Int)) (or (< (+ v_subst_4 1) c_~N~0) (= .cse8 (mod (select (store (store .cse2 .cse1 v_ArrVal_374) (+ (* 4 v_subst_4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))) (or (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_subst_3 Int)) (let ((.cse9 (select (store (store .cse2 .cse1 v_ArrVal_374) (+ (* 4 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse9 0)) (= (mod .cse9 2) 0) (< (+ v_subst_3 1) c_~N~0)))) .cse7) (or (<= 0 c_~N~0) (forall ((v_ArrVal_378 Int) (v_ArrVal_374 Int) (v_subst_1 Int)) (or (< (+ v_subst_1 1) c_~N~0) (< (select (store (store .cse2 .cse1 v_ArrVal_374) (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) .cse3) (< 0 (+ c_~N~0 1)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= 4 c_~N~0))))) is different from false [2022-11-03 01:46:14,906 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~N~0 2))) (let ((.cse0 (= .cse1 0))) (let ((.cse3 (< c_~N~0 0)) (.cse5 (not .cse0)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (or .cse0 (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_378 Int)) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (= .cse1 (mod (select (store .cse2 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))))) (or (not .cse3) .cse0 (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_378 Int)) (or (< (select (store .cse2 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)))) (let ((.cse4 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (and .cse0 (= 2 .cse4)) (and .cse5 (= .cse4 1)))) (or (and (or (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_378 Int)) (let ((.cse6 (select (store .cse2 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_378) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (mod .cse6 2) 0) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (not (< .cse6 0))))) .cse0) (or .cse5 (forall ((v_ArrVal_379 Int) (|ULTIMATE.start_main_~i~0#1| Int)) (let ((.cse7 (select (store .cse2 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_379) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse7 0)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (= (mod .cse7 2) 0)))))) .cse3) (or .cse5 (forall ((v_ArrVal_379 Int) (|ULTIMATE.start_main_~i~0#1| Int)) (or (= .cse1 (mod (select (store .cse2 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_379) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)))) (or (let ((.cse8 (select .cse2 0))) (and (<= .cse8 2) (= (* 2 (div c_~N~0 2)) c_~N~0) (<= 2 .cse8))) (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (< 0 (+ c_~N~0 1)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= 4 c_~N~0))))) is different from false [2022-11-03 01:46:23,502 WARN L234 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 122 DAG size of output: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:46:29,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:46:29,879 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2022-11-03 01:46:29,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-11-03 01:46:29,880 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:46:29,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:46:29,881 INFO L225 Difference]: With dead ends: 91 [2022-11-03 01:46:29,881 INFO L226 Difference]: Without dead ends: 89 [2022-11-03 01:46:29,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1164 ImplicationChecksByTransitivity, 152.4s TimeCoverageRelationStatistics Valid=617, Invalid=3832, Unknown=13, NotChecked=1390, Total=5852 [2022-11-03 01:46:29,883 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 74 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:46:29,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 142 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 244 Invalid, 0 Unknown, 211 Unchecked, 0.3s Time] [2022-11-03 01:46:29,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-03 01:46:29,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 36. [2022-11-03 01:46:29,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:46:29,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-11-03 01:46:29,914 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 15 [2022-11-03 01:46:29,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:46:29,914 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-11-03 01:46:29,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:46:29,915 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-11-03 01:46:29,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 01:46:29,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:46:29,916 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:46:29,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 01:46:30,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 01:46:30,117 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:46:30,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:46:30,117 INFO L85 PathProgramCache]: Analyzing trace with hash -798811303, now seen corresponding path program 9 times [2022-11-03 01:46:30,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:46:30,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706214050] [2022-11-03 01:46:30,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:30,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:46:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:30,343 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:46:30,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:46:30,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706214050] [2022-11-03 01:46:30,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706214050] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:46:30,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885342149] [2022-11-03 01:46:30,345 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:46:30,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:30,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:46:30,350 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:46:30,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 01:46:30,527 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:46:30,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:46:30,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 01:46:30,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:30,687 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:46:30,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:46:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:46:30,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885342149] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:46:30,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1716847451] [2022-11-03 01:46:30,810 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-03 01:46:30,811 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:46:30,811 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:46:30,811 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:46:30,811 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:46:30,874 INFO L356 Elim1Store]: treesize reduction 42, result has 40.0 percent of original size [2022-11-03 01:46:30,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2022-11-03 01:46:30,932 INFO L356 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-03 01:46:30,932 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:46:30,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-11-03 01:46:31,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:31,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:31,035 INFO L356 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2022-11-03 01:46:31,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 266 treesize of output 263 [2022-11-03 01:46:31,091 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 16 treesize of output 12 [2022-11-03 01:46:31,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-03 01:46:31,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-03 01:46:31,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:46:31,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:46:31,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:46:31,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2022-11-03 01:46:31,196 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:46:31,630 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2399#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem11#1|) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (= (ite (= (ite (and (< |ULTIMATE.start_main_#t~mem11#1| 0) (not (= (mod |ULTIMATE.start_main_#t~mem11#1| 2) 0))) (+ (mod |ULTIMATE.start_main_#t~mem11#1| 2) (- 2)) (mod |ULTIMATE.start_main_#t~mem11#1| 2)) (ite (and (not (= (mod ~N~0 2) 0)) (< ~N~0 0)) (+ (- 2) (mod ~N~0 2)) (mod ~N~0 2))) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-03 01:46:31,631 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:46:31,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:46:31,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2022-11-03 01:46:31,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221313155] [2022-11-03 01:46:31,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:46:31,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 01:46:31,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:46:31,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 01:46:31,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2022-11-03 01:46:31,634 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:46:32,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:46:32,153 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2022-11-03 01:46:32,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 01:46:32,154 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 01:46:32,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:46:32,155 INFO L225 Difference]: With dead ends: 127 [2022-11-03 01:46:32,155 INFO L226 Difference]: Without dead ends: 111 [2022-11-03 01:46:32,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=364, Invalid=1358, Unknown=0, NotChecked=0, Total=1722 [2022-11-03 01:46:32,157 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 171 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:46:32,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 99 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:46:32,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-03 01:46:32,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 60. [2022-11-03 01:46:32,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 59 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:46:32,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2022-11-03 01:46:32,197 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 17 [2022-11-03 01:46:32,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:46:32,197 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2022-11-03 01:46:32,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:46:32,198 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2022-11-03 01:46:32,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 01:46:32,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:46:32,199 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-03 01:46:32,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 01:46:32,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:32,401 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:46:32,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:46:32,401 INFO L85 PathProgramCache]: Analyzing trace with hash -690807384, now seen corresponding path program 2 times [2022-11-03 01:46:32,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:46:32,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96257735] [2022-11-03 01:46:32,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:32,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:46:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:34,468 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:46:34,468 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:46:34,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96257735] [2022-11-03 01:46:34,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96257735] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:46:34,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908960508] [2022-11-03 01:46:34,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:46:34,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:34,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:46:34,470 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:46:34,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1055433a-fff0-475d-99aa-b7ae8aa349c7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 01:46:34,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 01:46:34,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:46:34,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-03 01:46:34,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:34,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:46:34,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:34,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-11-03 01:46:34,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:34,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:46:34,841 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:34,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:34,846 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:46:34,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 108 [2022-11-03 01:46:34,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:34,885 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:34,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 39 [2022-11-03 01:46:34,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:34,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:34,964 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:46:34,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 91 [2022-11-03 01:46:34,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 30 [2022-11-03 01:46:34,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:34,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-03 01:46:35,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:35,191 INFO L356 Elim1Store]: treesize reduction 68, result has 53.1 percent of original size [2022-11-03 01:46:35,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 87 treesize of output 143 [2022-11-03 01:46:35,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:46:35,282 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:46:35,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 52 [2022-11-03 01:46:35,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:46:35,829 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:46:35,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 80 [2022-11-03 01:46:35,865 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:46:35,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:47:04,427 WARN L234 SmtUtils]: Spent 24.17s on a formula simplification. DAG size of input: 76 DAG size of output: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:47:21,080 WARN L234 SmtUtils]: Spent 12.11s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:47:37,505 WARN L234 SmtUtils]: Spent 9.85s on a formula simplification that was a NOOP. DAG size: 117 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:47:52,062 WARN L234 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 117 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:48:06,726 WARN L234 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 123 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:48:29,050 WARN L234 SmtUtils]: Spent 15.59s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:48:29,179 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 592 treesize of output 560 [2022-11-03 01:48:29,505 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-03 01:48:29,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43769282 treesize of output 42348510