./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 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/mono-crafted_8.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 04:09:04,319 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 04:09:04,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 04:09:04,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 04:09:04,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 04:09:04,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 04:09:04,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 04:09:04,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 04:09:04,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 04:09:04,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 04:09:04,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 04:09:04,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 04:09:04,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 04:09:04,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 04:09:04,373 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 04:09:04,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 04:09:04,376 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 04:09:04,378 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 04:09:04,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 04:09:04,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 04:09:04,387 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 04:09:04,388 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 04:09:04,389 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 04:09:04,390 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 04:09:04,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 04:09:04,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 04:09:04,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 04:09:04,397 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 04:09:04,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 04:09:04,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 04:09:04,404 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 04:09:04,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 04:09:04,406 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 04:09:04,407 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 04:09:04,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 04:09:04,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 04:09:04,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 04:09:04,409 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 04:09:04,409 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 04:09:04,409 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 04:09:04,410 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 04:09:04,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 04:09:04,414 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 04:09:04,450 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 04:09:04,451 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 04:09:04,451 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 04:09:04,451 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 04:09:04,452 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 04:09:04,452 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 04:09:04,453 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 04:09:04,453 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 04:09:04,453 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 04:09:04,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 04:09:04,454 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 04:09:04,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 04:09:04,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 04:09:04,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 04:09:04,455 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 04:09:04,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 04:09:04,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 04:09:04,455 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 04:09:04,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 04:09:04,456 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 04:09:04,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 04:09:04,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 04:09:04,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 04:09:04,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 04:09:04,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 04:09:04,462 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 04:09:04,462 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 04:09:04,463 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 04:09:04,463 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 04:09:04,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 04:09:04,463 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 04:09:04,463 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 04:09:04,464 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 04:09:04,464 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-07-12 04:09:04,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 04:09:04,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 04:09:04,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 04:09:04,707 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 04:09:04,708 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 04:09:04,709 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/mono-crafted_8.c [2022-07-12 04:09:04,764 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d109233a6/df81635c90a14b94bc2c86624f941457/FLAGd5eb86475 [2022-07-12 04:09:05,103 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 04:09:05,104 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_8.c [2022-07-12 04:09:05,113 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d109233a6/df81635c90a14b94bc2c86624f941457/FLAGd5eb86475 [2022-07-12 04:09:05,498 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d109233a6/df81635c90a14b94bc2c86624f941457 [2022-07-12 04:09:05,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 04:09:05,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 04:09:05,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 04:09:05,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 04:09:05,510 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 04:09:05,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:09:05" (1/1) ... [2022-07-12 04:09:05,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@241a55c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:09:05, skipping insertion in model container [2022-07-12 04:09:05,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:09:05" (1/1) ... [2022-07-12 04:09:05,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 04:09:05,527 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 04:09:05,615 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_8.c[318,331] [2022-07-12 04:09:05,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 04:09:05,630 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 04:09:05,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_8.c[318,331] [2022-07-12 04:09:05,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 04:09:05,656 INFO L208 MainTranslator]: Completed translation [2022-07-12 04:09:05,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:09:05 WrapperNode [2022-07-12 04:09:05,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 04:09:05,657 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 04:09:05,657 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 04:09:05,657 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 04:09:05,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:09:05" (1/1) ... [2022-07-12 04:09:05,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:09:05" (1/1) ... [2022-07-12 04:09:05,689 INFO L137 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2022-07-12 04:09:05,690 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 04:09:05,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 04:09:05,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 04:09:05,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 04:09:05,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:09:05" (1/1) ... [2022-07-12 04:09:05,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:09:05" (1/1) ... [2022-07-12 04:09:05,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:09:05" (1/1) ... [2022-07-12 04:09:05,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:09:05" (1/1) ... [2022-07-12 04:09:05,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:09:05" (1/1) ... [2022-07-12 04:09:05,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:09:05" (1/1) ... [2022-07-12 04:09:05,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:09:05" (1/1) ... [2022-07-12 04:09:05,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 04:09:05,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 04:09:05,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 04:09:05,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 04:09:05,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:09:05" (1/1) ... [2022-07-12 04:09:05,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 04:09:05,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:09:05,732 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 04:09:05,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 04:09:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 04:09:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 04:09:05,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 04:09:05,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 04:09:05,826 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 04:09:05,827 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 04:09:05,905 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 04:09:05,909 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 04:09:05,909 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 04:09:05,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:09:05 BoogieIcfgContainer [2022-07-12 04:09:05,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 04:09:05,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 04:09:05,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 04:09:05,923 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 04:09:05,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 04:09:05" (1/3) ... [2022-07-12 04:09:05,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e1c94eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:09:05, skipping insertion in model container [2022-07-12 04:09:05,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:09:05" (2/3) ... [2022-07-12 04:09:05,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e1c94eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:09:05, skipping insertion in model container [2022-07-12 04:09:05,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:09:05" (3/3) ... [2022-07-12 04:09:05,926 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_8.c [2022-07-12 04:09:05,937 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 04:09:05,937 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 04:09:05,986 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 04:09:05,993 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2d1f3da1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@22cd2bed [2022-07-12 04:09:05,996 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 04:09:06,003 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-07-12 04:09:06,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 04:09:06,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:09:06,015 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 04:09:06,015 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:09:06,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:09:06,020 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2022-07-12 04:09:06,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:09:06,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96858190] [2022-07-12 04:09:06,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:09:06,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:09:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:09:06,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:09:06,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:09:06,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96858190] [2022-07-12 04:09:06,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96858190] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:09:06,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 04:09:06,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 04:09:06,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367420784] [2022-07-12 04:09:06,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:09:06,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 04:09:06,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:09:06,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 04:09:06,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 04:09:06,172 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-07-12 04:09:06,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:09:06,184 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-07-12 04:09:06,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 04:09:06,186 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-07-12 04:09:06,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:09:06,192 INFO L225 Difference]: With dead ends: 21 [2022-07-12 04:09:06,192 INFO L226 Difference]: Without dead ends: 9 [2022-07-12 04:09:06,195 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-07-12 04:09:06,204 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-07-12 04:09:06,205 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-07-12 04:09:06,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-07-12 04:09:06,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-07-12 04:09:06,229 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-07-12 04:09:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-07-12 04:09:06,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2022-07-12 04:09:06,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:09:06,231 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-07-12 04:09:06,231 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-07-12 04:09:06,232 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-07-12 04:09:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 04:09:06,232 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:09:06,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 04:09:06,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 04:09:06,233 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:09:06,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:09:06,233 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2022-07-12 04:09:06,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:09:06,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167041832] [2022-07-12 04:09:06,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:09:06,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:09:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:09:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:09:06,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:09:06,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167041832] [2022-07-12 04:09:06,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167041832] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:09:06,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 04:09:06,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 04:09:06,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189928596] [2022-07-12 04:09:06,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:09:06,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 04:09:06,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:09:06,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 04:09:06,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 04:09:06,380 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-07-12 04:09:06,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:09:06,396 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-07-12 04:09:06,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 04:09:06,397 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-07-12 04:09:06,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:09:06,398 INFO L225 Difference]: With dead ends: 19 [2022-07-12 04:09:06,398 INFO L226 Difference]: Without dead ends: 12 [2022-07-12 04:09:06,398 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-07-12 04:09:06,400 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-07-12 04:09:06,407 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-07-12 04:09:06,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-07-12 04:09:06,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-07-12 04:09:06,410 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-07-12 04:09:06,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-07-12 04:09:06,411 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2022-07-12 04:09:06,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:09:06,411 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-07-12 04:09:06,412 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-07-12 04:09:06,412 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-07-12 04:09:06,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 04:09:06,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:09:06,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:09:06,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 04:09:06,413 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:09:06,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:09:06,417 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2022-07-12 04:09:06,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:09:06,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027982915] [2022-07-12 04:09:06,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:09:06,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:09:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:09:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:09:06,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:09:06,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027982915] [2022-07-12 04:09:06,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027982915] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 04:09:06,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239869576] [2022-07-12 04:09:06,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:09:06,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:09:06,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:09:06,526 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:09:06,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 04:09:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:09:06,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 04:09:06,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:09:06,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:09:06,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:09:06,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:09:06,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239869576] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:09:06,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 04:09:06,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-07-12 04:09:06,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859425059] [2022-07-12 04:09:06,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 04:09:06,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 04:09:06,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:09:06,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 04:09:06,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-12 04:09:06,798 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-07-12 04:09:06,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:09:06,889 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-07-12 04:09:06,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 04:09:06,890 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-07-12 04:09:06,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:09:06,891 INFO L225 Difference]: With dead ends: 26 [2022-07-12 04:09:06,891 INFO L226 Difference]: Without dead ends: 19 [2022-07-12 04:09:06,892 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-07-12 04:09:06,894 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 15 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 04:09:06,894 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.1s Time] [2022-07-12 04:09:06,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-12 04:09:06,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-12 04:09:06,898 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-07-12 04:09:06,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-07-12 04:09:06,899 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 9 [2022-07-12 04:09:06,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:09:06,899 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-07-12 04:09:06,903 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-07-12 04:09:06,903 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-07-12 04:09:06,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 04:09:06,904 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:09:06,904 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-07-12 04:09:06,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 04:09:07,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:09:07,106 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:09:07,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:09:07,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1171899538, now seen corresponding path program 2 times [2022-07-12 04:09:07,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:09:07,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485749342] [2022-07-12 04:09:07,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:09:07,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:09:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:09:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:09:07,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:09:07,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485749342] [2022-07-12 04:09:07,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485749342] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 04:09:07,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360785018] [2022-07-12 04:09:07,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 04:09:07,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:09:07,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:09:07,351 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:09:07,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 04:09:07,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 04:09:07,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 04:09:07,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 04:09:07,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:09:07,585 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:09:07,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:09:08,317 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:09:08,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360785018] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:09:08,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 04:09:08,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 19 [2022-07-12 04:09:08,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085539260] [2022-07-12 04:09:08,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 04:09:08,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 04:09:08,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:09:08,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 04:09:08,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2022-07-12 04:09:08,320 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 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-07-12 04:09:09,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:09:09,213 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-07-12 04:09:09,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 04:09:09,213 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 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-07-12 04:09:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:09:09,214 INFO L225 Difference]: With dead ends: 46 [2022-07-12 04:09:09,214 INFO L226 Difference]: Without dead ends: 37 [2022-07-12 04:09:09,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=210, Invalid=342, Unknown=0, NotChecked=0, Total=552 [2022-07-12 04:09:09,216 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 75 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 04:09:09,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 32 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 04:09:09,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-12 04:09:09,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-07-12 04:09:09,222 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-07-12 04:09:09,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-07-12 04:09:09,223 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 18 [2022-07-12 04:09:09,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:09:09,223 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-07-12 04:09:09,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 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-07-12 04:09:09,224 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-07-12 04:09:09,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 04:09:09,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:09:09,225 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-07-12 04:09:09,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 04:09:09,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-12 04:09:09,440 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:09:09,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:09:09,440 INFO L85 PathProgramCache]: Analyzing trace with hash -51731342, now seen corresponding path program 3 times [2022-07-12 04:09:09,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:09:09,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304751526] [2022-07-12 04:09:09,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:09:09,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:09:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:09:09,739 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:09:09,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:09:09,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304751526] [2022-07-12 04:09:09,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304751526] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 04:09:09,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209217267] [2022-07-12 04:09:09,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 04:09:09,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:09:09,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:09:09,748 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:09:09,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 04:09:09,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-12 04:09:09,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 04:09:09,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 04:09:09,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:09:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-07-12 04:09:09,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 04:09:09,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209217267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:09:09,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 04:09:09,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2022-07-12 04:09:09,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812819837] [2022-07-12 04:09:09,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:09:09,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 04:09:09,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:09:09,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 04:09:09,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-07-12 04:09:09,917 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-07-12 04:09:09,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:09:09,963 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-07-12 04:09:09,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 04:09:09,963 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-07-12 04:09:09,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:09:09,967 INFO L225 Difference]: With dead ends: 63 [2022-07-12 04:09:09,967 INFO L226 Difference]: Without dead ends: 59 [2022-07-12 04:09:09,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-07-12 04:09:09,968 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-07-12 04:09:09,969 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-07-12 04:09:09,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-12 04:09:09,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2022-07-12 04:09:09,975 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-07-12 04:09:09,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-07-12 04:09:09,976 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 36 [2022-07-12 04:09:09,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:09:09,976 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-07-12 04:09:09,976 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-07-12 04:09:09,976 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-07-12 04:09:09,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 04:09:09,977 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:09:09,977 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:09:10,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 04:09:10,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:09:10,198 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:09:10,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:09:10,199 INFO L85 PathProgramCache]: Analyzing trace with hash -108989644, now seen corresponding path program 1 times [2022-07-12 04:09:10,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:09:10,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30397429] [2022-07-12 04:09:10,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:09:10,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:09:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:09:10,364 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:09:10,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:09:10,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30397429] [2022-07-12 04:09:10,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30397429] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 04:09:10,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640850223] [2022-07-12 04:09:10,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:09:10,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:09:10,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:09:10,369 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:09:10,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 04:09:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:09:10,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 04:09:10,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:09:10,513 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:09:10,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:09:10,878 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:09:10,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640850223] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:09:10,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 04:09:10,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 24 [2022-07-12 04:09:10,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233896488] [2022-07-12 04:09:10,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 04:09:10,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 04:09:10,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:09:10,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 04:09:10,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2022-07-12 04:09:10,881 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-07-12 04:09:14,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:09:14,578 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2022-07-12 04:09:14,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 04:09:14,582 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-07-12 04:09:14,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:09:14,584 INFO L225 Difference]: With dead ends: 88 [2022-07-12 04:09:14,584 INFO L226 Difference]: Without dead ends: 70 [2022-07-12 04:09:14,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=393, Invalid=663, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 04:09:14,585 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 50 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 04:09:14,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 51 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 04:09:14,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-12 04:09:14,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-07-12 04:09:14,595 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-07-12 04:09:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2022-07-12 04:09:14,596 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 36 [2022-07-12 04:09:14,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:09:14,596 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2022-07-12 04:09:14,596 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-07-12 04:09:14,597 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-07-12 04:09:14,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-12 04:09:14,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:09:14,598 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:09:14,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 04:09:14,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:09:14,820 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:09:14,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:09:14,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1647036101, now seen corresponding path program 2 times [2022-07-12 04:09:14,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:09:14,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976281711] [2022-07-12 04:09:14,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:09:14,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:09:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:09:15,227 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:09:15,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:09:15,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976281711] [2022-07-12 04:09:15,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976281711] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 04:09:15,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269465372] [2022-07-12 04:09:15,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 04:09:15,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:09:15,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:09:15,236 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:09:15,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 04:09:15,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 04:09:15,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 04:09:15,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-12 04:09:15,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:09:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:09:15,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:09:16,755 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:09:16,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269465372] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:09:16,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 04:09:16,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 24] total 46 [2022-07-12 04:09:16,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615832592] [2022-07-12 04:09:16,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 04:09:16,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-12 04:09:16,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:09:16,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-12 04:09:16,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=1475, Unknown=0, NotChecked=0, Total=2070 [2022-07-12 04:09:16,759 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 46 states, 46 states have (on average 2.9347826086956523) internal successors, (135), 46 states have internal predecessors, (135), 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-07-12 04:10:32,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:10:32,286 INFO L93 Difference]: Finished difference Result 145 states and 169 transitions. [2022-07-12 04:10:32,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-12 04:10:32,287 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.9347826086956523) internal successors, (135), 46 states have internal predecessors, (135), 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-07-12 04:10:32,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:10:32,289 INFO L225 Difference]: With dead ends: 145 [2022-07-12 04:10:32,289 INFO L226 Difference]: Without dead ends: 136 [2022-07-12 04:10:32,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 75.8s TimeCoverageRelationStatistics Valid=1515, Invalid=2775, Unknown=0, NotChecked=0, Total=4290 [2022-07-12 04:10:32,291 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 104 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 04:10:32,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 115 Invalid, 1564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1462 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 04:10:32,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-12 04:10:32,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-07-12 04:10:32,310 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-07-12 04:10:32,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2022-07-12 04:10:32,312 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 69 [2022-07-12 04:10:32,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:10:32,312 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2022-07-12 04:10:32,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.9347826086956523) internal successors, (135), 46 states have internal predecessors, (135), 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-07-12 04:10:32,313 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2022-07-12 04:10:32,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-12 04:10:32,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:10:32,316 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 42, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:10:32,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 04:10:32,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:10:32,520 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:10:32,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:10:32,521 INFO L85 PathProgramCache]: Analyzing trace with hash 420755547, now seen corresponding path program 3 times [2022-07-12 04:10:32,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:10:32,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930552643] [2022-07-12 04:10:32,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:10:32,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:10:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:10:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 85 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:10:33,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:10:33,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930552643] [2022-07-12 04:10:33,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930552643] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 04:10:33,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807421756] [2022-07-12 04:10:33,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 04:10:33,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:10:33,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:10:33,720 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:10:33,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 04:10:33,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-12 04:10:33,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 04:10:33,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 04:10:33,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:10:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 208 proven. 2 refuted. 0 times theorem prover too weak. 2542 trivial. 0 not checked. [2022-07-12 04:10:34,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:10:35,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 2542 trivial. 0 not checked. [2022-07-12 04:10:35,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807421756] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:10:35,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 04:10:35,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 7, 8] total 56 [2022-07-12 04:10:35,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269543494] [2022-07-12 04:10:35,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 04:10:35,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-07-12 04:10:35,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:10:35,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-07-12 04:10:35,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=2767, Unknown=0, NotChecked=0, Total=3080 [2022-07-12 04:10:35,927 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-07-12 04:10:40,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:10:40,104 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2022-07-12 04:10:40,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-12 04:10:40,107 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-07-12 04:10:40,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:10:40,109 INFO L225 Difference]: With dead ends: 164 [2022-07-12 04:10:40,109 INFO L226 Difference]: Without dead ends: 155 [2022-07-12 04:10:40,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 259 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1361 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1188, Invalid=9524, Unknown=0, NotChecked=0, Total=10712 [2022-07-12 04:10:40,113 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 319 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5702 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 5849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 5702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-12 04:10:40,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 67 Invalid, 5849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 5702 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-12 04:10:40,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-12 04:10:40,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2022-07-12 04:10:40,126 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-07-12 04:10:40,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions. [2022-07-12 04:10:40,128 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 135 [2022-07-12 04:10:40,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:10:40,128 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions. [2022-07-12 04:10:40,128 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-07-12 04:10:40,129 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2022-07-12 04:10:40,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-12 04:10:40,130 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:10:40,130 INFO L195 NwaCegarLoop]: trace histogram [49, 49, 44, 5, 1, 1, 1, 1, 1, 1] [2022-07-12 04:10:40,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 04:10:40,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:10:40,340 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:10:40,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:10:40,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1171799301, now seen corresponding path program 4 times [2022-07-12 04:10:40,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:10:40,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085113779] [2022-07-12 04:10:40,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:10:40,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:10:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:10:41,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 625 proven. 2926 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-12 04:10:41,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:10:41,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085113779] [2022-07-12 04:10:41,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085113779] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 04:10:41,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373064333] [2022-07-12 04:10:41,415 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 04:10:41,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 04:10:41,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:10:41,416 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 04:10:41,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 04:10:41,550 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 04:10:41,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 04:10:41,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-12 04:10:41,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:10:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 502 proven. 3060 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 04:10:42,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:10:45,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 502 proven. 3060 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 04:10:45,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373064333] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:10:45,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 04:10:45,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 48, 49] total 96 [2022-07-12 04:10:45,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111353108] [2022-07-12 04:10:45,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 04:10:45,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-07-12 04:10:45,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:10:45,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-07-12 04:10:45,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2444, Invalid=6676, Unknown=0, NotChecked=0, Total=9120 [2022-07-12 04:10:45,972 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-07-12 04:10:50,239 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse0)) (<= 4294967295 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (<= 4294967295 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (<= 4294967295 .cse2) (not (<= 5000000 .cse2)))) (not (<= 5000000 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (<= 4294967295 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (<= 4294967295 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (<= 4294967295 .cse5) (not (<= 5000000 .cse5)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (<= 4294967295 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse7)) (<= 4294967295 .cse7))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (<= 4294967295 .cse8) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse9)) (<= 4294967295 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (<= 4294967295 .cse10) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse11)) (<= 4294967295 .cse11))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (<= 4294967295 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (not (<= 5000000 .cse13)) (<= 4294967295 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (not (<= 5000000 .cse14)) (<= 4294967295 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse15)) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse16)) (<= 4294967295 .cse16))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (<= 4294967295 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (<= 4294967295 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (<= 4294967295 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (<= 4294967295 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (<= 4294967295 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (<= 4294967295 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse23)) (<= 4294967295 .cse23))) (let ((.cse24 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse24) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse25)) (<= 4294967295 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse26)) (<= 4294967295 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (<= 4294967295 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse28)) (<= 4294967295 .cse28))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse29)) (<= 4294967295 .cse29))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (<= 5000000 .cse30)) (<= 4294967295 .cse30))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (<= 4294967295 .cse31) (not (<= 5000000 .cse31)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (<= 4294967295 .cse32) (not (<= 5000000 .cse32)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (<= 4294967295 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (<= 4294967295 .cse34) (not (<= 5000000 .cse34)))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (not (<= 5000000 .cse35)) (<= 4294967295 .cse35))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (<= 4294967295 .cse36) (not (<= 5000000 .cse36)))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (<= 4294967295 .cse37) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (<= 4294967295 .cse38) (not (<= 5000000 .cse38)))) (let ((.cse39 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse39) (not (<= 5000000 .cse39)))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (not (<= 5000000 .cse40)) (<= 4294967295 .cse40))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (<= 4294967295 .cse41) (not (<= 5000000 .cse41)))) (let ((.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (<= 4294967295 .cse42) (not (<= 5000000 .cse42)))) (let ((.cse43 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (<= 4294967295 .cse43) (not (<= 5000000 .cse43)))) (let ((.cse44 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse44)) (<= 4294967295 .cse44)))) is different from false [2022-07-12 04:10:52,291 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse0)) (<= 4294967295 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (<= 4294967295 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (<= 4294967295 .cse2) (not (<= 5000000 .cse2)))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (<= 4294967295 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (<= 4294967295 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (<= 4294967295 .cse5) (not (<= 5000000 .cse5)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse6)) (<= 4294967295 .cse6))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (<= 4294967295 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse8)) (<= 4294967295 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (<= 4294967295 .cse9) (not (<= 5000000 .cse9)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse10)) (<= 4294967295 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (<= 4294967295 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (not (<= 5000000 .cse12)) (<= 4294967295 .cse12))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (not (<= 5000000 .cse13)) (<= 4294967295 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse14)) (<= 4294967295 .cse14))) (let ((.cse15 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse15)) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (<= 4294967295 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (<= 4294967295 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (<= 4294967295 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (<= 4294967295 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (<= 4294967295 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (<= 4294967295 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse22)) (<= 4294967295 .cse22))) (let ((.cse23 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse23) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse24)) (<= 4294967295 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse25)) (<= 4294967295 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (<= 4294967295 .cse26) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse27)) (<= 4294967295 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse28)) (<= 4294967295 .cse28))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (<= 5000000 .cse29)) (<= 4294967295 .cse29))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (<= 4294967295 .cse30) (not (<= 5000000 .cse30)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (<= 4294967295 .cse31) (not (<= 5000000 .cse31)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (<= 4294967295 .cse32) (not (<= 5000000 .cse32)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (<= 4294967295 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (not (<= 5000000 .cse34)) (<= 4294967295 .cse34))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (<= 4294967295 .cse35) (not (<= 5000000 .cse35)))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (<= 4294967295 .cse36) (not (<= 5000000 .cse36)))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (<= 4294967295 .cse37) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse38) (not (<= 5000000 .cse38)))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (not (<= 5000000 .cse39)) (<= 4294967295 .cse39))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (<= 4294967295 .cse40) (not (<= 5000000 .cse40)))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (<= 4294967295 .cse41) (not (<= 5000000 .cse41)))) (let ((.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (<= 4294967295 .cse42) (not (<= 5000000 .cse42)))) (let ((.cse43 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse43)) (<= 4294967295 .cse43)))) is different from false [2022-07-12 04:10:54,309 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse0)) (<= 4294967295 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (<= 4294967295 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (<= 4294967295 .cse2) (not (<= 5000000 .cse2)))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (<= 4294967295 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (<= 4294967295 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (<= 4294967295 .cse5) (not (<= 5000000 .cse5)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (<= 4294967295 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse7)) (<= 4294967295 .cse7))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (<= 4294967295 .cse8) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse9)) (<= 4294967295 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (<= 4294967295 .cse10) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse11)) (<= 4294967295 .cse11))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (<= 4294967295 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (not (<= 5000000 .cse13)) (<= 4294967295 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (not (<= 5000000 .cse14)) (<= 4294967295 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse15)) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse16)) (<= 4294967295 .cse16))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (<= 4294967295 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (<= 4294967295 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (<= 4294967295 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (<= 4294967295 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (<= 4294967295 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (<= 4294967295 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse23)) (<= 4294967295 .cse23))) (let ((.cse24 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse24) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse25)) (<= 4294967295 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse26)) (<= 4294967295 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (<= 4294967295 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse28)) (<= 4294967295 .cse28))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse29)) (<= 4294967295 .cse29))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (<= 5000000 .cse30)) (<= 4294967295 .cse30))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (<= 4294967295 .cse31) (not (<= 5000000 .cse31)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (<= 4294967295 .cse32) (not (<= 5000000 .cse32)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (<= 4294967295 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (<= 4294967295 .cse34) (not (<= 5000000 .cse34)))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (not (<= 5000000 .cse35)) (<= 4294967295 .cse35))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (<= 4294967295 .cse36) (not (<= 5000000 .cse36)))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (<= 4294967295 .cse37) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (<= 4294967295 .cse38) (not (<= 5000000 .cse38)))) (let ((.cse39 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse39) (not (<= 5000000 .cse39)))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (not (<= 5000000 .cse40)) (<= 4294967295 .cse40))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (<= 4294967295 .cse41) (not (<= 5000000 .cse41)))) (let ((.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (<= 4294967295 .cse42) (not (<= 5000000 .cse42)))) (let ((.cse43 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse43)) (<= 4294967295 .cse43)))) is different from false [2022-07-12 04:12:12,337 WARN L233 SmtUtils]: Spent 25.58s on a formula simplification. DAG size of input: 306 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 04:12:14,356 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse0)) (<= 4294967295 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (<= 4294967295 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (<= 4294967295 .cse2) (not (<= 5000000 .cse2)))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (<= 4294967295 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (<= 4294967295 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (<= 4294967295 .cse5) (not (<= 5000000 .cse5)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (<= 4294967295 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse7)) (<= 4294967295 .cse7))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (<= 4294967295 .cse8) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse9)) (<= 4294967295 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (<= 4294967295 .cse10) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse11)) (<= 4294967295 .cse11))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (<= 4294967295 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (not (<= 5000000 .cse13)) (<= 4294967295 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (not (<= 5000000 .cse14)) (<= 4294967295 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse15)) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse16)) (<= 4294967295 .cse16))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (<= 4294967295 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (<= 4294967295 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (<= 4294967295 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (<= 4294967295 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (<= 4294967295 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse22)) (<= 4294967295 .cse22))) (let ((.cse23 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse23) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse24)) (<= 4294967295 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse25)) (<= 4294967295 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (<= 4294967295 .cse26) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse27)) (<= 4294967295 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse28)) (<= 4294967295 .cse28))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (<= 5000000 .cse29)) (<= 4294967295 .cse29))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (<= 4294967295 .cse30) (not (<= 5000000 .cse30)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (<= 4294967295 .cse31) (not (<= 5000000 .cse31)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (<= 4294967295 .cse32) (not (<= 5000000 .cse32)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (<= 4294967295 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (not (<= 5000000 .cse34)) (<= 4294967295 .cse34))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (<= 4294967295 .cse35) (not (<= 5000000 .cse35)))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (<= 4294967295 .cse36) (not (<= 5000000 .cse36)))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (<= 4294967295 .cse37) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse38) (not (<= 5000000 .cse38)))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (not (<= 5000000 .cse39)) (<= 4294967295 .cse39))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (<= 4294967295 .cse40) (not (<= 5000000 .cse40)))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (<= 4294967295 .cse41) (not (<= 5000000 .cse41)))) (let ((.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse42)) (<= 4294967295 .cse42)))) is different from false [2022-07-12 04:13:37,515 WARN L233 SmtUtils]: Spent 24.64s on a formula simplification. DAG size of input: 299 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 04:13:39,537 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse0)) (<= 4294967295 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (<= 4294967295 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (<= 4294967295 .cse2) (not (<= 5000000 .cse2)))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (<= 4294967295 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (<= 4294967295 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (<= 4294967295 .cse5) (not (<= 5000000 .cse5)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (<= 4294967295 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse7)) (<= 4294967295 .cse7))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (<= 4294967295 .cse8) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse9)) (<= 4294967295 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse10)) (<= 4294967295 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (<= 4294967295 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (not (<= 5000000 .cse12)) (<= 4294967295 .cse12))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (not (<= 5000000 .cse13)) (<= 4294967295 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse14)) (<= 4294967295 .cse14))) (let ((.cse15 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse15)) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (<= 4294967295 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (<= 4294967295 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (<= 4294967295 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (<= 4294967295 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (<= 4294967295 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse21)) (<= 4294967295 .cse21))) (let ((.cse22 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse23)) (<= 4294967295 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse24)) (<= 4294967295 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (<= 4294967295 .cse25) (not (<= 5000000 .cse25)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse26)) (<= 4294967295 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse27)) (<= 4294967295 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (<= 5000000 .cse28)) (<= 4294967295 .cse28))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (<= 4294967295 .cse29) (not (<= 5000000 .cse29)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (<= 4294967295 .cse30) (not (<= 5000000 .cse30)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (<= 4294967295 .cse31) (not (<= 5000000 .cse31)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (<= 4294967295 .cse32) (not (<= 5000000 .cse32)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (not (<= 5000000 .cse33)) (<= 4294967295 .cse33))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (<= 4294967295 .cse34) (not (<= 5000000 .cse34)))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (<= 4294967295 .cse35) (not (<= 5000000 .cse35)))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (<= 4294967295 .cse36) (not (<= 5000000 .cse36)))) (let ((.cse37 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse37) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (not (<= 5000000 .cse38)) (<= 4294967295 .cse38))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (<= 4294967295 .cse39) (not (<= 5000000 .cse39)))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (<= 4294967295 .cse40) (not (<= 5000000 .cse40)))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse41)) (<= 4294967295 .cse41)))) is different from false [2022-07-12 04:13:41,553 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse0)) (<= 4294967295 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (<= 4294967295 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (<= 4294967295 .cse2) (not (<= 5000000 .cse2)))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (<= 4294967295 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (<= 4294967295 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (<= 4294967295 .cse5) (not (<= 5000000 .cse5)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse6)) (<= 4294967295 .cse6))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (<= 4294967295 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse8)) (<= 4294967295 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse9)) (<= 4294967295 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (<= 4294967295 .cse10) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (not (<= 5000000 .cse11)) (<= 4294967295 .cse11))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (not (<= 5000000 .cse12)) (<= 4294967295 .cse12))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse13)) (<= 4294967295 .cse13))) (let ((.cse14 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse14)) (<= 4294967295 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (<= 4294967295 .cse15) (not (<= 5000000 .cse15)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (<= 4294967295 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (<= 4294967295 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (<= 4294967295 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (<= 4294967295 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse20)) (<= 4294967295 .cse20))) (let ((.cse21 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse22)) (<= 4294967295 .cse22))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse23)) (<= 4294967295 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (<= 4294967295 .cse24) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse25)) (<= 4294967295 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse26)) (<= 4294967295 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (<= 5000000 .cse27)) (<= 4294967295 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (<= 4294967295 .cse28) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (<= 4294967295 .cse29) (not (<= 5000000 .cse29)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (<= 4294967295 .cse30) (not (<= 5000000 .cse30)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (<= 4294967295 .cse31) (not (<= 5000000 .cse31)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (not (<= 5000000 .cse32)) (<= 4294967295 .cse32))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (<= 4294967295 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (<= 4294967295 .cse34) (not (<= 5000000 .cse34)))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (<= 4294967295 .cse35) (not (<= 5000000 .cse35)))) (let ((.cse36 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse36) (not (<= 5000000 .cse36)))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (not (<= 5000000 .cse37)) (<= 4294967295 .cse37))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (<= 4294967295 .cse38) (not (<= 5000000 .cse38)))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (<= 4294967295 .cse39) (not (<= 5000000 .cse39)))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse40)) (<= 4294967295 .cse40)))) is different from false [2022-07-12 04:13:43,564 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse0)) (<= 4294967295 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (<= 4294967295 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (<= 4294967295 .cse2) (not (<= 5000000 .cse2)))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (<= 4294967295 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (<= 4294967295 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (<= 4294967295 .cse5) (not (<= 5000000 .cse5)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (<= 4294967295 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse7)) (<= 4294967295 .cse7))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (<= 4294967295 .cse8) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse9)) (<= 4294967295 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse10)) (<= 4294967295 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (<= 4294967295 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (not (<= 5000000 .cse12)) (<= 4294967295 .cse12))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (not (<= 5000000 .cse13)) (<= 4294967295 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse14)) (<= 4294967295 .cse14))) (let ((.cse15 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse15)) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (<= 4294967295 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (<= 4294967295 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (<= 4294967295 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (<= 4294967295 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (<= 4294967295 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse21)) (<= 4294967295 .cse21))) (let ((.cse22 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse23)) (<= 4294967295 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse24)) (<= 4294967295 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (<= 4294967295 .cse25) (not (<= 5000000 .cse25)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse26)) (<= 4294967295 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse27)) (<= 4294967295 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (<= 5000000 .cse28)) (<= 4294967295 .cse28))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (<= 4294967295 .cse29) (not (<= 5000000 .cse29)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (<= 4294967295 .cse30) (not (<= 5000000 .cse30)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (<= 4294967295 .cse31) (not (<= 5000000 .cse31)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (<= 4294967295 .cse32) (not (<= 5000000 .cse32)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (<= 4294967295 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (<= 4294967295 .cse34) (not (<= 5000000 .cse34)))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (<= 4294967295 .cse35) (not (<= 5000000 .cse35)))) (let ((.cse36 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse36) (not (<= 5000000 .cse36)))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (not (<= 5000000 .cse37)) (<= 4294967295 .cse37))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (<= 4294967295 .cse38) (not (<= 5000000 .cse38)))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (<= 4294967295 .cse39) (not (<= 5000000 .cse39)))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse40)) (<= 4294967295 .cse40)))) is different from false [2022-07-12 04:13:45,576 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse0)) (<= 4294967295 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (<= 4294967295 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (<= 4294967295 .cse2) (not (<= 5000000 .cse2)))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (<= 4294967295 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (<= 4294967295 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (<= 4294967295 .cse5) (not (<= 5000000 .cse5)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse6)) (<= 4294967295 .cse6))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (<= 4294967295 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse8)) (<= 4294967295 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse9)) (<= 4294967295 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (<= 4294967295 .cse10) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (not (<= 5000000 .cse11)) (<= 4294967295 .cse11))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (not (<= 5000000 .cse12)) (<= 4294967295 .cse12))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse13)) (<= 4294967295 .cse13))) (let ((.cse14 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse14)) (<= 4294967295 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (<= 4294967295 .cse15) (not (<= 5000000 .cse15)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (<= 4294967295 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (<= 4294967295 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (<= 4294967295 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (<= 4294967295 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse20)) (<= 4294967295 .cse20))) (let ((.cse21 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse22)) (<= 4294967295 .cse22))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse23)) (<= 4294967295 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (<= 4294967295 .cse24) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse25)) (<= 4294967295 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse26)) (<= 4294967295 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (<= 5000000 .cse27)) (<= 4294967295 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (<= 4294967295 .cse28) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (<= 4294967295 .cse29) (not (<= 5000000 .cse29)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (<= 4294967295 .cse30) (not (<= 5000000 .cse30)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (<= 4294967295 .cse31) (not (<= 5000000 .cse31)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (<= 4294967295 .cse32) (not (<= 5000000 .cse32)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (<= 4294967295 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (<= 4294967295 .cse34) (not (<= 5000000 .cse34)))) (let ((.cse35 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse35) (not (<= 5000000 .cse35)))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (not (<= 5000000 .cse36)) (<= 4294967295 .cse36))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (<= 4294967295 .cse37) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (<= 4294967295 .cse38) (not (<= 5000000 .cse38)))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse39)) (<= 4294967295 .cse39)))) is different from false