./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 7e70badd Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/mono-crafted_8.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G --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.1-dev-7e70bad [2021-11-23 12:31:03,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 12:31:03,264 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 12:31:03,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 12:31:03,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 12:31:03,304 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 12:31:03,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 12:31:03,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 12:31:03,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 12:31:03,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 12:31:03,316 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 12:31:03,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 12:31:03,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 12:31:03,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 12:31:03,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 12:31:03,325 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 12:31:03,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 12:31:03,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 12:31:03,331 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 12:31:03,334 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 12:31:03,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 12:31:03,339 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 12:31:03,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 12:31:03,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 12:31:03,347 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 12:31:03,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 12:31:03,360 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 12:31:03,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 12:31:03,362 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 12:31:03,363 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 12:31:03,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 12:31:03,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 12:31:03,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 12:31:03,366 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 12:31:03,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 12:31:03,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 12:31:03,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 12:31:03,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 12:31:03,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 12:31:03,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 12:31:03,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 12:31:03,373 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-23 12:31:03,403 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 12:31:03,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 12:31:03,404 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 12:31:03,404 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 12:31:03,406 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 12:31:03,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 12:31:03,406 INFO L138 SettingsManager]: * Use SBE=true [2021-11-23 12:31:03,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 12:31:03,407 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 12:31:03,407 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 12:31:03,407 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 12:31:03,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 12:31:03,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 12:31:03,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 12:31:03,409 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 12:31:03,409 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 12:31:03,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 12:31:03,409 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 12:31:03,410 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 12:31:03,410 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 12:31:03,410 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 12:31:03,411 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 12:31:03,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 12:31:03,411 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 12:31:03,411 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 12:31:03,412 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 12:31:03,412 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-23 12:31:03,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 12:31:03,413 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-23 12:31:03,413 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-23 12:31:03,413 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 12:31:03,413 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 12:31:03,414 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G 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 [2021-11-23 12:31:03,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 12:31:03,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 12:31:03,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 12:31:03,817 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 12:31:03,818 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 12:31:03,820 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/../../sv-benchmarks/c/loops-crafted-1/mono-crafted_8.c [2021-11-23 12:31:03,920 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/data/0ae7eb805/bea904dc936f4c24b43422a490414468/FLAGc7e8ed032 [2021-11-23 12:31:04,487 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 12:31:04,488 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/sv-benchmarks/c/loops-crafted-1/mono-crafted_8.c [2021-11-23 12:31:04,502 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/data/0ae7eb805/bea904dc936f4c24b43422a490414468/FLAGc7e8ed032 [2021-11-23 12:31:04,829 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/data/0ae7eb805/bea904dc936f4c24b43422a490414468 [2021-11-23 12:31:04,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 12:31:04,836 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 12:31:04,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 12:31:04,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 12:31:04,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 12:31:04,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:31:04" (1/1) ... [2021-11-23 12:31:04,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f8c043a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:04, skipping insertion in model container [2021-11-23 12:31:04,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:31:04" (1/1) ... [2021-11-23 12:31:04,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 12:31:04,880 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 12:31:05,167 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/sv-benchmarks/c/loops-crafted-1/mono-crafted_8.c[318,331] [2021-11-23 12:31:05,190 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 12:31:05,206 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 12:31:05,223 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/sv-benchmarks/c/loops-crafted-1/mono-crafted_8.c[318,331] [2021-11-23 12:31:05,228 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 12:31:05,245 INFO L208 MainTranslator]: Completed translation [2021-11-23 12:31:05,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:05 WrapperNode [2021-11-23 12:31:05,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 12:31:05,251 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 12:31:05,251 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 12:31:05,251 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 12:31:05,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:05" (1/1) ... [2021-11-23 12:31:05,269 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:05" (1/1) ... [2021-11-23 12:31:05,291 INFO L137 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2021-11-23 12:31:05,291 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 12:31:05,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 12:31:05,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 12:31:05,293 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 12:31:05,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:05" (1/1) ... [2021-11-23 12:31:05,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:05" (1/1) ... [2021-11-23 12:31:05,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:05" (1/1) ... [2021-11-23 12:31:05,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:05" (1/1) ... [2021-11-23 12:31:05,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:05" (1/1) ... [2021-11-23 12:31:05,317 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:05" (1/1) ... [2021-11-23 12:31:05,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:05" (1/1) ... [2021-11-23 12:31:05,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 12:31:05,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 12:31:05,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 12:31:05,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 12:31:05,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:05" (1/1) ... [2021-11-23 12:31:05,344 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 12:31:05,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:31:05,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 12:31:05,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 12:31:05,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 12:31:05,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 12:31:05,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 12:31:05,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 12:31:05,510 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 12:31:05,513 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 12:31:05,679 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 12:31:05,686 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 12:31:05,697 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 12:31:05,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:31:05 BoogieIcfgContainer [2021-11-23 12:31:05,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 12:31:05,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 12:31:05,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 12:31:05,709 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 12:31:05,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:31:04" (1/3) ... [2021-11-23 12:31:05,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e94960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:31:05, skipping insertion in model container [2021-11-23 12:31:05,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:05" (2/3) ... [2021-11-23 12:31:05,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e94960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:31:05, skipping insertion in model container [2021-11-23 12:31:05,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:31:05" (3/3) ... [2021-11-23 12:31:05,713 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_8.c [2021-11-23 12:31:05,720 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 12:31:05,720 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-23 12:31:05,795 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 12:31:05,808 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 12:31:05,809 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-23 12:31:05,832 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) [2021-11-23 12:31:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-23 12:31:05,852 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:31:05,852 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-23 12:31:05,853 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 12:31:05,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:31:05,861 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2021-11-23 12:31:05,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:31:05,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800515452] [2021-11-23 12:31:05,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:31:05,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:31:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:31:06,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:31:06,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:31:06,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800515452] [2021-11-23 12:31:06,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800515452] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:31:06,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:31:06,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 12:31:06,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026579819] [2021-11-23 12:31:06,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:31:06,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-23 12:31:06,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:31:06,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-23 12:31:06,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-23 12:31:06,106 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) [2021-11-23 12:31:06,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:31:06,126 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2021-11-23 12:31:06,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-23 12:31:06,129 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 [2021-11-23 12:31:06,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:31:06,139 INFO L225 Difference]: With dead ends: 21 [2021-11-23 12:31:06,141 INFO L226 Difference]: Without dead ends: 9 [2021-11-23 12:31:06,145 INFO L932 BasicCegarLoop]: 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 [2021-11-23 12:31:06,151 INFO L933 BasicCegarLoop]: 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 [2021-11-23 12:31:06,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 12:31:06,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2021-11-23 12:31:06,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-11-23 12:31:06,192 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) [2021-11-23 12:31:06,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2021-11-23 12:31:06,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2021-11-23 12:31:06,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:31:06,197 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-11-23 12:31:06,197 INFO L471 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) [2021-11-23 12:31:06,197 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2021-11-23 12:31:06,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-23 12:31:06,198 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:31:06,199 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-23 12:31:06,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 12:31:06,200 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 12:31:06,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:31:06,203 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2021-11-23 12:31:06,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:31:06,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926525282] [2021-11-23 12:31:06,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:31:06,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:31:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:31:06,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:31:06,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:31:06,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926525282] [2021-11-23 12:31:06,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926525282] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:31:06,428 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:31:06,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 12:31:06,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766877050] [2021-11-23 12:31:06,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:31:06,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 12:31:06,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:31:06,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 12:31:06,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 12:31:06,432 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) [2021-11-23 12:31:06,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:31:06,453 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2021-11-23 12:31:06,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 12:31:06,454 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 [2021-11-23 12:31:06,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:31:06,454 INFO L225 Difference]: With dead ends: 19 [2021-11-23 12:31:06,455 INFO L226 Difference]: Without dead ends: 12 [2021-11-23 12:31:06,455 INFO L932 BasicCegarLoop]: 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 [2021-11-23 12:31:06,457 INFO L933 BasicCegarLoop]: 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 [2021-11-23 12:31:06,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 12:31:06,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-11-23 12:31:06,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2021-11-23 12:31:06,462 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) [2021-11-23 12:31:06,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2021-11-23 12:31:06,463 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2021-11-23 12:31:06,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:31:06,463 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-11-23 12:31:06,463 INFO L471 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) [2021-11-23 12:31:06,464 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2021-11-23 12:31:06,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-23 12:31:06,464 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:31:06,465 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:31:06,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 12:31:06,465 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 12:31:06,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:31:06,466 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2021-11-23 12:31:06,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:31:06,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802158350] [2021-11-23 12:31:06,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:31:06,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:31:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:31:06,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:31:06,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:31:06,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802158350] [2021-11-23 12:31:06,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802158350] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:31:06,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48041792] [2021-11-23 12:31:06,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:31:06,620 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:31:06,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:31:06,622 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:31:06,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 12:31:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:31:06,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-23 12:31:06,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:31:06,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:31:06,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 12:31:06,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:31:06,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48041792] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 12:31:06,938 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 12:31:06,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2021-11-23 12:31:06,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113857886] [2021-11-23 12:31:06,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 12:31:06,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 12:31:06,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:31:06,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 12:31:06,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-11-23 12:31:06,941 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) [2021-11-23 12:31:07,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:31:07,042 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2021-11-23 12:31:07,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 12:31:07,043 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 [2021-11-23 12:31:07,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:31:07,044 INFO L225 Difference]: With dead ends: 26 [2021-11-23 12:31:07,044 INFO L226 Difference]: Without dead ends: 19 [2021-11-23 12:31:07,044 INFO L932 BasicCegarLoop]: 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 [2021-11-23 12:31:07,046 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 15 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 12:31:07,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 14 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 12:31:07,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-23 12:31:07,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-11-23 12:31:07,052 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) [2021-11-23 12:31:07,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2021-11-23 12:31:07,053 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 9 [2021-11-23 12:31:07,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:31:07,053 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2021-11-23 12:31:07,053 INFO L471 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) [2021-11-23 12:31:07,054 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2021-11-23 12:31:07,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-23 12:31:07,055 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:31:07,055 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2021-11-23 12:31:07,092 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 12:31:07,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-11-23 12:31:07,280 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 12:31:07,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:31:07,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1171899538, now seen corresponding path program 2 times [2021-11-23 12:31:07,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:31:07,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359699523] [2021-11-23 12:31:07,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:31:07,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:31:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:31:07,563 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:31:07,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:31:07,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359699523] [2021-11-23 12:31:07,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359699523] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:31:07,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208449674] [2021-11-23 12:31:07,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-23 12:31:07,565 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:31:07,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:31:07,568 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:31:07,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 12:31:07,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-23 12:31:07,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 12:31:07,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-23 12:31:07,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:31:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:31:07,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 12:31:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:31:08,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208449674] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 12:31:08,488 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 12:31:08,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 19 [2021-11-23 12:31:08,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498760717] [2021-11-23 12:31:08,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 12:31:08,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-23 12:31:08,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:31:08,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-23 12:31:08,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2021-11-23 12:31:08,492 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) [2021-11-23 12:31:09,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:31:09,874 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2021-11-23 12:31:09,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-23 12:31:09,876 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 [2021-11-23 12:31:09,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:31:09,877 INFO L225 Difference]: With dead ends: 46 [2021-11-23 12:31:09,877 INFO L226 Difference]: Without dead ends: 37 [2021-11-23 12:31:09,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=210, Invalid=342, Unknown=0, NotChecked=0, Total=552 [2021-11-23 12:31:09,881 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 75 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2021-11-23 12:31:09,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 32 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 12:31:09,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-11-23 12:31:09,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-11-23 12:31:09,918 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) [2021-11-23 12:31:09,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2021-11-23 12:31:09,922 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 18 [2021-11-23 12:31:09,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:31:09,924 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2021-11-23 12:31:09,924 INFO L471 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) [2021-11-23 12:31:09,924 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2021-11-23 12:31:09,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 12:31:09,927 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:31:09,927 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2021-11-23 12:31:09,969 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-23 12:31:10,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:31:10,147 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 12:31:10,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:31:10,148 INFO L85 PathProgramCache]: Analyzing trace with hash -51731342, now seen corresponding path program 3 times [2021-11-23 12:31:10,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:31:10,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145673394] [2021-11-23 12:31:10,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:31:10,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:31:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:31:10,723 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:31:10,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:31:10,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145673394] [2021-11-23 12:31:10,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145673394] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:31:10,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128866536] [2021-11-23 12:31:10,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 12:31:10,724 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:31:10,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:31:10,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:31:10,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-23 12:31:10,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-23 12:31:10,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 12:31:10,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-23 12:31:10,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:31:10,995 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-11-23 12:31:10,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 12:31:10,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128866536] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:31:10,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 12:31:10,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2021-11-23 12:31:10,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710299576] [2021-11-23 12:31:10,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:31:10,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 12:31:10,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:31:10,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 12:31:10,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2021-11-23 12:31:10,999 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) [2021-11-23 12:31:11,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:31:11,063 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2021-11-23 12:31:11,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 12:31:11,063 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 [2021-11-23 12:31:11,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:31:11,065 INFO L225 Difference]: With dead ends: 63 [2021-11-23 12:31:11,066 INFO L226 Difference]: Without dead ends: 59 [2021-11-23 12:31:11,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-11-23 12:31:11,068 INFO L933 BasicCegarLoop]: 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 [2021-11-23 12:31:11,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 12 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 12:31:11,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-11-23 12:31:11,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2021-11-23 12:31:11,078 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) [2021-11-23 12:31:11,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2021-11-23 12:31:11,079 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 36 [2021-11-23 12:31:11,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:31:11,080 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2021-11-23 12:31:11,080 INFO L471 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) [2021-11-23 12:31:11,080 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2021-11-23 12:31:11,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 12:31:11,082 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:31:11,082 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:31:11,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-23 12:31:11,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:31:11,308 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 12:31:11,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:31:11,309 INFO L85 PathProgramCache]: Analyzing trace with hash -108989644, now seen corresponding path program 1 times [2021-11-23 12:31:11,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:31:11,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661056381] [2021-11-23 12:31:11,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:31:11,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:31:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:31:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:31:11,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:31:11,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661056381] [2021-11-23 12:31:11,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661056381] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:31:11,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664631062] [2021-11-23 12:31:11,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:31:11,554 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:31:11,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:31:11,560 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:31:11,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-23 12:31:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:31:11,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-23 12:31:11,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:31:11,831 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:31:11,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 12:31:12,333 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:31:12,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664631062] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 12:31:12,334 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 12:31:12,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 24 [2021-11-23 12:31:12,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819239828] [2021-11-23 12:31:12,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 12:31:12,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-23 12:31:12,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:31:12,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-23 12:31:12,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2021-11-23 12:31:12,336 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) [2021-11-23 12:31:19,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:31:19,027 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2021-11-23 12:31:19,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-23 12:31:19,028 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 [2021-11-23 12:31:19,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:31:19,030 INFO L225 Difference]: With dead ends: 88 [2021-11-23 12:31:19,030 INFO L226 Difference]: Without dead ends: 70 [2021-11-23 12:31:19,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=393, Invalid=663, Unknown=0, NotChecked=0, Total=1056 [2021-11-23 12:31:19,032 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 50 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2021-11-23 12:31:19,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 51 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 12:31:19,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-11-23 12:31:19,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-11-23 12:31:19,045 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) [2021-11-23 12:31:19,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2021-11-23 12:31:19,049 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 36 [2021-11-23 12:31:19,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:31:19,049 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2021-11-23 12:31:19,049 INFO L471 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) [2021-11-23 12:31:19,050 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2021-11-23 12:31:19,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-23 12:31:19,052 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:31:19,052 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:31:19,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-23 12:31:19,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-23 12:31:19,253 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 12:31:19,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:31:19,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1647036101, now seen corresponding path program 2 times [2021-11-23 12:31:19,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:31:19,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326037906] [2021-11-23 12:31:19,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:31:19,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:31:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:31:19,811 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:31:19,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:31:19,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326037906] [2021-11-23 12:31:19,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326037906] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:31:19,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602300049] [2021-11-23 12:31:19,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-23 12:31:19,812 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:31:19,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:31:19,813 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:31:19,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-23 12:31:19,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-23 12:31:19,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 12:31:19,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-23 12:31:19,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:31:20,355 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:31:20,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 12:31:22,318 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:31:22,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602300049] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 12:31:22,319 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 12:31:22,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 24] total 46 [2021-11-23 12:31:22,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458274745] [2021-11-23 12:31:22,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 12:31:22,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-11-23 12:31:22,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:31:22,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-11-23 12:31:22,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=1475, Unknown=0, NotChecked=0, Total=2070 [2021-11-23 12:31:22,323 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) [2021-11-23 12:31:37,635 WARN L227 SmtUtils]: Spent 5.58s on a formula simplification. DAG size of input: 127 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 12:33:24,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:33:24,349 INFO L93 Difference]: Finished difference Result 145 states and 169 transitions. [2021-11-23 12:33:24,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-11-23 12:33:24,350 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 [2021-11-23 12:33:24,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:33:24,352 INFO L225 Difference]: With dead ends: 145 [2021-11-23 12:33:24,353 INFO L226 Difference]: Without dead ends: 136 [2021-11-23 12:33:24,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 122.7s TimeCoverageRelationStatistics Valid=1512, Invalid=2774, Unknown=4, NotChecked=0, Total=4290 [2021-11-23 12:33:24,357 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 104 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-23 12:33:24,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 115 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-23 12:33:24,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-11-23 12:33:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2021-11-23 12:33:24,372 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) [2021-11-23 12:33:24,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2021-11-23 12:33:24,375 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 69 [2021-11-23 12:33:24,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:33:24,376 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2021-11-23 12:33:24,376 INFO L471 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) [2021-11-23 12:33:24,376 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2021-11-23 12:33:24,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-11-23 12:33:24,379 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:33:24,379 INFO L514 BasicCegarLoop]: trace histogram [43, 43, 42, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:33:24,413 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-11-23 12:33:24,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:33:24,596 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 12:33:24,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:33:24,597 INFO L85 PathProgramCache]: Analyzing trace with hash 420755547, now seen corresponding path program 3 times [2021-11-23 12:33:24,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:33:24,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358492606] [2021-11-23 12:33:24,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:33:24,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:33:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:33:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 85 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:33:26,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:33:26,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358492606] [2021-11-23 12:33:26,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358492606] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:33:26,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226218978] [2021-11-23 12:33:26,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 12:33:26,205 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:33:26,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:33:26,208 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:33:26,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-23 12:33:26,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-23 12:33:26,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 12:33:26,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-23 12:33:26,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:33:27,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 208 proven. 2 refuted. 0 times theorem prover too weak. 2542 trivial. 0 not checked. [2021-11-23 12:33:27,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 12:33:32,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 2542 trivial. 0 not checked. [2021-11-23 12:33:32,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226218978] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 12:33:32,496 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 12:33:32,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 7, 8] total 56 [2021-11-23 12:33:32,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768642623] [2021-11-23 12:33:32,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 12:33:32,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2021-11-23 12:33:32,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:33:32,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-11-23 12:33:32,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=2767, Unknown=0, NotChecked=0, Total=3080 [2021-11-23 12:33:32,500 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) [2021-11-23 12:33:38,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:33:38,145 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2021-11-23 12:33:38,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-11-23 12:33:38,145 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 [2021-11-23 12:33:38,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:33:38,148 INFO L225 Difference]: With dead ends: 164 [2021-11-23 12:33:38,148 INFO L226 Difference]: Without dead ends: 155 [2021-11-23 12:33:38,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1188, Invalid=9524, Unknown=0, NotChecked=0, Total=10712 [2021-11-23 12:33:38,154 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 319 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5702 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.8s IncrementalHoareTripleChecker+Time [2021-11-23 12:33:38,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 67 Invalid, 5849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 5702 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-11-23 12:33:38,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-11-23 12:33:38,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2021-11-23 12:33:38,171 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) [2021-11-23 12:33:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions. [2021-11-23 12:33:38,174 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 135 [2021-11-23 12:33:38,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:33:38,175 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions. [2021-11-23 12:33:38,175 INFO L471 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) [2021-11-23 12:33:38,175 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2021-11-23 12:33:38,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-11-23 12:33:38,179 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:33:38,179 INFO L514 BasicCegarLoop]: trace histogram [49, 49, 44, 5, 1, 1, 1, 1, 1, 1] [2021-11-23 12:33:38,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-23 12:33:38,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:33:38,383 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 12:33:38,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:33:38,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1171799301, now seen corresponding path program 4 times [2021-11-23 12:33:38,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:33:38,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331859995] [2021-11-23 12:33:38,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:33:38,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:33:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:33:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 625 proven. 2926 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-23 12:33:39,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:33:39,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331859995] [2021-11-23 12:33:39,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331859995] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 12:33:39,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427452889] [2021-11-23 12:33:39,787 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 12:33:39,787 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 12:33:39,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:33:39,788 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 12:33:39,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9940285d-2c5c-4304-ac95-97f81a9ff15d/bin/uautomizer-wIGwrQj20G/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-23 12:33:39,930 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 12:33:39,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 12:33:39,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 94 conjunts are in the unsatisfiable core [2021-11-23 12:33:39,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 12:33:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 502 proven. 3060 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-23 12:33:40,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 12:33:46,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 502 proven. 3060 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-23 12:33:46,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427452889] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 12:33:46,428 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 12:33:46,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 48, 49] total 96 [2021-11-23 12:33:46,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529086828] [2021-11-23 12:33:46,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 12:33:46,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2021-11-23 12:33:46,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:33:46,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2021-11-23 12:33:46,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2444, Invalid=6676, Unknown=0, NotChecked=0, Total=9120 [2021-11-23 12:33:46,436 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) [2021-11-23 12:33:51,178 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 31 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse0) (< .cse0 5000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (<= 4294967295 .cse1) (< .cse1 5000000))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< .cse2 5000000) (<= 4294967295 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (<= 4294967295 .cse3) (< .cse3 5000000))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse4 5000000) (<= 4294967295 .cse4))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< .cse5 5000000) (<= 4294967295 .cse5))) (let ((.cse6 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse6) (< .cse6 5000000))) (let ((.cse7 (mod (+ 35 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse7) (< .cse7 5000000))) (let ((.cse8 (mod (+ 2 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse8) (< .cse8 5000000))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (<= 4294967295 .cse9) (< .cse9 5000000))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (<= 4294967295 .cse10) (< .cse10 5000000))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse11 5000000) (<= 4294967295 .cse11))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (<= 4294967295 .cse12) (< .cse12 5000000))) (let ((.cse13 (mod (+ 29 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse13) (< .cse13 5000000))) (let ((.cse14 (mod (+ 5 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse14) (< .cse14 5000000))) (let ((.cse15 (mod (+ 22 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse15 5000000) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse16 5000000) (<= 4294967295 .cse16))) (let ((.cse17 (mod (+ 16 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse17) (< .cse17 5000000))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 5000000) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse18 5000000) (<= 4294967295 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse19 5000000) (<= 4294967295 .cse19))) (let ((.cse20 (mod (+ 6 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse20 5000000) (<= 4294967295 .cse20))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (<= 4294967295 .cse21) (< .cse21 5000000))) (let ((.cse22 (mod (+ 44 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse22) (< .cse22 5000000))) (let ((.cse23 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse23 5000000) (<= 4294967295 .cse23))) (let ((.cse24 (mod (+ 21 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse24) (< .cse24 5000000))) (let ((.cse25 (mod (+ 3 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse25 5000000) (<= 4294967295 .cse25))) (let ((.cse26 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse26 5000000) (<= 4294967295 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (<= 4294967295 .cse27) (< .cse27 5000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< .cse28 5000000) (<= 4294967295 .cse28))) (let ((.cse29 (mod (+ 32 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse29) (< .cse29 5000000))) (let ((.cse30 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse30 5000000) (<= 4294967295 .cse30))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (<= 4294967295 .cse31) (< .cse31 5000000))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse32 5000000) (<= 4294967295 .cse32))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse33 5000000) (<= 4294967295 .cse33))) (let ((.cse34 (mod (+ 9 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse34 5000000) (<= 4294967295 .cse34))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (<= 4294967295 .cse35) (< .cse35 5000000))) (let ((.cse36 (mod (+ 42 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse36) (< .cse36 5000000))) (let ((.cse37 (mod (+ 30 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse37 5000000) (<= 4294967295 .cse37))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< .cse38 5000000) (<= 4294967295 .cse38))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (< .cse39 5000000) (<= 4294967295 .cse39))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse40 5000000) (<= 4294967295 .cse40))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (<= 4294967295 .cse41) (< .cse41 5000000))) (let ((.cse42 (mod (+ 14 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse42 5000000) (<= 4294967295 .cse42))) (let ((.cse43 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse43 5000000) (<= 4294967295 .cse43))) (let ((.cse44 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (<= 4294967295 .cse44) (< .cse44 5000000)))) is different from false [2021-11-23 12:33:53,233 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 31 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse0) (< .cse0 5000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (<= 4294967295 .cse1) (< .cse1 5000000))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< .cse2 5000000) (<= 4294967295 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (<= 4294967295 .cse3) (< .cse3 5000000))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse4 5000000) (<= 4294967295 .cse4))) (let ((.cse5 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse5) (< .cse5 5000000))) (let ((.cse6 (mod (+ 35 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse6) (< .cse6 5000000))) (let ((.cse7 (mod (+ 2 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse7) (< .cse7 5000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (<= 4294967295 .cse8) (< .cse8 5000000))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (<= 4294967295 .cse9) (< .cse9 5000000))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse10 5000000) (<= 4294967295 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (<= 4294967295 .cse11) (< .cse11 5000000))) (let ((.cse12 (mod (+ 29 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse12) (< .cse12 5000000))) (let ((.cse13 (mod (+ 5 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse13) (< .cse13 5000000))) (let ((.cse14 (mod (+ 22 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse14 5000000) (<= 4294967295 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse15 5000000) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ 16 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse16) (< .cse16 5000000))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse17 5000000) (<= 4294967295 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse18 5000000) (<= 4294967295 .cse18))) (let ((.cse19 (mod (+ 6 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse19 5000000) (<= 4294967295 .cse19))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (<= 4294967295 .cse20) (< .cse20 5000000))) (let ((.cse21 (mod (+ 44 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse21) (< .cse21 5000000))) (let ((.cse22 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse22 5000000) (<= 4294967295 .cse22))) (let ((.cse23 (mod (+ 21 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse23) (< .cse23 5000000))) (let ((.cse24 (mod (+ 3 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse24 5000000) (<= 4294967295 .cse24))) (let ((.cse25 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse25 5000000) (<= 4294967295 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (<= 4294967295 .cse26) (< .cse26 5000000))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< .cse27 5000000) (<= 4294967295 .cse27))) (let ((.cse28 (mod (+ 32 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse28) (< .cse28 5000000))) (let ((.cse29 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse29 5000000) (<= 4294967295 .cse29))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (<= 4294967295 .cse30) (< .cse30 5000000))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse31 5000000) (<= 4294967295 .cse31))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse32 5000000) (<= 4294967295 .cse32))) (let ((.cse33 (mod (+ 9 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse33 5000000) (<= 4294967295 .cse33))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (<= 4294967295 .cse34) (< .cse34 5000000))) (let ((.cse35 (mod (+ 42 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse35) (< .cse35 5000000))) (let ((.cse36 (mod (+ 30 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse36 5000000) (<= 4294967295 .cse36))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< .cse37 5000000) (<= 4294967295 .cse37))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (< .cse38 5000000) (<= 4294967295 .cse38))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse39 5000000) (<= 4294967295 .cse39))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (<= 4294967295 .cse40) (< .cse40 5000000))) (let ((.cse41 (mod (+ 14 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse41 5000000) (<= 4294967295 .cse41))) (let ((.cse42 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse42 5000000) (<= 4294967295 .cse42))) (let ((.cse43 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (<= 4294967295 .cse43) (< .cse43 5000000)))) is different from false [2021-11-23 12:35:31,993 WARN L227 SmtUtils]: Spent 32.36s on a formula simplification. DAG size of input: 269 DAG size of output: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 12:37:09,548 WARN L227 SmtUtils]: Spent 40.07s on a formula simplification. DAG size of input: 271 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 12:37:11,612 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 31 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse0) (< .cse0 5000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (<= 4294967295 .cse1) (< .cse1 5000000))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< .cse2 5000000) (<= 4294967295 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (<= 4294967295 .cse3) (< .cse3 5000000))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse4 5000000) (<= 4294967295 .cse4))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< .cse5 5000000) (<= 4294967295 .cse5))) (let ((.cse6 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse6) (< .cse6 5000000))) (let ((.cse7 (mod (+ 35 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse7) (< .cse7 5000000))) (let ((.cse8 (mod (+ 2 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse8) (< .cse8 5000000))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (<= 4294967295 .cse9) (< .cse9 5000000))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (<= 4294967295 .cse10) (< .cse10 5000000))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse11 5000000) (<= 4294967295 .cse11))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (<= 4294967295 .cse12) (< .cse12 5000000))) (let ((.cse13 (mod (+ 29 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse13) (< .cse13 5000000))) (let ((.cse14 (mod (+ 5 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse14) (< .cse14 5000000))) (let ((.cse15 (mod (+ 22 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse15 5000000) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse16 5000000) (<= 4294967295 .cse16))) (let ((.cse17 (mod (+ 16 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse17) (< .cse17 5000000))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse18 5000000) (<= 4294967295 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse19 5000000) (<= 4294967295 .cse19))) (let ((.cse20 (mod (+ 6 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse20 5000000) (<= 4294967295 .cse20))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (<= 4294967295 .cse21) (< .cse21 5000000))) (let ((.cse22 (mod (+ 44 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse22) (< .cse22 5000000))) (let ((.cse23 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse23 5000000) (<= 4294967295 .cse23))) (let ((.cse24 (mod (+ 21 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse24) (< .cse24 5000000))) (let ((.cse25 (mod (+ 3 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse25 5000000) (<= 4294967295 .cse25))) (let ((.cse26 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse26 5000000) (<= 4294967295 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (<= 4294967295 .cse27) (< .cse27 5000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< .cse28 5000000) (<= 4294967295 .cse28))) (let ((.cse29 (mod (+ 32 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse29) (< .cse29 5000000))) (let ((.cse30 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse30 5000000) (<= 4294967295 .cse30))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (<= 4294967295 .cse31) (< .cse31 5000000))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse32 5000000) (<= 4294967295 .cse32))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse33 5000000) (<= 4294967295 .cse33))) (let ((.cse34 (mod (+ 9 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse34 5000000) (<= 4294967295 .cse34))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (<= 4294967295 .cse35) (< .cse35 5000000))) (let ((.cse36 (mod (+ 42 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse36) (< .cse36 5000000))) (let ((.cse37 (mod (+ 30 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse37 5000000) (<= 4294967295 .cse37))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< .cse38 5000000) (<= 4294967295 .cse38))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (< .cse39 5000000) (<= 4294967295 .cse39))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse40 5000000) (<= 4294967295 .cse40))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (<= 4294967295 .cse41) (< .cse41 5000000))) (let ((.cse42 (mod (+ 14 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse42 5000000) (<= 4294967295 .cse42))) (let ((.cse43 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse43 5000000) (<= 4294967295 .cse43))) (let ((.cse44 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (<= 4294967295 .cse44) (< .cse44 5000000)))) is different from false [2021-11-23 12:37:13,631 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 31 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse0) (< .cse0 5000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (<= 4294967295 .cse1) (< .cse1 5000000))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< .cse2 5000000) (<= 4294967295 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse3 5000000) (<= 4294967295 .cse3))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< .cse4 5000000) (<= 4294967295 .cse4))) (let ((.cse5 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse5) (< .cse5 5000000))) (let ((.cse6 (mod (+ 35 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse6) (< .cse6 5000000))) (let ((.cse7 (mod (+ 2 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse7) (< .cse7 5000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (<= 4294967295 .cse8) (< .cse8 5000000))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (<= 4294967295 .cse9) (< .cse9 5000000))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse10 5000000) (<= 4294967295 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (<= 4294967295 .cse11) (< .cse11 5000000))) (let ((.cse12 (mod (+ 29 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse12) (< .cse12 5000000))) (let ((.cse13 (mod (+ 5 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse13) (< .cse13 5000000))) (let ((.cse14 (mod (+ 22 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse14 5000000) (<= 4294967295 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse15 5000000) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ 16 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse16) (< .cse16 5000000))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 5000000) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse17 5000000) (<= 4294967295 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse18 5000000) (<= 4294967295 .cse18))) (let ((.cse19 (mod (+ 6 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse19 5000000) (<= 4294967295 .cse19))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (<= 4294967295 .cse20) (< .cse20 5000000))) (let ((.cse21 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse21 5000000) (<= 4294967295 .cse21))) (let ((.cse22 (mod (+ 21 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse22) (< .cse22 5000000))) (let ((.cse23 (mod (+ 3 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse23 5000000) (<= 4294967295 .cse23))) (let ((.cse24 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse24 5000000) (<= 4294967295 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (<= 4294967295 .cse25) (< .cse25 5000000))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< .cse26 5000000) (<= 4294967295 .cse26))) (let ((.cse27 (mod (+ 32 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse27) (< .cse27 5000000))) (let ((.cse28 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse28 5000000) (<= 4294967295 .cse28))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (<= 4294967295 .cse29) (< .cse29 5000000))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse30 5000000) (<= 4294967295 .cse30))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse31 5000000) (<= 4294967295 .cse31))) (let ((.cse32 (mod (+ 9 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse32 5000000) (<= 4294967295 .cse32))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (<= 4294967295 .cse33) (< .cse33 5000000))) (let ((.cse34 (mod (+ 42 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse34) (< .cse34 5000000))) (let ((.cse35 (mod (+ 30 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse35 5000000) (<= 4294967295 .cse35))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< .cse36 5000000) (<= 4294967295 .cse36))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (< .cse37 5000000) (<= 4294967295 .cse37))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse38 5000000) (<= 4294967295 .cse38))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (<= 4294967295 .cse39) (< .cse39 5000000))) (let ((.cse40 (mod (+ 14 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse40 5000000) (<= 4294967295 .cse40))) (let ((.cse41 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse41 5000000) (<= 4294967295 .cse41))) (let ((.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (<= 4294967295 .cse42) (< .cse42 5000000)))) is different from false [2021-11-23 12:37:15,647 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (or (< .cse0 5000000) (<= 4294967295 .cse0))) (let ((.cse1 (mod (+ 31 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse1) (< .cse1 5000000))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (<= 4294967295 .cse2) (< .cse2 5000000))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< .cse3 5000000) (<= 4294967295 .cse3))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse4 5000000) (<= 4294967295 .cse4))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< .cse5 5000000) (<= 4294967295 .cse5))) (let ((.cse6 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse6) (< .cse6 5000000))) (let ((.cse7 (mod (+ 35 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse7) (< .cse7 5000000))) (let ((.cse8 (mod (+ 2 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse8) (< .cse8 5000000))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (<= 4294967295 .cse9) (< .cse9 5000000))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (<= 4294967295 .cse10) (< .cse10 5000000))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse11 5000000) (<= 4294967295 .cse11))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (<= 4294967295 .cse12) (< .cse12 5000000))) (let ((.cse13 (mod (+ 29 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse13) (< .cse13 5000000))) (let ((.cse14 (mod (+ 5 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse14) (< .cse14 5000000))) (let ((.cse15 (mod (+ 22 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse15 5000000) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse16 5000000) (<= 4294967295 .cse16))) (let ((.cse17 (mod (+ 16 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse17) (< .cse17 5000000))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse18 5000000) (<= 4294967295 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse19 5000000) (<= 4294967295 .cse19))) (let ((.cse20 (mod (+ 6 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse20 5000000) (<= 4294967295 .cse20))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (<= 4294967295 .cse21) (< .cse21 5000000))) (let ((.cse22 (mod (+ 44 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse22) (< .cse22 5000000))) (let ((.cse23 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse23 5000000) (<= 4294967295 .cse23))) (let ((.cse24 (mod (+ 21 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse24) (< .cse24 5000000))) (let ((.cse25 (mod (+ 3 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse25 5000000) (<= 4294967295 .cse25))) (let ((.cse26 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse26 5000000) (<= 4294967295 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (<= 4294967295 .cse27) (< .cse27 5000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< .cse28 5000000) (<= 4294967295 .cse28))) (let ((.cse29 (mod (+ 32 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse29) (< .cse29 5000000))) (let ((.cse30 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse30 5000000) (<= 4294967295 .cse30))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (<= 4294967295 .cse31) (< .cse31 5000000))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse32 5000000) (<= 4294967295 .cse32))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse33 5000000) (<= 4294967295 .cse33))) (let ((.cse34 (mod (+ 9 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse34 5000000) (<= 4294967295 .cse34))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (<= 4294967295 .cse35) (< .cse35 5000000))) (let ((.cse36 (mod (+ 42 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse36) (< .cse36 5000000))) (let ((.cse37 (mod (+ 30 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse37 5000000) (<= 4294967295 .cse37))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< .cse38 5000000) (<= 4294967295 .cse38))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (< .cse39 5000000) (<= 4294967295 .cse39))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse40 5000000) (<= 4294967295 .cse40))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (<= 4294967295 .cse41) (< .cse41 5000000))) (let ((.cse42 (mod (+ 14 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse42 5000000) (<= 4294967295 .cse42))) (let ((.cse43 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse43 5000000) (<= 4294967295 .cse43))) (let ((.cse44 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (<= 4294967295 .cse44) (< .cse44 5000000)))) is different from false [2021-11-23 12:38:53,880 WARN L227 SmtUtils]: Spent 30.48s on a formula simplification. DAG size of input: 257 DAG size of output: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 12:38:56,235 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 31 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse0) (< .cse0 5000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (<= 4294967295 .cse1) (< .cse1 5000000))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< .cse2 5000000) (<= 4294967295 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse3 5000000) (<= 4294967295 .cse3))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< .cse4 5000000) (<= 4294967295 .cse4))) (let ((.cse5 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse5) (< .cse5 5000000))) (let ((.cse6 (mod (+ 35 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse6) (< .cse6 5000000))) (let ((.cse7 (mod (+ 2 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse7) (< .cse7 5000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (<= 4294967295 .cse8) (< .cse8 5000000))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (<= 4294967295 .cse9) (< .cse9 5000000))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse10 5000000) (<= 4294967295 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (<= 4294967295 .cse11) (< .cse11 5000000))) (let ((.cse12 (mod (+ 29 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse12) (< .cse12 5000000))) (let ((.cse13 (mod (+ 5 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse13) (< .cse13 5000000))) (let ((.cse14 (mod (+ 22 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse14 5000000) (<= 4294967295 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse15 5000000) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ 16 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse16) (< .cse16 5000000))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse17 5000000) (<= 4294967295 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse18 5000000) (<= 4294967295 .cse18))) (let ((.cse19 (mod (+ 6 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse19 5000000) (<= 4294967295 .cse19))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (<= 4294967295 .cse20) (< .cse20 5000000))) (let ((.cse21 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse21 5000000) (<= 4294967295 .cse21))) (let ((.cse22 (mod (+ 21 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse22) (< .cse22 5000000))) (let ((.cse23 (mod (+ 3 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse23 5000000) (<= 4294967295 .cse23))) (let ((.cse24 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse24 5000000) (<= 4294967295 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (<= 4294967295 .cse25) (< .cse25 5000000))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< .cse26 5000000) (<= 4294967295 .cse26))) (let ((.cse27 (mod (+ 32 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse27) (< .cse27 5000000))) (let ((.cse28 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse28 5000000) (<= 4294967295 .cse28))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (<= 4294967295 .cse29) (< .cse29 5000000))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse30 5000000) (<= 4294967295 .cse30))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse31 5000000) (<= 4294967295 .cse31))) (let ((.cse32 (mod (+ 9 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse32 5000000) (<= 4294967295 .cse32))) (let ((.cse33 (mod (+ 42 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse33) (< .cse33 5000000))) (let ((.cse34 (mod (+ 30 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse34 5000000) (<= 4294967295 .cse34))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< .cse35 5000000) (<= 4294967295 .cse35))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (< .cse36 5000000) (<= 4294967295 .cse36))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse37 5000000) (<= 4294967295 .cse37))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (<= 4294967295 .cse38) (< .cse38 5000000))) (let ((.cse39 (mod (+ 14 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse39 5000000) (<= 4294967295 .cse39))) (let ((.cse40 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse40 5000000) (<= 4294967295 .cse40))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (<= 4294967295 .cse41) (< .cse41 5000000)))) is different from false [2021-11-23 12:38:58,251 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 31 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse0) (< .cse0 5000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (<= 4294967295 .cse1) (< .cse1 5000000))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< .cse2 5000000) (<= 4294967295 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse3 5000000) (<= 4294967295 .cse3))) (let ((.cse4 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse4) (< .cse4 5000000))) (let ((.cse5 (mod (+ 35 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse5) (< .cse5 5000000))) (let ((.cse6 (mod (+ 2 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse6) (< .cse6 5000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (<= 4294967295 .cse7) (< .cse7 5000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (<= 4294967295 .cse8) (< .cse8 5000000))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse9 5000000) (<= 4294967295 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (<= 4294967295 .cse10) (< .cse10 5000000))) (let ((.cse11 (mod (+ 29 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse11) (< .cse11 5000000))) (let ((.cse12 (mod (+ 5 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse12) (< .cse12 5000000))) (let ((.cse13 (mod (+ 22 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse13 5000000) (<= 4294967295 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse14 5000000) (<= 4294967295 .cse14))) (let ((.cse15 (mod (+ 16 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse15) (< .cse15 5000000))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse16 5000000) (<= 4294967295 .cse16))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse17 5000000) (<= 4294967295 .cse17))) (let ((.cse18 (mod (+ 6 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse18 5000000) (<= 4294967295 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (<= 4294967295 .cse19) (< .cse19 5000000))) (let ((.cse20 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse20 5000000) (<= 4294967295 .cse20))) (let ((.cse21 (mod (+ 21 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse21) (< .cse21 5000000))) (let ((.cse22 (mod (+ 3 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse22 5000000) (<= 4294967295 .cse22))) (let ((.cse23 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse23 5000000) (<= 4294967295 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (<= 4294967295 .cse24) (< .cse24 5000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< .cse25 5000000) (<= 4294967295 .cse25))) (let ((.cse26 (mod (+ 32 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse26) (< .cse26 5000000))) (let ((.cse27 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse27 5000000) (<= 4294967295 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (<= 4294967295 .cse28) (< .cse28 5000000))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse29 5000000) (<= 4294967295 .cse29))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse30 5000000) (<= 4294967295 .cse30))) (let ((.cse31 (mod (+ 9 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse31 5000000) (<= 4294967295 .cse31))) (let ((.cse32 (mod (+ 42 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse32) (< .cse32 5000000))) (let ((.cse33 (mod (+ 30 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse33 5000000) (<= 4294967295 .cse33))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< .cse34 5000000) (<= 4294967295 .cse34))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (< .cse35 5000000) (<= 4294967295 .cse35))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse36 5000000) (<= 4294967295 .cse36))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (<= 4294967295 .cse37) (< .cse37 5000000))) (let ((.cse38 (mod (+ 14 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse38 5000000) (<= 4294967295 .cse38))) (let ((.cse39 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse39 5000000) (<= 4294967295 .cse39))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (<= 4294967295 .cse40) (< .cse40 5000000)))) is different from false [2021-11-23 12:40:55,242 WARN L227 SmtUtils]: Spent 36.48s on a formula simplification. DAG size of input: 251 DAG size of output: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 12:40:57,388 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 31 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse0) (< .cse0 5000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (<= 4294967295 .cse1) (< .cse1 5000000))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< .cse2 5000000) (<= 4294967295 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse3 5000000) (<= 4294967295 .cse3))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< .cse4 5000000) (<= 4294967295 .cse4))) (let ((.cse5 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse5) (< .cse5 5000000))) (let ((.cse6 (mod (+ 35 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse6) (< .cse6 5000000))) (let ((.cse7 (mod (+ 2 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse7) (< .cse7 5000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (<= 4294967295 .cse8) (< .cse8 5000000))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (<= 4294967295 .cse9) (< .cse9 5000000))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse10 5000000) (<= 4294967295 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (<= 4294967295 .cse11) (< .cse11 5000000))) (let ((.cse12 (mod (+ 29 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse12) (< .cse12 5000000))) (let ((.cse13 (mod (+ 5 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse13) (< .cse13 5000000))) (let ((.cse14 (mod (+ 22 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse14 5000000) (<= 4294967295 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse15 5000000) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ 16 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse16) (< .cse16 5000000))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 5000000) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse17 5000000) (<= 4294967295 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse18 5000000) (<= 4294967295 .cse18))) (let ((.cse19 (mod (+ 6 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse19 5000000) (<= 4294967295 .cse19))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (<= 4294967295 .cse20) (< .cse20 5000000))) (let ((.cse21 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse21 5000000) (<= 4294967295 .cse21))) (let ((.cse22 (mod (+ 21 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse22) (< .cse22 5000000))) (let ((.cse23 (mod (+ 3 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse23 5000000) (<= 4294967295 .cse23))) (let ((.cse24 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse24 5000000) (<= 4294967295 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (<= 4294967295 .cse25) (< .cse25 5000000))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< .cse26 5000000) (<= 4294967295 .cse26))) (let ((.cse27 (mod (+ 32 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse27) (< .cse27 5000000))) (let ((.cse28 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse28 5000000) (<= 4294967295 .cse28))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (<= 4294967295 .cse29) (< .cse29 5000000))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse30 5000000) (<= 4294967295 .cse30))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse31 5000000) (<= 4294967295 .cse31))) (let ((.cse32 (mod (+ 9 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse32 5000000) (<= 4294967295 .cse32))) (let ((.cse33 (mod (+ 30 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse33 5000000) (<= 4294967295 .cse33))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< .cse34 5000000) (<= 4294967295 .cse34))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (< .cse35 5000000) (<= 4294967295 .cse35))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse36 5000000) (<= 4294967295 .cse36))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (<= 4294967295 .cse37) (< .cse37 5000000))) (let ((.cse38 (mod (+ 14 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse38 5000000) (<= 4294967295 .cse38))) (let ((.cse39 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse39 5000000) (<= 4294967295 .cse39))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (<= 4294967295 .cse40) (< .cse40 5000000)))) is different from false [2021-11-23 12:42:54,730 WARN L227 SmtUtils]: Spent 34.25s on a formula simplification. DAG size of input: 249 DAG size of output: 13 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 12:42:56,748 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 31 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse0) (< .cse0 5000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (<= 4294967295 .cse1) (< .cse1 5000000))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< .cse2 5000000) (<= 4294967295 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse3 5000000) (<= 4294967295 .cse3))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< .cse4 5000000) (<= 4294967295 .cse4))) (let ((.cse5 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse5) (< .cse5 5000000))) (let ((.cse6 (mod (+ 35 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse6) (< .cse6 5000000))) (let ((.cse7 (mod (+ 2 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse7) (< .cse7 5000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (<= 4294967295 .cse8) (< .cse8 5000000))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (<= 4294967295 .cse9) (< .cse9 5000000))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse10 5000000) (<= 4294967295 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (<= 4294967295 .cse11) (< .cse11 5000000))) (let ((.cse12 (mod (+ 29 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse12) (< .cse12 5000000))) (let ((.cse13 (mod (+ 5 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse13) (< .cse13 5000000))) (let ((.cse14 (mod (+ 22 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse14 5000000) (<= 4294967295 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse15 5000000) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ 16 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse16) (< .cse16 5000000))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 5000000) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse17 5000000) (<= 4294967295 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse18 5000000) (<= 4294967295 .cse18))) (let ((.cse19 (mod (+ 6 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse19 5000000) (<= 4294967295 .cse19))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (<= 4294967295 .cse20) (< .cse20 5000000))) (let ((.cse21 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse21 5000000) (<= 4294967295 .cse21))) (let ((.cse22 (mod (+ 21 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse22) (< .cse22 5000000))) (let ((.cse23 (mod (+ 3 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse23 5000000) (<= 4294967295 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (<= 4294967295 .cse24) (< .cse24 5000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< .cse25 5000000) (<= 4294967295 .cse25))) (let ((.cse26 (mod (+ 32 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse26) (< .cse26 5000000))) (let ((.cse27 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse27 5000000) (<= 4294967295 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (<= 4294967295 .cse28) (< .cse28 5000000))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse29 5000000) (<= 4294967295 .cse29))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse30 5000000) (<= 4294967295 .cse30))) (let ((.cse31 (mod (+ 9 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse31 5000000) (<= 4294967295 .cse31))) (let ((.cse32 (mod (+ 30 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse32 5000000) (<= 4294967295 .cse32))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< .cse33 5000000) (<= 4294967295 .cse33))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (< .cse34 5000000) (<= 4294967295 .cse34))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse35 5000000) (<= 4294967295 .cse35))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (<= 4294967295 .cse36) (< .cse36 5000000))) (let ((.cse37 (mod (+ 14 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse37 5000000) (<= 4294967295 .cse37))) (let ((.cse38 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse38 5000000) (<= 4294967295 .cse38))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (<= 4294967295 .cse39) (< .cse39 5000000)))) is different from false [2021-11-23 12:42:58,773 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 31 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse0) (< .cse0 5000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (<= 4294967295 .cse1) (< .cse1 5000000))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< .cse2 5000000) (<= 4294967295 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse3 5000000) (<= 4294967295 .cse3))) (let ((.cse4 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse4) (< .cse4 5000000))) (let ((.cse5 (mod (+ 35 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse5) (< .cse5 5000000))) (let ((.cse6 (mod (+ 2 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse6) (< .cse6 5000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (<= 4294967295 .cse7) (< .cse7 5000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (<= 4294967295 .cse8) (< .cse8 5000000))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse9 5000000) (<= 4294967295 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (<= 4294967295 .cse10) (< .cse10 5000000))) (let ((.cse11 (mod (+ 29 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse11) (< .cse11 5000000))) (let ((.cse12 (mod (+ 5 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse12) (< .cse12 5000000))) (let ((.cse13 (mod (+ 22 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse13 5000000) (<= 4294967295 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse14 5000000) (<= 4294967295 .cse14))) (let ((.cse15 (mod (+ 16 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse15) (< .cse15 5000000))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse16 5000000) (<= 4294967295 .cse16))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse17 5000000) (<= 4294967295 .cse17))) (let ((.cse18 (mod (+ 6 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse18 5000000) (<= 4294967295 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (<= 4294967295 .cse19) (< .cse19 5000000))) (let ((.cse20 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse20 5000000) (<= 4294967295 .cse20))) (let ((.cse21 (mod (+ 21 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse21) (< .cse21 5000000))) (let ((.cse22 (mod (+ 3 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse22 5000000) (<= 4294967295 .cse22))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (<= 4294967295 .cse23) (< .cse23 5000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< .cse24 5000000) (<= 4294967295 .cse24))) (let ((.cse25 (mod (+ 32 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse25) (< .cse25 5000000))) (let ((.cse26 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse26 5000000) (<= 4294967295 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (<= 4294967295 .cse27) (< .cse27 5000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse28 5000000) (<= 4294967295 .cse28))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse29 5000000) (<= 4294967295 .cse29))) (let ((.cse30 (mod (+ 9 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse30 5000000) (<= 4294967295 .cse30))) (let ((.cse31 (mod (+ 30 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse31 5000000) (<= 4294967295 .cse31))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< .cse32 5000000) (<= 4294967295 .cse32))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (< .cse33 5000000) (<= 4294967295 .cse33))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse34 5000000) (<= 4294967295 .cse34))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (<= 4294967295 .cse35) (< .cse35 5000000))) (let ((.cse36 (mod (+ 14 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse36 5000000) (<= 4294967295 .cse36))) (let ((.cse37 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse37 5000000) (<= 4294967295 .cse37))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (<= 4294967295 .cse38) (< .cse38 5000000)))) is different from false [2021-11-23 12:43:00,788 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 31 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse0) (< .cse0 5000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (<= 4294967295 .cse1) (< .cse1 5000000))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< .cse2 5000000) (<= 4294967295 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse3 5000000) (<= 4294967295 .cse3))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< .cse4 5000000) (<= 4294967295 .cse4))) (let ((.cse5 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse5) (< .cse5 5000000))) (let ((.cse6 (mod (+ 35 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse6) (< .cse6 5000000))) (let ((.cse7 (mod (+ 2 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse7) (< .cse7 5000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (<= 4294967295 .cse8) (< .cse8 5000000))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (<= 4294967295 .cse9) (< .cse9 5000000))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse10 5000000) (<= 4294967295 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (<= 4294967295 .cse11) (< .cse11 5000000))) (let ((.cse12 (mod (+ 29 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse12) (< .cse12 5000000))) (let ((.cse13 (mod (+ 5 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse13) (< .cse13 5000000))) (let ((.cse14 (mod (+ 22 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse14 5000000) (<= 4294967295 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse15 5000000) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ 16 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse16) (< .cse16 5000000))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse17 5000000) (<= 4294967295 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse18 5000000) (<= 4294967295 .cse18))) (let ((.cse19 (mod (+ 6 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse19 5000000) (<= 4294967295 .cse19))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (<= 4294967295 .cse20) (< .cse20 5000000))) (let ((.cse21 (mod (+ 21 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse21) (< .cse21 5000000))) (let ((.cse22 (mod (+ 3 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse22 5000000) (<= 4294967295 .cse22))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (<= 4294967295 .cse23) (< .cse23 5000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< .cse24 5000000) (<= 4294967295 .cse24))) (let ((.cse25 (mod (+ 32 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse25) (< .cse25 5000000))) (let ((.cse26 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse26 5000000) (<= 4294967295 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (<= 4294967295 .cse27) (< .cse27 5000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse28 5000000) (<= 4294967295 .cse28))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse29 5000000) (<= 4294967295 .cse29))) (let ((.cse30 (mod (+ 9 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse30 5000000) (<= 4294967295 .cse30))) (let ((.cse31 (mod (+ 30 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse31 5000000) (<= 4294967295 .cse31))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< .cse32 5000000) (<= 4294967295 .cse32))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (< .cse33 5000000) (<= 4294967295 .cse33))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse34 5000000) (<= 4294967295 .cse34))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (<= 4294967295 .cse35) (< .cse35 5000000))) (let ((.cse36 (mod (+ 14 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse36 5000000) (<= 4294967295 .cse36))) (let ((.cse37 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse37 5000000) (<= 4294967295 .cse37))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (<= 4294967295 .cse38) (< .cse38 5000000)))) is different from false [2021-11-23 12:44:55,681 WARN L227 SmtUtils]: Spent 35.39s on a formula simplification. DAG size of input: 233 DAG size of output: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 12:44:57,702 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 31 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse0) (< .cse0 5000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (<= 4294967295 .cse1) (< .cse1 5000000))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< .cse2 5000000) (<= 4294967295 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse3 5000000) (<= 4294967295 .cse3))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< .cse4 5000000) (<= 4294967295 .cse4))) (let ((.cse5 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse5) (< .cse5 5000000))) (let ((.cse6 (mod (+ 35 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse6) (< .cse6 5000000))) (let ((.cse7 (mod (+ 2 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse7) (< .cse7 5000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (<= 4294967295 .cse8) (< .cse8 5000000))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse9 5000000) (<= 4294967295 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (<= 4294967295 .cse10) (< .cse10 5000000))) (let ((.cse11 (mod (+ 29 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse11) (< .cse11 5000000))) (let ((.cse12 (mod (+ 5 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse12) (< .cse12 5000000))) (let ((.cse13 (mod (+ 22 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse13 5000000) (<= 4294967295 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse14 5000000) (<= 4294967295 .cse14))) (let ((.cse15 (mod (+ 16 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse15) (< .cse15 5000000))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse16 5000000) (<= 4294967295 .cse16))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse17 5000000) (<= 4294967295 .cse17))) (let ((.cse18 (mod (+ 6 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse18 5000000) (<= 4294967295 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (<= 4294967295 .cse19) (< .cse19 5000000))) (let ((.cse20 (mod (+ 21 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse20) (< .cse20 5000000))) (let ((.cse21 (mod (+ 3 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse21 5000000) (<= 4294967295 .cse21))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (<= 4294967295 .cse22) (< .cse22 5000000))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< .cse23 5000000) (<= 4294967295 .cse23))) (let ((.cse24 (mod (+ 32 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (<= 4294967295 .cse24) (< .cse24 5000000))) (let ((.cse25 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse25 5000000) (<= 4294967295 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (<= 4294967295 .cse26) (< .cse26 5000000))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse27 5000000) (<= 4294967295 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse28 5000000) (<= 4294967295 .cse28))) (let ((.cse29 (mod (+ 9 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse29 5000000) (<= 4294967295 .cse29))) (let ((.cse30 (mod (+ 30 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse30 5000000) (<= 4294967295 .cse30))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< .cse31 5000000) (<= 4294967295 .cse31))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (< .cse32 5000000) (<= 4294967295 .cse32))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse33 5000000) (<= 4294967295 .cse33))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (<= 4294967295 .cse34) (< .cse34 5000000))) (let ((.cse35 (mod (+ 14 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse35 5000000) (<= 4294967295 .cse35))) (let ((.cse36 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse36 5000000) (<= 4294967295 .cse36))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (<= 4294967295 .cse37) (< .cse37 5000000)))) is different from false