./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops-crafted-1/iftelse.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/iftelse.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur --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 a98f1431f10d7e60a67a648eec648b7f5eb5616fa0d511e794bbda916609379b --- 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-38b53e6 [2022-11-26 00:23:04,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:23:04,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:23:04,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:23:04,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:23:04,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:23:04,714 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:23:04,717 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:23:04,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:23:04,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:23:04,726 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:23:04,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:23:04,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:23:04,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:23:04,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:23:04,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:23:04,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:23:04,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:23:04,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:23:04,745 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:23:04,747 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:23:04,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:23:04,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:23:04,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:23:04,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:23:04,764 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:23:04,764 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:23:04,765 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:23:04,767 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:23:04,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:23:04,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:23:04,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:23:04,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:23:04,771 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:23:04,773 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:23:04,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:23:04,774 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:23:04,775 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:23:04,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:23:04,776 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:23:04,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:23:04,779 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-26 00:23:04,805 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:23:04,805 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:23:04,805 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:23:04,805 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:23:04,806 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:23:04,806 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:23:04,806 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:23:04,807 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:23:04,807 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:23:04,807 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:23:04,807 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:23:04,807 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:23:04,807 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:23:04,808 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:23:04,808 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:23:04,808 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:23:04,808 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:23:04,808 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:23:04,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:23:04,809 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:23:04,809 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:23:04,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:23:04,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:23:04,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:23:04,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:23:04,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:23:04,810 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:23:04,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:23:04,811 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:23:04,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:23:04,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:23:04,811 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:23:04,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:23:04,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:23:04,811 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:23:04,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:23:04,812 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:23:04,812 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:23:04,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:23:04,812 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:23:04,812 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:23:04,812 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_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/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_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur 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 -> a98f1431f10d7e60a67a648eec648b7f5eb5616fa0d511e794bbda916609379b [2022-11-26 00:23:05,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:23:05,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:23:05,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:23:05,201 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:23:05,201 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:23:05,203 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/loops-crafted-1/iftelse.c [2022-11-26 00:23:08,323 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:23:08,542 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:23:08,542 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/sv-benchmarks/c/loops-crafted-1/iftelse.c [2022-11-26 00:23:08,548 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/data/603147d4d/bb013e31ed1545948c0ba84191b50330/FLAG12c94521a [2022-11-26 00:23:08,562 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/data/603147d4d/bb013e31ed1545948c0ba84191b50330 [2022-11-26 00:23:08,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:23:08,567 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:23:08,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:23:08,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:23:08,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:23:08,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:23:08" (1/1) ... [2022-11-26 00:23:08,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b37cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08, skipping insertion in model container [2022-11-26 00:23:08,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:23:08" (1/1) ... [2022-11-26 00:23:08,587 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:23:08,628 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:23:08,805 WARN L237 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_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/sv-benchmarks/c/loops-crafted-1/iftelse.c[406,419] [2022-11-26 00:23:08,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:23:08,828 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:23:08,839 WARN L237 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_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/sv-benchmarks/c/loops-crafted-1/iftelse.c[406,419] [2022-11-26 00:23:08,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:23:08,856 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:23:08,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08 WrapperNode [2022-11-26 00:23:08,857 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:23:08,858 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:23:08,858 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:23:08,858 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:23:08,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08" (1/1) ... [2022-11-26 00:23:08,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08" (1/1) ... [2022-11-26 00:23:08,893 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2022-11-26 00:23:08,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:23:08,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:23:08,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:23:08,894 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:23:08,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08" (1/1) ... [2022-11-26 00:23:08,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08" (1/1) ... [2022-11-26 00:23:08,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08" (1/1) ... [2022-11-26 00:23:08,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08" (1/1) ... [2022-11-26 00:23:08,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08" (1/1) ... [2022-11-26 00:23:08,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08" (1/1) ... [2022-11-26 00:23:08,922 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08" (1/1) ... [2022-11-26 00:23:08,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08" (1/1) ... [2022-11-26 00:23:08,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:23:08,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:23:08,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:23:08,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:23:08,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08" (1/1) ... [2022-11-26 00:23:08,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:23:08,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:23:08,960 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:23:08,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:23:09,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:23:09,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:23:09,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:23:09,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:23:09,079 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:23:09,081 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:23:09,258 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:23:09,297 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:23:09,298 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-26 00:23:09,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:23:09 BoogieIcfgContainer [2022-11-26 00:23:09,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:23:09,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:23:09,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:23:09,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:23:09,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:23:08" (1/3) ... [2022-11-26 00:23:09,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c295b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:23:09, skipping insertion in model container [2022-11-26 00:23:09,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:23:08" (2/3) ... [2022-11-26 00:23:09,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c295b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:23:09, skipping insertion in model container [2022-11-26 00:23:09,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:23:09" (3/3) ... [2022-11-26 00:23:09,310 INFO L112 eAbstractionObserver]: Analyzing ICFG iftelse.c [2022-11-26 00:23:09,330 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:23:09,331 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-26 00:23:09,398 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:23:09,406 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;@4a264d6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:23:09,406 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-26 00:23:09,411 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 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-26 00:23:09,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:23:09,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:23:09,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:23:09,419 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:23:09,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:23:09,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2053854816, now seen corresponding path program 1 times [2022-11-26 00:23:09,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:23:09,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056903588] [2022-11-26 00:23:09,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:23:09,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:23:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:23:10,303 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-26 00:23:10,304 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:23:10,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056903588] [2022-11-26 00:23:10,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056903588] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:23:10,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:23:10,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 00:23:10,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451207815] [2022-11-26 00:23:10,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:23:10,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:23:10,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:23:10,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:23:10,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:23:10,366 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 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) Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:10,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:23:10,623 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-11-26 00:23:10,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:23:10,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-26 00:23:10,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:23:10,633 INFO L225 Difference]: With dead ends: 34 [2022-11-26 00:23:10,633 INFO L226 Difference]: Without dead ends: 16 [2022-11-26 00:23:10,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:23:10,641 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:23:10,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 25 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:23:10,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-11-26 00:23:10,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2022-11-26 00:23:10,680 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-26 00:23:10,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2022-11-26 00:23:10,683 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 6 [2022-11-26 00:23:10,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:23:10,684 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2022-11-26 00:23:10,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:10,684 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2022-11-26 00:23:10,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 00:23:10,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:23:10,685 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-26 00:23:10,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:23:10,687 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:23:10,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:23:10,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1943194834, now seen corresponding path program 1 times [2022-11-26 00:23:10,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:23:10,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315830047] [2022-11-26 00:23:10,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:23:10,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:23:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:23:10,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:23:10,758 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:23:10,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315830047] [2022-11-26 00:23:10,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315830047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:23:10,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:23:10,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:23:10,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838892852] [2022-11-26 00:23:10,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:23:10,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:23:10,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:23:10,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:23:10,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:23:10,765 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-26 00:23:10,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:23:10,788 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-11-26 00:23:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:23:10,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-26 00:23:10,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:23:10,790 INFO L225 Difference]: With dead ends: 18 [2022-11-26 00:23:10,790 INFO L226 Difference]: Without dead ends: 11 [2022-11-26 00:23:10,795 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-26 00:23:10,798 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:23:10,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:23:10,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-11-26 00:23:10,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-11-26 00:23:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:10,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-11-26 00:23:10,814 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2022-11-26 00:23:10,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:23:10,815 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-11-26 00:23:10,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-26 00:23:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-11-26 00:23:10,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 00:23:10,818 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:23:10,818 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-11-26 00:23:10,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:23:10,819 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:23:10,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:23:10,820 INFO L85 PathProgramCache]: Analyzing trace with hash -86268312, now seen corresponding path program 1 times [2022-11-26 00:23:10,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:23:10,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597845665] [2022-11-26 00:23:10,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:23:10,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:23:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:23:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:23:11,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:23:11,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597845665] [2022-11-26 00:23:11,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597845665] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:23:11,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232407026] [2022-11-26 00:23:11,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:23:11,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:23:11,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:23:11,537 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:23:11,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:23:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:23:11,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-26 00:23:11,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:23:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:23:11,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:23:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:23:12,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232407026] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:23:12,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1546828422] [2022-11-26 00:23:12,585 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-26 00:23:12,586 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:23:12,592 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:23:12,600 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:23:12,600 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:23:13,086 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:23:13,716 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '191#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 3 |ULTIMATE.start_main_~i~0#1|) (= ~SIZE~0 20000001) (<= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 1) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-26 00:23:13,716 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:23:13,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:23:13,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-11-26 00:23:13,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547141642] [2022-11-26 00:23:13,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:23:13,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:23:13,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:23:13,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:23:13,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-11-26 00:23:13,718 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 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-26 00:23:16,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:23:16,963 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-11-26 00:23:16,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-26 00:23:16,964 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 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-26 00:23:16,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:23:16,964 INFO L225 Difference]: With dead ends: 32 [2022-11-26 00:23:16,964 INFO L226 Difference]: Without dead ends: 30 [2022-11-26 00:23:16,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2022-11-26 00:23:16,966 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 44 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:23:16,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 30 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-26 00:23:16,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-26 00:23:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-11-26 00:23:16,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:23:16,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-11-26 00:23:16,980 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 10 [2022-11-26 00:23:16,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:23:16,980 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-11-26 00:23:16,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 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-26 00:23:16,980 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-11-26 00:23:16,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-26 00:23:16,981 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:23:16,981 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2022-11-26 00:23:16,988 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 00:23:17,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-26 00:23:17,187 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:23:17,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:23:17,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1160302200, now seen corresponding path program 2 times [2022-11-26 00:23:17,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:23:17,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071872801] [2022-11-26 00:23:17,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:23:17,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:23:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:23:18,505 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:23:18,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:23:18,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071872801] [2022-11-26 00:23:18,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071872801] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:23:18,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144117938] [2022-11-26 00:23:18,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:23:18,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:23:18,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:23:18,511 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:23:18,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:23:33,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-26 00:23:33,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:23:33,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-26 00:23:33,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:23:33,869 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:23:33,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:24:09,280 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 49 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:24:09,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144117938] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:24:09,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [664582418] [2022-11-26 00:24:09,283 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-26 00:24:09,283 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:24:09,283 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:24:09,283 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:24:09,283 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:24:09,555 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:24:11,778 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '469#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 3 |ULTIMATE.start_main_~i~0#1|) (= ~SIZE~0 20000001) (<= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 1) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-26 00:24:11,779 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:24:11,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:24:11,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 29 [2022-11-26 00:24:11,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607868721] [2022-11-26 00:24:11,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:24:11,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-26 00:24:11,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:24:11,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-26 00:24:11,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=953, Unknown=4, NotChecked=0, Total=1190 [2022-11-26 00:24:11,782 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 29 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 29 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:24:14,422 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse21 (mod (+ 3 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse19 (mod (+ 9 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse6 (= (mod (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 2) 4294967296) 0)) (.cse23 (mod (+ 6 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse8 (mod (+ 12 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse9 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse16 (mod (+ 15 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse0 (not (< (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) .cse9))) (.cse14 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 9) 4294967296) 4294967296)) (.cse15 (+ |c_ULTIMATE.start_main_~j~0#1| 10)) (.cse18 (mod (div .cse8 2) 4294967296)) (.cse7 (div |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse3 (div |c_ULTIMATE.start_main_~j~0#1| 4294967296)) (.cse20 (mod (div .cse23 2) 4294967296)) (.cse4 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296) 4294967296)) (.cse5 (+ |c_ULTIMATE.start_main_~j~0#1| 4)) (.cse1 (not .cse6)) (.cse12 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 6) 4294967296) 4294967296)) (.cse17 (mod (div .cse19 2) 4294967296)) (.cse13 (+ 7 |c_ULTIMATE.start_main_~j~0#1|)) (.cse2 (mod (div .cse21 2) 4294967296))) (and (or .cse0 (and (or .cse1 (< (+ .cse2 (* 4294967296 .cse3)) (+ |c_ULTIMATE.start_main_~j~0#1| 1))) (or (< (+ .cse4 .cse2) .cse5) .cse6))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (not (<= (+ .cse7 1) 0)) (or (not (< .cse8 .cse9)) (let ((.cse10 (- .cse17)) (.cse11 (mod (div .cse16 2) 4294967296))) (and (or (< (+ 4294967292 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 3 .cse10) 4294967296) 4294967296)) |c_ULTIMATE.start_main_~j~0#1|) .cse1 (< (+ .cse11 .cse12) .cse13)) (or (< (+ (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 6 .cse10) 4294967296) 4294967296) 4294967289) |c_ULTIMATE.start_main_~j~0#1|) (< (+ .cse11 .cse14) .cse15) .cse6)))) (or (not (< .cse16 .cse9)) .cse0 (< (+ 4294967289 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 6 (- .cse18)) 4294967296) 4294967296)) |c_ULTIMATE.start_main_~j~0#1|) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 18) 4294967296) 2) 4294967296) .cse14) .cse15)) (<= |c_ULTIMATE.start_main_~i~0#1| (* |c_ULTIMATE.start_main_~j~0#1| 2)) (or (not (< .cse19 .cse9)) (< (+ .cse12 .cse18) .cse13) (< (+ 4294967292 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 3 (- .cse20)) 4294967296) 4294967296)) |c_ULTIMATE.start_main_~j~0#1|)) (not (<= (+ (div (+ (div |c_ULTIMATE.start_main_~i~0#1| 2) (* (- 2147483648) .cse7)) 4294967296) 1) .cse3)) (or (not (< .cse21 .cse9)) (< (+ .cse4 .cse20) .cse5)) (= 20000001 c_~SIZE~0) (or (let ((.cse22 (- .cse2))) (and (or (< (+ (* (div (+ .cse22 |c_ULTIMATE.start_main_~j~0#1|) 4294967296) 4294967296) 4294967295) |c_ULTIMATE.start_main_~j~0#1|) (< (+ .cse4 .cse17) .cse5) .cse1) (or (< (+ 4294967292 (* (div (+ .cse22 |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296) 4294967296)) |c_ULTIMATE.start_main_~j~0#1|) (< (+ .cse12 .cse17) .cse13) .cse6))) (not (< .cse23 .cse9)))))) is different from false [2022-11-26 00:26:41,127 WARN L233 SmtUtils]: Spent 2.24m on a formula simplification. DAG size of input: 133 DAG size of output: 133 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:26:43,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:26:45,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:26:47,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:26:48,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:26:50,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:26:52,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:26:55,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:26:58,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:27:00,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:27:02,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:28:34,145 WARN L233 SmtUtils]: Spent 1.42m on a formula simplification. DAG size of input: 107 DAG size of output: 99 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:28:36,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:28:38,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:30:16,271 WARN L233 SmtUtils]: Spent 1.48m on a formula simplification. DAG size of input: 104 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:30:18,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:30:20,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:30:22,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:30:24,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:30:25,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:30:27,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:30:30,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:31:08,869 WARN L233 SmtUtils]: Spent 30.21s on a formula simplification. DAG size of input: 88 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:31:10,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:31:12,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:31:15,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:31:16,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:31:18,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:31:20,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:31:29,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:31:32,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:31:34,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:31:36,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:31:42,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:31:42,726 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-11-26 00:31:42,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-26 00:31:42,726 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 29 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-26 00:31:42,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:31:42,728 INFO L225 Difference]: With dead ends: 60 [2022-11-26 00:31:42,728 INFO L226 Difference]: Without dead ends: 58 [2022-11-26 00:31:42,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 407.0s TimeCoverageRelationStatistics Valid=489, Invalid=1948, Unknown=17, NotChecked=96, Total=2550 [2022-11-26 00:31:42,730 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 118 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 21 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 65.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:31:42,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 104 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 278 Invalid, 21 Unknown, 1 Unchecked, 65.1s Time] [2022-11-26 00:31:42,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-26 00:31:42,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2022-11-26 00:31:42,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 0 states have call successors, (0), 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-26 00:31:42,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2022-11-26 00:31:42,763 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 26 [2022-11-26 00:31:42,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:31:42,763 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2022-11-26 00:31:42,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 29 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:31:42,764 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-11-26 00:31:42,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-26 00:31:42,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:31:42,765 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1] [2022-11-26 00:31:42,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:31:42,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:31:42,974 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:31:42,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:31:42,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1086309632, now seen corresponding path program 3 times [2022-11-26 00:31:42,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:31:42,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508165255] [2022-11-26 00:31:42,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:31:42,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:31:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:31:47,150 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:31:47,151 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:31:47,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508165255] [2022-11-26 00:31:47,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508165255] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:31:47,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160286559] [2022-11-26 00:31:47,151 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:31:47,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:31:47,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:31:47,154 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:31:47,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5af852b2-21ef-4498-b0f8-0c23f2ab8e5f/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:31:48,216 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:31:48,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:31:48,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-26 00:31:48,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:31:49,374 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:31:49,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:32:47,160 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 298 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:47,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160286559] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:32:47,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1871042497] [2022-11-26 00:32:47,163 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-26 00:32:47,164 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:32:47,164 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:32:47,164 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:32:47,164 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:32:47,380 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:32:50,123 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1045#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 3 |ULTIMATE.start_main_~i~0#1|) (= ~SIZE~0 20000001) (<= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 1) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-26 00:32:50,123 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:32:50,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:32:50,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 21] total 52 [2022-11-26 00:32:50,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424484976] [2022-11-26 00:32:50,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:32:50,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-26 00:32:50,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:32:50,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-26 00:32:50,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=2620, Unknown=3, NotChecked=0, Total=3306 [2022-11-26 00:32:50,127 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand has 52 states, 52 states have (on average 3.019230769230769) internal successors, (157), 52 states have internal predecessors, (157), 0 states have call successors, (0), 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-26 00:32:53,083 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse20 (mod (div (mod (+ 3 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296))) (let ((.cse22 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| (- 4294967293)) 4294967296) 4294967296)) (.cse24 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 18) 4294967296) 4294967296)) (.cse25 (+ 19 |c_ULTIMATE.start_main_~j~0#1|)) (.cse14 (= (mod (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 2) 4294967296) 0)) (.cse1 (+ .cse20 (* 4294967296 (div |c_ULTIMATE.start_main_~j~0#1| 4294967296))))) (let ((.cse13 (mod (div (mod (+ 9 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse8 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 6) 4294967296) 4294967296)) (.cse9 (+ 7 |c_ULTIMATE.start_main_~j~0#1|)) (.cse17 (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 27) 4294967296) 2) 4294967296)) (.cse5 (< |c_ULTIMATE.start_main_~j~0#1| .cse1)) (.cse0 (not .cse14)) (.cse7 (mod (div (mod (+ 15 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse3 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 9) 4294967296) 4294967296)) (.cse4 (+ |c_ULTIMATE.start_main_~j~0#1| 10)) (.cse10 (mod (div (mod (+ 33 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse6 (< (+ (mod (div (mod (+ 36 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296) .cse24) .cse25)) (.cse11 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 15) 4294967296) 4294967296)) (.cse12 (+ |c_ULTIMATE.start_main_~j~0#1| 16)) (.cse15 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296) 4294967296)) (.cse21 (mod (div (mod (+ 6 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse16 (+ |c_ULTIMATE.start_main_~j~0#1| 4)) (.cse2 (mod (div (mod (+ 21 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse18 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 12) 4294967296) 4294967296)) (.cse19 (+ |c_ULTIMATE.start_main_~j~0#1| 13)) (.cse23 (mod (div (mod (+ 39 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse26 (< |c_ULTIMATE.start_main_~j~0#1| (+ .cse22 .cse20 4294967293)))) (and (or .cse0 (< .cse1 (+ |c_ULTIMATE.start_main_~j~0#1| 1))) (or (< (+ .cse2 .cse3) .cse4) .cse0) (or .cse5 .cse6 .cse0) (or .cse0 (< (+ .cse7 .cse8) .cse9)) (or (< (+ .cse10 .cse11) .cse12) .cse0) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (or (< (+ .cse8 .cse13) .cse9) .cse14) (or (< (+ .cse15 .cse13) .cse16) .cse0) (< (+ .cse8 (mod (div (mod (+ 12 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse9) (or (< (+ .cse17 .cse11) .cse12) .cse14) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 24) 4294967296) 2) 4294967296) .cse18) .cse19) (or (< (+ .cse17 .cse18) .cse19) .cse0) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 18) 4294967296) 2) 4294967296) .cse3) .cse4) (or (< (+ .cse15 .cse20) .cse16) .cse14) (or (< |c_ULTIMATE.start_main_~j~0#1| (+ .cse21 .cse22 4294967293)) .cse5 (< (+ .cse23 .cse24) .cse25) .cse0) (or (< (+ .cse7 .cse3) .cse4) .cse14) (or (< (+ .cse24 .cse10) .cse25) .cse14) (or .cse6 .cse14 .cse26) (< (+ (mod (div (mod (+ 30 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296) .cse11) .cse12) (< (+ .cse15 .cse21) .cse16) (or (< (+ .cse2 .cse18) .cse19) .cse14) (<= (mod (div (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2) 4294967296) (mod |c_ULTIMATE.start_main_~j~0#1| 4294967296)) (or (< (+ .cse23 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 21) 4294967296) 4294967296)) (+ |c_ULTIMATE.start_main_~j~0#1| 22)) .cse14 .cse26))))) is different from false [2022-11-26 00:32:55,256 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (= (mod (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 2) 4294967296) 0)) (.cse18 (mod (div (mod (+ 3 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296))) (let ((.cse8 (mod (div (mod (+ 9 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse6 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 6) 4294967296) 4294967296)) (.cse7 (+ 7 |c_ULTIMATE.start_main_~j~0#1|)) (.cse12 (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 27) 4294967296) 2) 4294967296)) (.cse1 (+ .cse18 (* 4294967296 (div |c_ULTIMATE.start_main_~j~0#1| 4294967296)))) (.cse0 (not .cse9)) (.cse19 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 18) 4294967296) 4294967296)) (.cse20 (+ 19 |c_ULTIMATE.start_main_~j~0#1|)) (.cse5 (mod (div (mod (+ 15 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse3 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 9) 4294967296) 4294967296)) (.cse4 (+ |c_ULTIMATE.start_main_~j~0#1| 10)) (.cse21 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse13 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 15) 4294967296) 4294967296)) (.cse14 (+ |c_ULTIMATE.start_main_~j~0#1| 16)) (.cse10 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296) 4294967296)) (.cse11 (+ |c_ULTIMATE.start_main_~j~0#1| 4)) (.cse2 (mod (div (mod (+ 21 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse15 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 12) 4294967296) 4294967296)) (.cse16 (+ |c_ULTIMATE.start_main_~j~0#1| 13))) (and (or .cse0 (< .cse1 (+ |c_ULTIMATE.start_main_~j~0#1| 1))) (or (< (+ .cse2 .cse3) .cse4) .cse0) (or .cse0 (< (+ .cse5 .cse6) .cse7)) (or (< (+ .cse6 .cse8) .cse7) .cse9) (or (< (+ .cse10 .cse8) .cse11) .cse0) (< (+ .cse6 (mod (div (mod (+ 12 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse7) (or (< (+ .cse12 .cse13) .cse14) .cse9) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 24) 4294967296) 2) 4294967296) .cse15) .cse16) (or (< (+ .cse12 .cse15) .cse16) .cse0) (or (let ((.cse17 (< (+ (mod (div (mod (+ 36 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296) .cse19) .cse20))) (and (or (< |c_ULTIMATE.start_main_~j~0#1| .cse1) .cse17 .cse0) (or .cse17 .cse9 (< |c_ULTIMATE.start_main_~j~0#1| (+ (* (div (+ |c_ULTIMATE.start_main_~j~0#1| (- 4294967293)) 4294967296) 4294967296) .cse18 4294967293))))) .cse21) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 18) 4294967296) 2) 4294967296) .cse3) .cse4) (or (< (+ .cse10 .cse18) .cse11) .cse9) (or (let ((.cse22 (mod (div (mod (+ 33 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296))) (and (or (< (+ .cse22 .cse13) .cse14) .cse0) (or (< (+ .cse19 .cse22) .cse20) .cse9))) .cse21) (or (< (+ .cse5 .cse3) .cse4) .cse9) (not .cse21) (< (+ (mod (div (mod (+ 30 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296) .cse13) .cse14) (< (+ .cse10 (mod (div (mod (+ 6 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse11) (or (< (+ .cse2 .cse15) .cse16) .cse9)))) is different from false [2022-11-26 00:32:57,274 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse20 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 18) 4294967296) 4294967296)) (.cse21 (+ 19 |c_ULTIMATE.start_main_~j~0#1|)) (.cse13 (= (mod (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 2) 4294967296) 0)) (.cse19 (mod (div (mod (+ 3 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296))) (let ((.cse1 (+ .cse19 (* 4294967296 (div |c_ULTIMATE.start_main_~j~0#1| 4294967296)))) (.cse12 (mod (div (mod (+ 9 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse7 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 6) 4294967296) 4294967296)) (.cse8 (+ 7 |c_ULTIMATE.start_main_~j~0#1|)) (.cse16 (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 27) 4294967296) 2) 4294967296)) (.cse0 (not .cse13)) (.cse6 (mod (div (mod (+ 15 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse3 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 9) 4294967296) 4294967296)) (.cse4 (+ |c_ULTIMATE.start_main_~j~0#1| 10)) (.cse9 (mod (div (mod (+ 33 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse5 (< (+ (mod (div (mod (+ 36 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296) .cse20) .cse21)) (.cse10 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 15) 4294967296) 4294967296)) (.cse11 (+ |c_ULTIMATE.start_main_~j~0#1| 16)) (.cse14 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296) 4294967296)) (.cse15 (+ |c_ULTIMATE.start_main_~j~0#1| 4)) (.cse2 (mod (div (mod (+ 21 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse17 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 12) 4294967296) 4294967296)) (.cse18 (+ |c_ULTIMATE.start_main_~j~0#1| 13))) (and (or .cse0 (< .cse1 (+ |c_ULTIMATE.start_main_~j~0#1| 1))) (or (< (+ .cse2 .cse3) .cse4) .cse0) (or (< |c_ULTIMATE.start_main_~j~0#1| .cse1) .cse5 .cse0) (or .cse0 (< (+ .cse6 .cse7) .cse8)) (or (< (+ .cse9 .cse10) .cse11) .cse0) (or (< (+ .cse7 .cse12) .cse8) .cse13) (or (< (+ .cse14 .cse12) .cse15) .cse0) (< (+ .cse7 (mod (div (mod (+ 12 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse8) (or (< (+ .cse16 .cse10) .cse11) .cse13) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 24) 4294967296) 2) 4294967296) .cse17) .cse18) (or (< (+ .cse16 .cse17) .cse18) .cse0) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 18) 4294967296) 2) 4294967296) .cse3) .cse4) (or (< (+ .cse14 .cse19) .cse15) .cse13) (or (< (+ .cse6 .cse3) .cse4) .cse13) (or (< (+ .cse20 .cse9) .cse21) .cse13) (or .cse5 .cse13 (< |c_ULTIMATE.start_main_~j~0#1| (+ (* (div (+ |c_ULTIMATE.start_main_~j~0#1| (- 4294967293)) 4294967296) 4294967296) .cse19 4294967293))) (< (+ (mod (div (mod (+ 30 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296) .cse10) .cse11) (< (+ .cse14 (mod (div (mod (+ 6 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse15) (or (< (+ .cse2 .cse17) .cse18) .cse13)))) is different from false [2022-11-26 00:32:59,320 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (= (mod (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 2) 4294967296) 0))) (let ((.cse14 (mod (div (mod (+ 9 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse6 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 6) 4294967296) 4294967296)) (.cse7 (+ 7 |c_ULTIMATE.start_main_~j~0#1|)) (.cse17 (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 27) 4294967296) 2) 4294967296)) (.cse0 (not .cse11)) (.cse1 (mod (div (mod (+ 3 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse5 (mod (div (mod (+ 15 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse3 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 9) 4294967296) 4294967296)) (.cse4 (+ |c_ULTIMATE.start_main_~j~0#1| 10)) (.cse9 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 15) 4294967296) 4294967296)) (.cse10 (+ |c_ULTIMATE.start_main_~j~0#1| 16)) (.cse15 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296) 4294967296)) (.cse16 (+ |c_ULTIMATE.start_main_~j~0#1| 4)) (.cse2 (mod (div (mod (+ 21 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse18 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 12) 4294967296) 4294967296)) (.cse19 (+ |c_ULTIMATE.start_main_~j~0#1| 13)) (.cse13 (mod (div (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2) 4294967296)) (.cse12 (mod |c_ULTIMATE.start_main_~j~0#1| 4294967296))) (and (or .cse0 (< (+ .cse1 (* 4294967296 (div |c_ULTIMATE.start_main_~j~0#1| 4294967296))) (+ |c_ULTIMATE.start_main_~j~0#1| 1))) (or (< (+ .cse2 .cse3) .cse4) .cse0) (or .cse0 (< (+ .cse5 .cse6) .cse7)) (or (let ((.cse8 (mod (div (mod (+ 33 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296))) (and (or (< (+ .cse8 .cse9) .cse10) .cse0) (or (< (+ (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 18) 4294967296) 4294967296) .cse8) (+ 19 |c_ULTIMATE.start_main_~j~0#1|)) .cse11))) (< .cse12 .cse13)) (or (< (+ .cse6 .cse14) .cse7) .cse11) (or (< (+ .cse15 .cse14) .cse16) .cse0) (< (+ .cse6 (mod (div (mod (+ 12 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse7) (or (< (+ .cse17 .cse9) .cse10) .cse11) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 24) 4294967296) 2) 4294967296) .cse18) .cse19) (or (< (+ .cse17 .cse18) .cse19) .cse0) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 18) 4294967296) 2) 4294967296) .cse3) .cse4) (or (< (+ .cse15 .cse1) .cse16) .cse11) (or (< (+ .cse5 .cse3) .cse4) .cse11) (< (+ (mod (div (mod (+ 30 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296) .cse9) .cse10) (< (+ .cse15 (mod (div (mod (+ 6 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse16) (or (< (+ .cse2 .cse18) .cse19) .cse11) (<= .cse13 .cse12)))) is different from false [2022-11-26 00:33:01,341 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (= (mod (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 2) 4294967296) 0))) (let ((.cse8 (mod (div (mod (+ 9 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse6 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 6) 4294967296) 4294967296)) (.cse7 (+ 7 |c_ULTIMATE.start_main_~j~0#1|)) (.cse12 (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 27) 4294967296) 2) 4294967296)) (.cse1 (mod (div (mod (+ 3 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse0 (not .cse9)) (.cse5 (mod (div (mod (+ 15 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse3 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 9) 4294967296) 4294967296)) (.cse4 (+ |c_ULTIMATE.start_main_~j~0#1| 10)) (.cse18 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (.cse13 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 15) 4294967296) 4294967296)) (.cse14 (+ |c_ULTIMATE.start_main_~j~0#1| 16)) (.cse10 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296) 4294967296)) (.cse11 (+ |c_ULTIMATE.start_main_~j~0#1| 4)) (.cse2 (mod (div (mod (+ 21 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse15 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 12) 4294967296) 4294967296)) (.cse16 (+ |c_ULTIMATE.start_main_~j~0#1| 13))) (and (or .cse0 (< (+ .cse1 (* 4294967296 (div |c_ULTIMATE.start_main_~j~0#1| 4294967296))) (+ |c_ULTIMATE.start_main_~j~0#1| 1))) (or (< (+ .cse2 .cse3) .cse4) .cse0) (or .cse0 (< (+ .cse5 .cse6) .cse7)) (or (< (+ .cse6 .cse8) .cse7) .cse9) (or (< (+ .cse10 .cse8) .cse11) .cse0) (< (+ .cse6 (mod (div (mod (+ 12 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse7) (or (< (+ .cse12 .cse13) .cse14) .cse9) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 24) 4294967296) 2) 4294967296) .cse15) .cse16) (or (< (+ .cse12 .cse15) .cse16) .cse0) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 18) 4294967296) 2) 4294967296) .cse3) .cse4) (or (< (+ .cse10 .cse1) .cse11) .cse9) (or (let ((.cse17 (mod (div (mod (+ 33 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296))) (and (or (< (+ .cse17 .cse13) .cse14) .cse0) (or (< (+ (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 18) 4294967296) 4294967296) .cse17) (+ 19 |c_ULTIMATE.start_main_~j~0#1|)) .cse9))) .cse18) (or (< (+ .cse5 .cse3) .cse4) .cse9) (not .cse18) (< (+ (mod (div (mod (+ 30 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296) .cse13) .cse14) (< (+ .cse10 (mod (div (mod (+ 6 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse11) (or (< (+ .cse2 .cse15) .cse16) .cse9)))) is different from false [2022-11-26 00:33:03,353 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (= (mod (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 2) 4294967296) 0))) (let ((.cse11 (mod (div (mod (+ 9 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse6 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 6) 4294967296) 4294967296)) (.cse7 (+ 7 |c_ULTIMATE.start_main_~j~0#1|)) (.cse15 (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 27) 4294967296) 2) 4294967296)) (.cse0 (not .cse12)) (.cse1 (mod (div (mod (+ 3 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse5 (mod (div (mod (+ 15 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse3 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 9) 4294967296) 4294967296)) (.cse4 (+ |c_ULTIMATE.start_main_~j~0#1| 10)) (.cse8 (mod (div (mod (+ 33 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse9 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 15) 4294967296) 4294967296)) (.cse10 (+ |c_ULTIMATE.start_main_~j~0#1| 16)) (.cse13 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296) 4294967296)) (.cse14 (+ |c_ULTIMATE.start_main_~j~0#1| 4)) (.cse2 (mod (div (mod (+ 21 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse16 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 12) 4294967296) 4294967296)) (.cse17 (+ |c_ULTIMATE.start_main_~j~0#1| 13))) (and (or .cse0 (< (+ .cse1 (* 4294967296 (div |c_ULTIMATE.start_main_~j~0#1| 4294967296))) (+ |c_ULTIMATE.start_main_~j~0#1| 1))) (or (< (+ .cse2 .cse3) .cse4) .cse0) (or .cse0 (< (+ .cse5 .cse6) .cse7)) (or (< (+ .cse8 .cse9) .cse10) .cse0) (or (< (+ .cse6 .cse11) .cse7) .cse12) (or (< (+ .cse13 .cse11) .cse14) .cse0) (< (+ .cse6 (mod (div (mod (+ 12 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse7) (or (< (+ .cse15 .cse9) .cse10) .cse12) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 24) 4294967296) 2) 4294967296) .cse16) .cse17) (or (< (+ .cse15 .cse16) .cse17) .cse0) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 18) 4294967296) 2) 4294967296) .cse3) .cse4) (or (< (+ .cse13 .cse1) .cse14) .cse12) (or (< (+ .cse5 .cse3) .cse4) .cse12) (or (< (+ (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 18) 4294967296) 4294967296) .cse8) (+ 19 |c_ULTIMATE.start_main_~j~0#1|)) .cse12) (< (+ (mod (div (mod (+ 30 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296) .cse9) .cse10) (< (+ .cse13 (mod (div (mod (+ 6 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse14) (or (< (+ .cse2 .cse16) .cse17) .cse12)))) is different from false [2022-11-26 00:33:05,377 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (= (mod (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 2) 4294967296) 0))) (let ((.cse8 (mod (div (mod (+ 9 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse6 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 6) 4294967296) 4294967296)) (.cse7 (+ 7 |c_ULTIMATE.start_main_~j~0#1|)) (.cse12 (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 27) 4294967296) 2) 4294967296)) (.cse0 (not .cse9)) (.cse1 (mod (div (mod (+ 3 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse5 (mod (div (mod (+ 15 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse3 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 9) 4294967296) 4294967296)) (.cse4 (+ |c_ULTIMATE.start_main_~j~0#1| 10)) (.cse13 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 15) 4294967296) 4294967296)) (.cse14 (+ |c_ULTIMATE.start_main_~j~0#1| 16)) (.cse10 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296) 4294967296)) (.cse11 (+ |c_ULTIMATE.start_main_~j~0#1| 4)) (.cse2 (mod (div (mod (+ 21 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse15 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 12) 4294967296) 4294967296)) (.cse16 (+ |c_ULTIMATE.start_main_~j~0#1| 13))) (and (or .cse0 (< (+ .cse1 (* 4294967296 (div |c_ULTIMATE.start_main_~j~0#1| 4294967296))) (+ |c_ULTIMATE.start_main_~j~0#1| 1))) (or (< (+ .cse2 .cse3) .cse4) .cse0) (or .cse0 (< (+ .cse5 .cse6) .cse7)) (or (< (+ .cse6 .cse8) .cse7) .cse9) (or (< (+ .cse10 .cse8) .cse11) .cse0) (< (+ .cse6 (mod (div (mod (+ 12 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse7) (or (< (+ .cse12 .cse13) .cse14) .cse9) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 24) 4294967296) 2) 4294967296) .cse15) .cse16) (or (< (+ .cse12 .cse15) .cse16) .cse0) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 18) 4294967296) 2) 4294967296) .cse3) .cse4) (or (< (+ .cse10 .cse1) .cse11) .cse9) (or (< (+ .cse5 .cse3) .cse4) .cse9) (< (+ (mod (div (mod (+ 30 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296) .cse13) .cse14) (< (+ .cse10 (mod (div (mod (+ 6 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse11) (or (< (+ .cse2 .cse15) .cse16) .cse9) (<= (mod (div (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2) 4294967296) (mod |c_ULTIMATE.start_main_~j~0#1| 4294967296))))) is different from false [2022-11-26 00:37:10,554 WARN L233 SmtUtils]: Spent 2.37m on a formula simplification that was a NOOP. DAG size: 133 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:37:12,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:37:14,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:37:16,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:37:18,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:37:20,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:37:22,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:37:24,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:37:26,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:37:28,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:37:30,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:37:32,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:37:34,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:37:36,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:37:38,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:37:40,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:37:42,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:37:44,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:37:46,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:37:48,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:37:50,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:37:52,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:37:54,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:37:56,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:37:58,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:38:00,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:38:02,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:38:04,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-26 00:38:06,778 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (= (mod (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 2) 4294967296) 0))) (let ((.cse8 (mod (div (mod (+ 9 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse6 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 6) 4294967296) 4294967296)) (.cse7 (+ 7 |c_ULTIMATE.start_main_~j~0#1|)) (.cse12 (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 27) 4294967296) 2) 4294967296)) (.cse0 (not .cse9)) (.cse1 (mod (div (mod (+ 3 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse5 (mod (div (mod (+ 15 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse3 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 9) 4294967296) 4294967296)) (.cse4 (+ |c_ULTIMATE.start_main_~j~0#1| 10)) (.cse10 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296) 4294967296)) (.cse11 (+ |c_ULTIMATE.start_main_~j~0#1| 4)) (.cse2 (mod (div (mod (+ 21 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse13 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 12) 4294967296) 4294967296)) (.cse14 (+ |c_ULTIMATE.start_main_~j~0#1| 13))) (and (or .cse0 (< (+ .cse1 (* 4294967296 (div |c_ULTIMATE.start_main_~j~0#1| 4294967296))) (+ |c_ULTIMATE.start_main_~j~0#1| 1))) (or (< (+ .cse2 .cse3) .cse4) .cse0) (or .cse0 (< (+ .cse5 .cse6) .cse7)) (or (< (+ .cse6 .cse8) .cse7) .cse9) (or (< (+ .cse10 .cse8) .cse11) .cse0) (< (+ .cse6 (mod (div (mod (+ 12 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse7) (or (< (+ .cse12 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 15) 4294967296) 4294967296)) (+ |c_ULTIMATE.start_main_~j~0#1| 16)) .cse9) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 24) 4294967296) 2) 4294967296) .cse13) .cse14) (or (< (+ .cse12 .cse13) .cse14) .cse0) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 18) 4294967296) 2) 4294967296) .cse3) .cse4) (or (< (+ .cse10 .cse1) .cse11) .cse9) (or (< (+ .cse5 .cse3) .cse4) .cse9) (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (< (+ .cse10 (mod (div (mod (+ 6 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse11) (or (< (+ .cse2 .cse13) .cse14) .cse9) (<= (mod (div (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2) 4294967296) (mod |c_ULTIMATE.start_main_~j~0#1| 4294967296))))) is different from false [2022-11-26 00:38:08,827 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (= (mod (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 2) 4294967296) 0))) (let ((.cse8 (mod (div (mod (+ 9 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse6 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 6) 4294967296) 4294967296)) (.cse7 (+ 7 |c_ULTIMATE.start_main_~j~0#1|)) (.cse12 (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 27) 4294967296) 2) 4294967296)) (.cse0 (not .cse9)) (.cse1 (mod (div (mod (+ 3 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse5 (mod (div (mod (+ 15 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse3 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 9) 4294967296) 4294967296)) (.cse4 (+ |c_ULTIMATE.start_main_~j~0#1| 10)) (.cse10 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296) 4294967296)) (.cse11 (+ |c_ULTIMATE.start_main_~j~0#1| 4)) (.cse2 (mod (div (mod (+ 21 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse13 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 12) 4294967296) 4294967296)) (.cse14 (+ |c_ULTIMATE.start_main_~j~0#1| 13))) (and (or .cse0 (< (+ .cse1 (* 4294967296 (div |c_ULTIMATE.start_main_~j~0#1| 4294967296))) (+ |c_ULTIMATE.start_main_~j~0#1| 1))) (or (< (+ .cse2 .cse3) .cse4) .cse0) (or .cse0 (< (+ .cse5 .cse6) .cse7)) (or (< (+ .cse6 .cse8) .cse7) .cse9) (or (< (+ .cse10 .cse8) .cse11) .cse0) (< (+ .cse6 (mod (div (mod (+ 12 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse7) (or (< (+ .cse12 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 15) 4294967296) 4294967296)) (+ |c_ULTIMATE.start_main_~j~0#1| 16)) .cse9) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 24) 4294967296) 2) 4294967296) .cse13) .cse14) (or (< (+ .cse12 .cse13) .cse14) .cse0) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 18) 4294967296) 2) 4294967296) .cse3) .cse4) (or (< (+ .cse10 .cse1) .cse11) .cse9) (or (< (+ .cse5 .cse3) .cse4) .cse9) (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (< (+ .cse10 (mod (div (mod (+ 6 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse11) (or (< (+ .cse2 .cse13) .cse14) .cse9)))) is different from false [2022-11-26 00:38:10,843 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (= (mod (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 2) 4294967296) 0))) (let ((.cse8 (mod (div (mod (+ 9 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse6 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 6) 4294967296) 4294967296)) (.cse7 (+ 7 |c_ULTIMATE.start_main_~j~0#1|)) (.cse12 (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 27) 4294967296) 2) 4294967296)) (.cse0 (not .cse9)) (.cse1 (mod (div (mod (+ 3 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse5 (mod (div (mod (+ 15 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse3 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 9) 4294967296) 4294967296)) (.cse4 (+ |c_ULTIMATE.start_main_~j~0#1| 10)) (.cse10 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296) 4294967296)) (.cse11 (+ |c_ULTIMATE.start_main_~j~0#1| 4)) (.cse2 (mod (div (mod (+ 21 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse13 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 12) 4294967296) 4294967296)) (.cse14 (+ |c_ULTIMATE.start_main_~j~0#1| 13))) (and (or .cse0 (< (+ .cse1 (* 4294967296 (div |c_ULTIMATE.start_main_~j~0#1| 4294967296))) (+ |c_ULTIMATE.start_main_~j~0#1| 1))) (or (< (+ .cse2 .cse3) .cse4) .cse0) (or .cse0 (< (+ .cse5 .cse6) .cse7)) (or (< (+ .cse6 .cse8) .cse7) .cse9) (or (< (+ .cse10 .cse8) .cse11) .cse0) (< (+ .cse6 (mod (div (mod (+ 12 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse7) (or (< (+ .cse12 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 15) 4294967296) 4294967296)) (+ |c_ULTIMATE.start_main_~j~0#1| 16)) .cse9) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 24) 4294967296) 2) 4294967296) .cse13) .cse14) (or (< (+ .cse12 .cse13) .cse14) .cse0) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 18) 4294967296) 2) 4294967296) .cse3) .cse4) (or (< (+ .cse10 .cse1) .cse11) .cse9) (or (< (+ .cse5 .cse3) .cse4) .cse9) (< (+ .cse10 (mod (div (mod (+ 6 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse11) (or (< (+ .cse2 .cse13) .cse14) .cse9)))) is different from false [2022-11-26 00:38:12,856 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (= (mod (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 2) 4294967296) 0))) (let ((.cse8 (mod (div (mod (+ 9 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse0 (not .cse9)) (.cse6 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 6) 4294967296) 4294967296)) (.cse7 (+ 7 |c_ULTIMATE.start_main_~j~0#1|)) (.cse1 (mod (div (mod (+ 3 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse5 (mod (div (mod (+ 15 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse3 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 9) 4294967296) 4294967296)) (.cse4 (+ |c_ULTIMATE.start_main_~j~0#1| 10)) (.cse10 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296) 4294967296)) (.cse11 (+ |c_ULTIMATE.start_main_~j~0#1| 4)) (.cse2 (mod (div (mod (+ 21 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse12 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 12) 4294967296) 4294967296)) (.cse13 (+ |c_ULTIMATE.start_main_~j~0#1| 13))) (and (or .cse0 (< (+ .cse1 (* 4294967296 (div |c_ULTIMATE.start_main_~j~0#1| 4294967296))) (+ |c_ULTIMATE.start_main_~j~0#1| 1))) (or (< (+ .cse2 .cse3) .cse4) .cse0) (or .cse0 (< (+ .cse5 .cse6) .cse7)) (or (< (+ .cse6 .cse8) .cse7) .cse9) (or (< (+ .cse10 .cse8) .cse11) .cse0) (< (+ .cse6 (mod (div (mod (+ 12 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse7) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 24) 4294967296) 2) 4294967296) .cse12) .cse13) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 18) 4294967296) 2) 4294967296) .cse3) .cse4) (or (< (+ .cse10 .cse1) .cse11) .cse9) (or (< (+ .cse5 .cse3) .cse4) .cse9) (< (+ .cse10 (mod (div (mod (+ 6 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse11) (or (< (+ .cse2 .cse12) .cse13) .cse9) (<= (mod (div (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2) 4294967296) (mod |c_ULTIMATE.start_main_~j~0#1| 4294967296))))) is different from false [2022-11-26 00:38:14,872 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (= (mod (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 2) 4294967296) 0))) (let ((.cse8 (mod (div (mod (+ 9 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse0 (not .cse9)) (.cse6 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 6) 4294967296) 4294967296)) (.cse7 (+ 7 |c_ULTIMATE.start_main_~j~0#1|)) (.cse1 (mod (div (mod (+ 3 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse5 (mod (div (mod (+ 15 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse3 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 9) 4294967296) 4294967296)) (.cse4 (+ |c_ULTIMATE.start_main_~j~0#1| 10)) (.cse10 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296) 4294967296)) (.cse11 (+ |c_ULTIMATE.start_main_~j~0#1| 4)) (.cse2 (mod (div (mod (+ 21 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse12 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 12) 4294967296) 4294967296)) (.cse13 (+ |c_ULTIMATE.start_main_~j~0#1| 13))) (and (or .cse0 (< (+ .cse1 (* 4294967296 (div |c_ULTIMATE.start_main_~j~0#1| 4294967296))) (+ |c_ULTIMATE.start_main_~j~0#1| 1))) (or (< (+ .cse2 .cse3) .cse4) .cse0) (or .cse0 (< (+ .cse5 .cse6) .cse7)) (or (< (+ .cse6 .cse8) .cse7) .cse9) (or (< (+ .cse10 .cse8) .cse11) .cse0) (< (+ .cse6 (mod (div (mod (+ 12 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse7) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 24) 4294967296) 2) 4294967296) .cse12) .cse13) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 18) 4294967296) 2) 4294967296) .cse3) .cse4) (or (< (+ .cse10 .cse1) .cse11) .cse9) (or (< (+ .cse5 .cse3) .cse4) .cse9) (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (< (+ .cse10 (mod (div (mod (+ 6 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse11) (or (< (+ .cse2 .cse12) .cse13) .cse9)))) is different from false [2022-11-26 00:38:16,884 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (= (mod (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 2) 4294967296) 0))) (let ((.cse8 (mod (div (mod (+ 9 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse0 (not .cse9)) (.cse6 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 6) 4294967296) 4294967296)) (.cse7 (+ 7 |c_ULTIMATE.start_main_~j~0#1|)) (.cse1 (mod (div (mod (+ 3 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse5 (mod (div (mod (+ 15 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse3 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 9) 4294967296) 4294967296)) (.cse4 (+ |c_ULTIMATE.start_main_~j~0#1| 10)) (.cse10 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296) 4294967296)) (.cse11 (+ |c_ULTIMATE.start_main_~j~0#1| 4)) (.cse2 (mod (div (mod (+ 21 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) (.cse12 (* (div (+ |c_ULTIMATE.start_main_~j~0#1| 12) 4294967296) 4294967296)) (.cse13 (+ |c_ULTIMATE.start_main_~j~0#1| 13))) (and (or .cse0 (< (+ .cse1 (* 4294967296 (div |c_ULTIMATE.start_main_~j~0#1| 4294967296))) (+ |c_ULTIMATE.start_main_~j~0#1| 1))) (or (< (+ .cse2 .cse3) .cse4) .cse0) (or .cse0 (< (+ .cse5 .cse6) .cse7)) (or (< (+ .cse6 .cse8) .cse7) .cse9) (or (< (+ .cse10 .cse8) .cse11) .cse0) (< (+ .cse6 (mod (div (mod (+ 12 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse7) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 24) 4294967296) 2) 4294967296) .cse12) .cse13) (< (+ (mod (div (mod (+ |c_ULTIMATE.start_main_~i~0#1| 18) 4294967296) 2) 4294967296) .cse3) .cse4) (or (< (+ .cse10 .cse1) .cse11) .cse9) (or (< (+ .cse5 .cse3) .cse4) .cse9) (< (+ .cse10 (mod (div (mod (+ 6 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2) 4294967296)) .cse11) (or (< (+ .cse2 .cse12) .cse13) .cse9)))) is different from false