./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops-crafted-1/mono-crafted_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/mono-crafted_8.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1972ee33272415a52c6f0d8a1f799e9d488ad771872c0cf36a214b07ea597fd --- 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-4e7fbc6 [2022-11-23 03:35:24,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:35:24,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:35:24,895 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:35:24,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:35:24,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:35:24,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:35:24,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:35:24,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:35:24,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:35:24,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:35:24,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:35:24,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:35:24,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:35:24,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:35:24,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:35:24,923 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:35:24,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:35:24,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:35:24,932 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:35:24,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:35:24,936 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:35:24,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:35:24,939 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:35:24,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:35:24,949 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:35:24,950 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:35:24,951 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:35:24,952 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:35:24,953 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:35:24,953 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:35:24,954 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:35:24,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:35:24,958 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:35:24,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:35:24,960 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:35:24,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:35:24,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:35:24,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:35:24,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:35:24,964 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:35:24,965 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 03:35:25,004 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:35:25,005 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:35:25,005 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:35:25,006 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:35:25,006 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:35:25,007 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:35:25,007 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:35:25,008 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:35:25,008 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:35:25,008 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:35:25,009 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:35:25,010 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:35:25,010 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:35:25,010 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:35:25,010 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 03:35:25,010 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:35:25,011 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 03:35:25,011 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:35:25,011 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 03:35:25,011 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:35:25,011 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 03:35:25,012 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:35:25,012 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:35:25,012 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:35:25,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:35:25,013 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:35:25,013 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:35:25,013 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 03:35:25,013 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:35:25,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 03:35:25,014 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:35:25,014 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 03:35:25,015 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:35:25,015 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:35:25,015 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/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_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS 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 -> Automizer 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 -> e1972ee33272415a52c6f0d8a1f799e9d488ad771872c0cf36a214b07ea597fd [2022-11-23 03:35:25,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:35:25,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:35:25,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:35:25,312 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:35:25,313 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:35:25,314 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/loops-crafted-1/mono-crafted_8.c [2022-11-23 03:35:28,509 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:35:28,688 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:35:28,688 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/sv-benchmarks/c/loops-crafted-1/mono-crafted_8.c [2022-11-23 03:35:28,694 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/data/099a2671d/f9d40d24a0cd40c489dd5ed0a56249a2/FLAGf60447b5d [2022-11-23 03:35:28,709 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/data/099a2671d/f9d40d24a0cd40c489dd5ed0a56249a2 [2022-11-23 03:35:28,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:35:28,713 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:35:28,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:35:28,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:35:28,719 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:35:28,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:35:28" (1/1) ... [2022-11-23 03:35:28,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@338a67f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:28, skipping insertion in model container [2022-11-23 03:35:28,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:35:28" (1/1) ... [2022-11-23 03:35:28,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:35:28,750 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:35:28,885 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_ec2e8e88-0b65-497b-881f-a48ce95b5948/sv-benchmarks/c/loops-crafted-1/mono-crafted_8.c[318,331] [2022-11-23 03:35:28,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:35:28,906 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:35:28,918 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_ec2e8e88-0b65-497b-881f-a48ce95b5948/sv-benchmarks/c/loops-crafted-1/mono-crafted_8.c[318,331] [2022-11-23 03:35:28,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:35:28,937 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:35:28,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:28 WrapperNode [2022-11-23 03:35:28,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:35:28,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:35:28,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:35:28,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:35:28,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:28" (1/1) ... [2022-11-23 03:35:28,950 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:28" (1/1) ... [2022-11-23 03:35:28,967 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2022-11-23 03:35:28,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:35:28,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:35:28,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:35:28,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:35:28,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:28" (1/1) ... [2022-11-23 03:35:28,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:28" (1/1) ... [2022-11-23 03:35:28,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:28" (1/1) ... [2022-11-23 03:35:28,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:28" (1/1) ... [2022-11-23 03:35:28,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:28" (1/1) ... [2022-11-23 03:35:28,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:28" (1/1) ... [2022-11-23 03:35:28,986 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:28" (1/1) ... [2022-11-23 03:35:28,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:28" (1/1) ... [2022-11-23 03:35:28,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:35:28,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:35:28,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:35:28,990 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:35:28,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:28" (1/1) ... [2022-11-23 03:35:28,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:35:29,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:35:29,020 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:35:29,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:35:29,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:35:29,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:35:29,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:35:29,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 03:35:29,144 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:35:29,147 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:35:29,338 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:35:29,344 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:35:29,348 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-23 03:35:29,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:35:29 BoogieIcfgContainer [2022-11-23 03:35:29,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:35:29,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:35:29,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:35:29,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:35:29,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:35:28" (1/3) ... [2022-11-23 03:35:29,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d42259a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:35:29, skipping insertion in model container [2022-11-23 03:35:29,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:35:28" (2/3) ... [2022-11-23 03:35:29,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d42259a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:35:29, skipping insertion in model container [2022-11-23 03:35:29,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:35:29" (3/3) ... [2022-11-23 03:35:29,364 INFO L112 eAbstractionObserver]: Analyzing ICFG mono-crafted_8.c [2022-11-23 03:35:29,388 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:35:29,389 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 03:35:29,456 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:35:29,464 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=PETRI_NET, 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;@748fcc72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:35:29,465 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 03:35:29,470 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:29,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 03:35:29,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:35:29,481 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 03:35:29,483 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:35:29,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:35:29,490 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2022-11-23 03:35:29,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:35:29,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812936588] [2022-11-23 03:35:29,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:35:29,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:35:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:35:29,681 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-23 03:35:29,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:35:29,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812936588] [2022-11-23 03:35:29,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812936588] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:35:29,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:35:29,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:35:29,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369853544] [2022-11-23 03:35:29,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:35:29,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 03:35:29,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:35:29,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 03:35:29,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 03:35:29,742 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:29,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:35:29,774 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-11-23 03:35:29,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 03:35:29,786 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-23 03:35:29,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:35:29,793 INFO L225 Difference]: With dead ends: 21 [2022-11-23 03:35:29,793 INFO L226 Difference]: Without dead ends: 9 [2022-11-23 03:35:29,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 03:35:29,803 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:35:29,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:35:29,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-11-23 03:35:29,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-11-23 03:35:29,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-11-23 03:35:29,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2022-11-23 03:35:29,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:35:29,842 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-11-23 03:35:29,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:29,843 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-11-23 03:35:29,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 03:35:29,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:35:29,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 03:35:29,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 03:35:29,844 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:35:29,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:35:29,844 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2022-11-23 03:35:29,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:35:29,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568858495] [2022-11-23 03:35:29,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:35:29,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:35:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:35:30,064 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-23 03:35:30,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:35:30,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568858495] [2022-11-23 03:35:30,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568858495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:35:30,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:35:30,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:35:30,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673251332] [2022-11-23 03:35:30,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:35:30,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:35:30,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:35:30,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:35:30,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:35:30,069 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:30,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:35:30,093 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-11-23 03:35:30,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:35:30,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-23 03:35:30,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:35:30,094 INFO L225 Difference]: With dead ends: 19 [2022-11-23 03:35:30,095 INFO L226 Difference]: Without dead ends: 12 [2022-11-23 03:35:30,095 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-23 03:35:30,096 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:35:30,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:35:30,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-23 03:35:30,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-11-23 03:35:30,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-11-23 03:35:30,102 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2022-11-23 03:35:30,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:35:30,102 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-11-23 03:35:30,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:30,103 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-11-23 03:35:30,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 03:35:30,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:35:30,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:35:30,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 03:35:30,104 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:35:30,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:35:30,105 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2022-11-23 03:35:30,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:35:30,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140220198] [2022-11-23 03:35:30,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:35:30,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:35:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:35:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:35:30,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:35:30,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140220198] [2022-11-23 03:35:30,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140220198] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:35:30,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987777953] [2022-11-23 03:35:30,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:35:30,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:35:30,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:35:30,505 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:35:30,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 03:35:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:35:30,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 03:35:30,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:35:30,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:35:30,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:35:30,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:35:30,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987777953] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:35:30,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:35:30,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-11-23 03:35:30,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997784840] [2022-11-23 03:35:30,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:35:30,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 03:35:30,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:35:30,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 03:35:30,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:35:30,808 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:30,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:35:30,894 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-11-23 03:35:30,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:35:30,895 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-23 03:35:30,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:35:30,898 INFO L225 Difference]: With dead ends: 26 [2022-11-23 03:35:30,898 INFO L226 Difference]: Without dead ends: 19 [2022-11-23 03:35:30,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-11-23 03:35:30,903 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 15 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:35:30,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 14 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:35:30,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-23 03:35:30,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-23 03:35:30,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:30,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-11-23 03:35:30,919 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 9 [2022-11-23 03:35:30,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:35:30,920 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-11-23 03:35:30,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:30,920 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-11-23 03:35:30,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 03:35:30,921 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:35:30,921 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-23 03:35:30,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-23 03:35:31,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:35:31,122 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:35:31,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:35:31,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1171899538, now seen corresponding path program 2 times [2022-11-23 03:35:31,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:35:31,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103071859] [2022-11-23 03:35:31,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:35:31,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:35:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:35:31,589 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:35:31,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:35:31,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103071859] [2022-11-23 03:35:31,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103071859] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:35:31,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403627097] [2022-11-23 03:35:31,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 03:35:31,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:35:31,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:35:31,602 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:35:31,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 03:35:31,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 03:35:31,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:35:31,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-23 03:35:31,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:35:31,902 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:35:31,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:35:32,078 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:35:32,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403627097] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:35:32,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:35:32,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2022-11-23 03:35:32,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613569991] [2022-11-23 03:35:32,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:35:32,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 03:35:32,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:35:32,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 03:35:32,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2022-11-23 03:35:32,081 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:32,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:35:32,978 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-11-23 03:35:32,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 03:35:32,981 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-23 03:35:32,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:35:32,981 INFO L225 Difference]: With dead ends: 46 [2022-11-23 03:35:32,982 INFO L226 Difference]: Without dead ends: 37 [2022-11-23 03:35:32,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2022-11-23 03:35:32,983 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 37 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:35:32,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 30 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 03:35:32,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-23 03:35:32,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-23 03:35:32,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:32,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-11-23 03:35:32,996 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 18 [2022-11-23 03:35:32,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:35:32,997 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-11-23 03:35:32,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:32,997 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-11-23 03:35:32,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-23 03:35:32,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:35:32,999 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-11-23 03:35:33,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 03:35:33,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:35:33,204 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:35:33,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:35:33,204 INFO L85 PathProgramCache]: Analyzing trace with hash -51731342, now seen corresponding path program 3 times [2022-11-23 03:35:33,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:35:33,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669719877] [2022-11-23 03:35:33,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:35:33,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:35:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:35:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:35:33,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:35:33,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669719877] [2022-11-23 03:35:33,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669719877] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:35:33,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106140513] [2022-11-23 03:35:33,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 03:35:33,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:35:33,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:35:33,851 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:35:33,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 03:35:33,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 03:35:33,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:35:33,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 03:35:33,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:35:34,118 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-11-23 03:35:34,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:35:34,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106140513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:35:34,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:35:34,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2022-11-23 03:35:34,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156898240] [2022-11-23 03:35:34,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:35:34,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:35:34,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:35:34,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:35:34,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-11-23 03:35:34,121 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-23 03:35:34,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:35:34,190 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-11-23 03:35:34,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:35:34,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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) Word has length 36 [2022-11-23 03:35:34,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:35:34,197 INFO L225 Difference]: With dead ends: 63 [2022-11-23 03:35:34,197 INFO L226 Difference]: Without dead ends: 59 [2022-11-23 03:35:34,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-11-23 03:35:34,200 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:35:34,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 12 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:35:34,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-23 03:35:34,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2022-11-23 03:35:34,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:35:34,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-11-23 03:35:34,225 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 36 [2022-11-23 03:35:34,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:35:34,226 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-11-23 03:35:34,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-23 03:35:34,226 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-11-23 03:35:34,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-23 03:35:34,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:35:34,228 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:35:34,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 03:35:34,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:35:34,444 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:35:34,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:35:34,445 INFO L85 PathProgramCache]: Analyzing trace with hash -108989644, now seen corresponding path program 1 times [2022-11-23 03:35:34,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:35:34,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447467791] [2022-11-23 03:35:34,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:35:34,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:35:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:35:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:35:34,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:35:34,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447467791] [2022-11-23 03:35:34,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447467791] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:35:34,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428947531] [2022-11-23 03:35:34,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:35:34,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:35:34,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:35:34,780 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:35:34,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 03:35:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:35:34,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-23 03:35:34,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:35:35,013 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:35:35,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:35:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:35:35,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428947531] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:35:35,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:35:35,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 24 [2022-11-23 03:35:35,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087704129] [2022-11-23 03:35:35,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:35:35,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-23 03:35:35,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:35:35,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-23 03:35:35,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2022-11-23 03:35:35,551 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 24 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 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-23 03:35:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:35:41,212 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2022-11-23 03:35:41,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-23 03:35:41,214 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 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 36 [2022-11-23 03:35:41,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:35:41,215 INFO L225 Difference]: With dead ends: 88 [2022-11-23 03:35:41,215 INFO L226 Difference]: Without dead ends: 70 [2022-11-23 03:35:41,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=393, Invalid=663, Unknown=0, NotChecked=0, Total=1056 [2022-11-23 03:35:41,216 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 61 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:35:41,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 47 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 03:35:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-23 03:35:41,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-23 03:35:41,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 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-23 03:35:41,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2022-11-23 03:35:41,234 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 36 [2022-11-23 03:35:41,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:35:41,234 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2022-11-23 03:35:41,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 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-23 03:35:41,235 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-11-23 03:35:41,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-23 03:35:41,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:35:41,239 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:35:41,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 03:35:41,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-23 03:35:41,444 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:35:41,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:35:41,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1647036101, now seen corresponding path program 2 times [2022-11-23 03:35:41,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:35:41,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311992345] [2022-11-23 03:35:41,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:35:41,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:35:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:35:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:35:42,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:35:42,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311992345] [2022-11-23 03:35:42,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311992345] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:35:42,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251613001] [2022-11-23 03:35:42,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 03:35:42,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:35:42,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:35:42,358 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:35:42,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 03:35:42,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 03:35:42,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:35:42,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-23 03:35:42,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:35:42,800 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:35:42,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:35:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:35:44,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251613001] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:35:44,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:35:44,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 26] total 49 [2022-11-23 03:35:44,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767510066] [2022-11-23 03:35:44,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:35:44,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-23 03:35:44,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:35:44,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-23 03:35:44,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=626, Invalid=1726, Unknown=0, NotChecked=0, Total=2352 [2022-11-23 03:35:44,818 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 49 states, 49 states have (on average 2.795918367346939) internal successors, (137), 49 states have internal predecessors, (137), 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-23 03:40:24,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:40:24,842 INFO L93 Difference]: Finished difference Result 145 states and 169 transitions. [2022-11-23 03:40:24,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-11-23 03:40:24,843 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.795918367346939) internal successors, (137), 49 states have internal predecessors, (137), 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 69 [2022-11-23 03:40:24,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:40:24,844 INFO L225 Difference]: With dead ends: 145 [2022-11-23 03:40:24,844 INFO L226 Difference]: Without dead ends: 136 [2022-11-23 03:40:24,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2763 ImplicationChecksByTransitivity, 280.5s TimeCoverageRelationStatistics Valid=3768, Invalid=8438, Unknown=4, NotChecked=0, Total=12210 [2022-11-23 03:40:24,849 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 152 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1601 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-23 03:40:24,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 106 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1601 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-23 03:40:24,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-23 03:40:24,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-11-23 03:40:24,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.0148148148148148) internal successors, (137), 135 states have internal predecessors, (137), 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-23 03:40:24,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2022-11-23 03:40:24,871 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 69 [2022-11-23 03:40:24,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:40:24,871 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2022-11-23 03:40:24,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.795918367346939) internal successors, (137), 49 states have internal predecessors, (137), 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-23 03:40:24,872 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2022-11-23 03:40:24,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-23 03:40:24,873 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:40:24,873 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 42, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:40:24,890 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 03:40:25,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-23 03:40:25,091 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:40:25,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:40:25,092 INFO L85 PathProgramCache]: Analyzing trace with hash 420755547, now seen corresponding path program 3 times [2022-11-23 03:40:25,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:40:25,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044738805] [2022-11-23 03:40:25,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:40:25,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:40:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:40:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 85 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:40:27,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:40:27,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044738805] [2022-11-23 03:40:27,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044738805] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:40:27,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125202149] [2022-11-23 03:40:27,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 03:40:27,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:40:27,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:40:27,751 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:40:27,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 03:40:27,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-23 03:40:27,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:40:27,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 03:40:27,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:40:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 208 proven. 2 refuted. 0 times theorem prover too weak. 2542 trivial. 0 not checked. [2022-11-23 03:40:28,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:40:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 2542 trivial. 0 not checked. [2022-11-23 03:40:30,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125202149] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:40:30,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:40:30,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 7, 8] total 56 [2022-11-23 03:40:30,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732862624] [2022-11-23 03:40:30,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:40:30,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-23 03:40:30,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:40:30,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-23 03:40:30,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=2767, Unknown=0, NotChecked=0, Total=3080 [2022-11-23 03:40:30,557 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand has 56 states, 56 states have (on average 2.767857142857143) internal successors, (155), 56 states have internal predecessors, (155), 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-23 03:40:36,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:40:36,537 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2022-11-23 03:40:36,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-23 03:40:36,539 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.767857142857143) internal successors, (155), 56 states have internal predecessors, (155), 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 135 [2022-11-23 03:40:36,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:40:36,540 INFO L225 Difference]: With dead ends: 164 [2022-11-23 03:40:36,540 INFO L226 Difference]: Without dead ends: 155 [2022-11-23 03:40:36,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1188, Invalid=9524, Unknown=0, NotChecked=0, Total=10712 [2022-11-23 03:40:36,552 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 270 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5701 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 5802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 5701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-23 03:40:36,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 70 Invalid, 5802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 5701 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-23 03:40:36,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-23 03:40:36,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2022-11-23 03:40:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.0326797385620916) internal successors, (158), 153 states have internal predecessors, (158), 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-23 03:40:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions. [2022-11-23 03:40:36,591 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 135 [2022-11-23 03:40:36,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:40:36,591 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions. [2022-11-23 03:40:36,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.767857142857143) internal successors, (155), 56 states have internal predecessors, (155), 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-23 03:40:36,592 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2022-11-23 03:40:36,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-11-23 03:40:36,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:40:36,594 INFO L195 NwaCegarLoop]: trace histogram [49, 49, 44, 5, 1, 1, 1, 1, 1, 1] [2022-11-23 03:40:36,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 03:40:36,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:40:36,799 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:40:36,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:40:36,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1171799301, now seen corresponding path program 4 times [2022-11-23 03:40:36,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:40:36,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686327038] [2022-11-23 03:40:36,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:40:36,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:40:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:40:39,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 625 proven. 2926 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-23 03:40:39,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:40:39,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686327038] [2022-11-23 03:40:39,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686327038] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:40:39,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440017678] [2022-11-23 03:40:39,640 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 03:40:39,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:40:39,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:40:39,641 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:40:39,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec2e8e88-0b65-497b-881f-a48ce95b5948/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 03:40:39,810 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 03:40:39,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:40:39,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-23 03:40:39,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:40:40,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 502 proven. 3060 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-23 03:40:40,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:40:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 502 proven. 3060 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-23 03:40:46,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440017678] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:40:46,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:40:46,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 48, 49] total 96 [2022-11-23 03:40:46,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038210172] [2022-11-23 03:40:46,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:40:46,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-11-23 03:40:46,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:40:46,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-11-23 03:40:46,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2444, Invalid=6676, Unknown=0, NotChecked=0, Total=9120 [2022-11-23 03:40:46,914 INFO L87 Difference]: Start difference. First operand 154 states and 158 transitions. Second operand has 96 states, 96 states have (on average 2.9895833333333335) internal successors, (287), 96 states have internal predecessors, (287), 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-23 03:40:51,850 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (not (<= 5000000 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (<= 5000000 .cse1)) (< 4294967294 .cse1))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse2) (not (<= 5000000 .cse2)))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< 4294967294 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< 4294967294 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse5)) (< 4294967294 .cse5))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse8)) (< 4294967294 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (<= 5000000 .cse9)) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse10)) (< 4294967294 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse13)) (< 4294967294 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (not (<= 5000000 .cse14)) (< 4294967294 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse15) (not (<= 5000000 .cse15)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse16)) (< 4294967294 .cse16))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< 4294967294 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse18)) (< 4294967294 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< 4294967294 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< 4294967294 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse23) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< 4294967294 .cse24) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse25) (not (<= 5000000 .cse25)))) (let ((.cse26 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse26)) (< 4294967294 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse27)) (< 4294967294 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse28) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 4294967294 .cse29) (not (<= 5000000 .cse29)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< 4294967294 .cse30) (not (<= 5000000 .cse30)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse31)) (< 4294967294 .cse31))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse32)) (< 4294967294 .cse32))) (let ((.cse33 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse34) (not (<= 5000000 .cse34)))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse35)) (< 4294967294 .cse35))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse36)) (< 4294967294 .cse36))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse37) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse38)) (< 4294967294 .cse38))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse39)) (< 4294967294 .cse39))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse40) (not (<= 5000000 .cse40)))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse41)) (< 4294967294 .cse41))) (let ((.cse42 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse42) (not (<= 5000000 .cse42)))) (let ((.cse43 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (< 4294967294 .cse43) (not (<= 5000000 .cse43)))) (let ((.cse44 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< 4294967294 .cse44) (not (<= 5000000 .cse44))))) is different from false [2022-11-23 03:40:53,872 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (<= 5000000 .cse1)) (< 4294967294 .cse1))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse2) (not (<= 5000000 .cse2)))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< 4294967294 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< 4294967294 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse5)) (< 4294967294 .cse5))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse8)) (< 4294967294 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (<= 5000000 .cse9)) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse10)) (< 4294967294 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse13)) (< 4294967294 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (not (<= 5000000 .cse14)) (< 4294967294 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse15) (not (<= 5000000 .cse15)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse16)) (< 4294967294 .cse16))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< 4294967294 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse18)) (< 4294967294 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< 4294967294 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< 4294967294 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse23) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< 4294967294 .cse24) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse25) (not (<= 5000000 .cse25)))) (let ((.cse26 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse26)) (< 4294967294 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse27)) (< 4294967294 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse28) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 4294967294 .cse29) (not (<= 5000000 .cse29)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< 4294967294 .cse30) (not (<= 5000000 .cse30)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse31)) (< 4294967294 .cse31))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse32)) (< 4294967294 .cse32))) (let ((.cse33 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse34)) (< 4294967294 .cse34))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse35)) (< 4294967294 .cse35))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse36) (not (<= 5000000 .cse36)))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse37)) (< 4294967294 .cse37))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse38)) (< 4294967294 .cse38))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse39) (not (<= 5000000 .cse39)))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse40)) (< 4294967294 .cse40))) (let ((.cse41 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse41) (not (<= 5000000 .cse41)))) (let ((.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (< 4294967294 .cse42) (not (<= 5000000 .cse42)))) (let ((.cse43 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< 4294967294 .cse43) (not (<= 5000000 .cse43))))) is different from false [2022-11-23 03:40:55,889 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (<= 5000000 .cse1)) (< 4294967294 .cse1))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse2) (not (<= 5000000 .cse2)))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< 4294967294 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< 4294967294 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse5)) (< 4294967294 .cse5))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse8)) (< 4294967294 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (<= 5000000 .cse9)) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse10)) (< 4294967294 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse13)) (< 4294967294 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (not (<= 5000000 .cse14)) (< 4294967294 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse15) (not (<= 5000000 .cse15)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse16)) (< 4294967294 .cse16))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< 4294967294 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse18)) (< 4294967294 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< 4294967294 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< 4294967294 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse23) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< 4294967294 .cse24) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse25) (not (<= 5000000 .cse25)))) (let ((.cse26 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse26)) (< 4294967294 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse27)) (< 4294967294 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse28) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 4294967294 .cse29) (not (<= 5000000 .cse29)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< 4294967294 .cse30) (not (<= 5000000 .cse30)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse31)) (< 4294967294 .cse31))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse32)) (< 4294967294 .cse32))) (let ((.cse33 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse34) (not (<= 5000000 .cse34)))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse35)) (< 4294967294 .cse35))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse36)) (< 4294967294 .cse36))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse37) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse38)) (< 4294967294 .cse38))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse39)) (< 4294967294 .cse39))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse40) (not (<= 5000000 .cse40)))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse41)) (< 4294967294 .cse41))) (let ((.cse42 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse42) (not (<= 5000000 .cse42)))) (let ((.cse43 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< 4294967294 .cse43) (not (<= 5000000 .cse43))))) is different from false [2022-11-23 03:40:57,911 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (<= 5000000 .cse1)) (< 4294967294 .cse1))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse2) (not (<= 5000000 .cse2)))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< 4294967294 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< 4294967294 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse5)) (< 4294967294 .cse5))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse8)) (< 4294967294 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (<= 5000000 .cse9)) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse10)) (< 4294967294 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse13)) (< 4294967294 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (not (<= 5000000 .cse14)) (< 4294967294 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse15) (not (<= 5000000 .cse15)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse16)) (< 4294967294 .cse16))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< 4294967294 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse18)) (< 4294967294 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< 4294967294 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< 4294967294 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse23) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< 4294967294 .cse24) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse25) (not (<= 5000000 .cse25)))) (let ((.cse26 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse26)) (< 4294967294 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse27)) (< 4294967294 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse28) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 4294967294 .cse29) (not (<= 5000000 .cse29)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< 4294967294 .cse30) (not (<= 5000000 .cse30)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse31)) (< 4294967294 .cse31))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse32)) (< 4294967294 .cse32))) (let ((.cse33 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse34)) (< 4294967294 .cse34))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse35)) (< 4294967294 .cse35))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse36) (not (<= 5000000 .cse36)))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse37)) (< 4294967294 .cse37))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse38)) (< 4294967294 .cse38))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse39) (not (<= 5000000 .cse39)))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse40)) (< 4294967294 .cse40))) (let ((.cse41 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse41) (not (<= 5000000 .cse41)))) (let ((.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< 4294967294 .cse42) (not (<= 5000000 .cse42))))) is different from false [2022-11-23 03:40:59,936 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (<= 5000000 .cse1)) (< 4294967294 .cse1))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse2) (not (<= 5000000 .cse2)))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< 4294967294 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< 4294967294 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse5)) (< 4294967294 .cse5))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse8)) (< 4294967294 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (<= 5000000 .cse9)) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse10)) (< 4294967294 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse13)) (< 4294967294 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (not (<= 5000000 .cse14)) (< 4294967294 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse15) (not (<= 5000000 .cse15)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse16)) (< 4294967294 .cse16))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< 4294967294 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse18)) (< 4294967294 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< 4294967294 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< 4294967294 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse23) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< 4294967294 .cse24) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse25) (not (<= 5000000 .cse25)))) (let ((.cse26 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse26)) (< 4294967294 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse27)) (< 4294967294 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse28) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 4294967294 .cse29) (not (<= 5000000 .cse29)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse30)) (< 4294967294 .cse30))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse31)) (< 4294967294 .cse31))) (let ((.cse32 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse32) (not (<= 5000000 .cse32)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse34)) (< 4294967294 .cse34))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse35)) (< 4294967294 .cse35))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse36) (not (<= 5000000 .cse36)))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse37)) (< 4294967294 .cse37))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse38)) (< 4294967294 .cse38))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse39) (not (<= 5000000 .cse39)))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse40)) (< 4294967294 .cse40))) (let ((.cse41 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse41) (not (<= 5000000 .cse41)))) (let ((.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< 4294967294 .cse42) (not (<= 5000000 .cse42))))) is different from false [2022-11-23 03:42:47,546 WARN L233 SmtUtils]: Spent 18.51s on a formula simplification. DAG size of input: 299 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:42:49,574 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (<= 5000000 .cse1)) (< 4294967294 .cse1))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse2) (not (<= 5000000 .cse2)))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< 4294967294 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse4)) (< 4294967294 .cse4))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse5) (not (<= 5000000 .cse5)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse7)) (< 4294967294 .cse7))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (<= 5000000 .cse8)) (< 4294967294 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse9)) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse10) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse12)) (< 4294967294 .cse12))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (not (<= 5000000 .cse13)) (< 4294967294 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse14) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse15)) (< 4294967294 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< 4294967294 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse17)) (< 4294967294 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< 4294967294 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< 4294967294 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< 4294967294 .cse23) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse24) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse25)) (< 4294967294 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse26)) (< 4294967294 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 4294967294 .cse28) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse29)) (< 4294967294 .cse29))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse30)) (< 4294967294 .cse30))) (let ((.cse31 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse31) (not (<= 5000000 .cse31)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse32) (not (<= 5000000 .cse32)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse33)) (< 4294967294 .cse33))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse34)) (< 4294967294 .cse34))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse35) (not (<= 5000000 .cse35)))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse36)) (< 4294967294 .cse36))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse37)) (< 4294967294 .cse37))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse38) (not (<= 5000000 .cse38)))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse39)) (< 4294967294 .cse39))) (let ((.cse40 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse40) (not (<= 5000000 .cse40)))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< 4294967294 .cse41) (not (<= 5000000 .cse41))))) is different from false [2022-11-23 03:42:51,589 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (<= 5000000 .cse1)) (< 4294967294 .cse1))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse2) (not (<= 5000000 .cse2)))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< 4294967294 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse4)) (< 4294967294 .cse4))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse5) (not (<= 5000000 .cse5)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse7)) (< 4294967294 .cse7))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (<= 5000000 .cse8)) (< 4294967294 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse9)) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse10) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse12)) (< 4294967294 .cse12))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (not (<= 5000000 .cse13)) (< 4294967294 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse14) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse15)) (< 4294967294 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< 4294967294 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse17)) (< 4294967294 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< 4294967294 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< 4294967294 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< 4294967294 .cse23) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse24) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse25)) (< 4294967294 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse26)) (< 4294967294 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 4294967294 .cse28) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse29)) (< 4294967294 .cse29))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse30)) (< 4294967294 .cse30))) (let ((.cse31 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse31) (not (<= 5000000 .cse31)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse32)) (< 4294967294 .cse32))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse33)) (< 4294967294 .cse33))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse34) (not (<= 5000000 .cse34)))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse35)) (< 4294967294 .cse35))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse36)) (< 4294967294 .cse36))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse37) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse38)) (< 4294967294 .cse38))) (let ((.cse39 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse39) (not (<= 5000000 .cse39)))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< 4294967294 .cse40) (not (<= 5000000 .cse40))))) is different from false [2022-11-23 03:42:53,606 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (<= 5000000 .cse1)) (< 4294967294 .cse1))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse2) (not (<= 5000000 .cse2)))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< 4294967294 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse4)) (< 4294967294 .cse4))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse5) (not (<= 5000000 .cse5)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse7)) (< 4294967294 .cse7))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (<= 5000000 .cse8)) (< 4294967294 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse9)) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse10) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse12)) (< 4294967294 .cse12))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (not (<= 5000000 .cse13)) (< 4294967294 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse14) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse15)) (< 4294967294 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< 4294967294 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse17)) (< 4294967294 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< 4294967294 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< 4294967294 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse23) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse24)) (< 4294967294 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse25)) (< 4294967294 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse26) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 4294967294 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse28)) (< 4294967294 .cse28))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse29)) (< 4294967294 .cse29))) (let ((.cse30 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse30) (not (<= 5000000 .cse30)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse31) (not (<= 5000000 .cse31)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse32)) (< 4294967294 .cse32))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse33)) (< 4294967294 .cse33))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse34) (not (<= 5000000 .cse34)))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse35)) (< 4294967294 .cse35))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse36)) (< 4294967294 .cse36))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse37) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse38)) (< 4294967294 .cse38))) (let ((.cse39 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse39) (not (<= 5000000 .cse39)))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< 4294967294 .cse40) (not (<= 5000000 .cse40))))) is different from false [2022-11-23 03:44:45,988 WARN L233 SmtUtils]: Spent 16.35s on a formula simplification. DAG size of input: 285 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:46:42,145 WARN L233 SmtUtils]: Spent 25.52s on a formula simplification. DAG size of input: 285 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:46:44,201 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (not (<= 5000000 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (<= 5000000 .cse1)) (< 4294967294 .cse1))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse2) (not (<= 5000000 .cse2)))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< 4294967294 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse4)) (< 4294967294 .cse4))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse5) (not (<= 5000000 .cse5)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse7)) (< 4294967294 .cse7))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (<= 5000000 .cse8)) (< 4294967294 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse9)) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse10) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse12)) (< 4294967294 .cse12))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (not (<= 5000000 .cse13)) (< 4294967294 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse14) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse15)) (< 4294967294 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< 4294967294 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse17)) (< 4294967294 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< 4294967294 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< 4294967294 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse23) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse24)) (< 4294967294 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse25)) (< 4294967294 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse26) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 4294967294 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse28)) (< 4294967294 .cse28))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse29)) (< 4294967294 .cse29))) (let ((.cse30 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse30) (not (<= 5000000 .cse30)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse31) (not (<= 5000000 .cse31)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse32)) (< 4294967294 .cse32))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse33)) (< 4294967294 .cse33))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse34) (not (<= 5000000 .cse34)))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse35)) (< 4294967294 .cse35))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse36)) (< 4294967294 .cse36))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse37) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse38)) (< 4294967294 .cse38))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< 4294967294 .cse39) (not (<= 5000000 .cse39))))) is different from false [2022-11-23 03:48:42,605 WARN L233 SmtUtils]: Spent 37.14s on a formula simplification. DAG size of input: 320 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:48:44,620 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (<= 5000000 .cse1)) (< 4294967294 .cse1))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse2) (not (<= 5000000 .cse2)))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< 4294967294 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse4)) (< 4294967294 .cse4))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse5) (not (<= 5000000 .cse5)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse7)) (< 4294967294 .cse7))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (<= 5000000 .cse8)) (< 4294967294 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse9)) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse10) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse12)) (< 4294967294 .cse12))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (not (<= 5000000 .cse13)) (< 4294967294 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse14) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse15)) (< 4294967294 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< 4294967294 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse17)) (< 4294967294 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< 4294967294 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< 4294967294 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse23) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse24)) (< 4294967294 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse25)) (< 4294967294 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse26) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 4294967294 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse28)) (< 4294967294 .cse28))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse29)) (< 4294967294 .cse29))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse30) (not (<= 5000000 .cse30)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse31)) (< 4294967294 .cse31))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse32)) (< 4294967294 .cse32))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse34)) (< 4294967294 .cse34))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse35)) (< 4294967294 .cse35))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse36) (not (<= 5000000 .cse36)))) (let ((.cse37 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (or (not (<= 5000000 .cse37)) (< 4294967294 .cse37))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse38)) (< 4294967294 .cse38))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< 4294967294 .cse39) (not (<= 5000000 .cse39))))) is different from false [2022-11-23 03:48:46,648 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (<= 5000000 .cse1)) (< 4294967294 .cse1))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse2) (not (<= 5000000 .cse2)))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< 4294967294 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< 4294967294 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse5)) (< 4294967294 .cse5))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse8)) (< 4294967294 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (<= 5000000 .cse9)) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse10)) (< 4294967294 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse13)) (< 4294967294 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (not (<= 5000000 .cse14)) (< 4294967294 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse15) (not (<= 5000000 .cse15)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse16)) (< 4294967294 .cse16))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< 4294967294 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse18)) (< 4294967294 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< 4294967294 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< 4294967294 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse23) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< 4294967294 .cse24) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse25) (not (<= 5000000 .cse25)))) (let ((.cse26 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse26)) (< 4294967294 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse27)) (< 4294967294 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse28) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 4294967294 .cse29) (not (<= 5000000 .cse29)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< 4294967294 .cse30) (not (<= 5000000 .cse30)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse31)) (< 4294967294 .cse31))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse32)) (< 4294967294 .cse32))) (let ((.cse33 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse34) (not (<= 5000000 .cse34)))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse35)) (< 4294967294 .cse35))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse36)) (< 4294967294 .cse36))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse37) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse38)) (< 4294967294 .cse38))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse39)) (< 4294967294 .cse39))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse40) (not (<= 5000000 .cse40)))) (let ((.cse41 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (or (not (<= 5000000 .cse41)) (< 4294967294 .cse41))) (let ((.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse42)) (< 4294967294 .cse42))) (let ((.cse43 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse43) (not (<= 5000000 .cse43)))) (let ((.cse44 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< 4294967294 .cse44) (not (<= 5000000 .cse44))))) is different from false [2022-11-23 03:48:48,666 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (not (<= 5000000 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (<= 5000000 .cse1)) (< 4294967294 .cse1))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse2) (not (<= 5000000 .cse2)))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< 4294967294 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse4)) (< 4294967294 .cse4))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse5) (not (<= 5000000 .cse5)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse7)) (< 4294967294 .cse7))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (<= 5000000 .cse8)) (< 4294967294 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse9)) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse10) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse12)) (< 4294967294 .cse12))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (not (<= 5000000 .cse13)) (< 4294967294 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse14) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse15)) (< 4294967294 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< 4294967294 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse17)) (< 4294967294 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< 4294967294 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< 4294967294 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse23) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse24)) (< 4294967294 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse25)) (< 4294967294 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse26) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 4294967294 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse28)) (< 4294967294 .cse28))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse29)) (< 4294967294 .cse29))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse30) (not (<= 5000000 .cse30)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse31)) (< 4294967294 .cse31))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse32)) (< 4294967294 .cse32))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse34)) (< 4294967294 .cse34))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse35)) (< 4294967294 .cse35))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse36) (not (<= 5000000 .cse36)))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse37)) (< 4294967294 .cse37))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< 4294967294 .cse38) (not (<= 5000000 .cse38))))) is different from false